Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

Sortér efter: Dato | Forfatter | Titel

Korsgaard, H. (2017). Toward Place-Centric Computing: Making Place With Technology Together.

Yang, B., Guo, C., Ma, Y. & Jensen, C. S. (2015). Toward personalized, context-aware routing. V L D B Journal, 24(2), 297-318. https://doi.org/10.1007/s00778-015-0378-1

Schäfer, Z., Mathisen, A., Svendsen, K., Engberg, S., Rolighed Thomsen, T. & Kirketerp-Møller, K. (2021). Toward Machine-Learning-Based Decision Support in Diabetes Care: A Risk Stratification Study on Diabetic Foot Ulcer and Amputation. Frontiers in medicine, 7, Artikel 601602. https://doi.org/10.3389/fmed.2020.601602

Brewer, R. S., Verdezoto, N., Holst, T. & Rasmussen, M. K. (2015). Tough Shift: Exploring the Complexities of Shifting Residential Electricity Use Through a Casual Mobile Game. I CHI PLAY '15 : Proceedings of the 2015 Annual Symposium on Computer-Human Interaction in Play (s. 307-317). Association for Computing Machinery. https://doi.org/10.1145/2793107.2793108

Pagnin, E., Gunnarsson, G., Talebi, P., Orlandi, C. & Sabelfeld, A. (2019). TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. Proceedings on Privacy Enhancing Technologies, 2019(4), 93-111. https://doi.org/10.2478/popets-2019-0060

LaVigne, R., Liu-Zhang, C.-D., Maurer, U. M., Moran, T., Mularczyk, M. & Tschudi, D. (2018). Topology-Hiding Computation Beyond Semi-Honest Adversaries. I A. Beimel & S. Dziembowski (red.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings: Theory of Cryptography (Bind 11240, s. 3-35). Springer VS. https://doi.org/10.1007/978-3-030-03810-6_1

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Odgaard, M. V., Nygaard, B. & Svenning, J.-C. (2013). Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region. Ecosphere (Washington, D.C.), 4(7), Artikel 91. https://doi.org/10.1890/ES13-00134.1

Munro, J. I., Navarro, G., Nielsen, J. A. S. & ShaH, R. (2014). Top- k Term-Proximity in Succinct Space. I H.-K. Ahn & C.-S. Shin (red.), Algorithms and Computation: 25th International Symposium, ISAAC 2014, Proceedings (s. 169-180 ). Springer VS. https://doi.org/10.1007/978-3-319-13075-0_14

Skovsgaard, A. & Jensen, C. S. (2014). Top-k point of interest retrieval using standard indexes. I Y. Huang & M. Schneider (red.), Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL '14 (s. 173-182 ). Association for Computing Machinery. https://doi.org/10.1145/2666310.2666399

Kjærgaard, M. B. & Blunck, H. (2014). Tool support for detection and analysis of following and leadership behavior of pedestrians from mobile sensing data. Pervasive and Mobile Computing, 10(A), 104-117. https://doi.org/10.1016/j.pmcj.2013.10.007

Blatchley Hansen, A., Eskilden, M. & Nielsen, E. H. (2020). Toolchain for Timing Leakage Analysis of NIST Lightweight Crypto Candidates. Abstract fra NIST Lightweight Cryptography Workshop 2020. https://csrc.nist.gov/CSRC/media/Events/lightweight-cryptography-workshop-2020/documents/papers/toolchain-timing-leakage-lwc2020.pdf

Christensen, P. K., Skovgaard, C. Ø. & Petersen, M. G. (2019). Together together: Combining shared and separate activities in designing technology for family life. I Proceedings of the 18th ACM International Conference on Interaction Design and Children, IDC 2019 (s. 374-385). Association for Computing Machinery. https://doi.org/10.1145/3311927.3323141

Schmidt, E. M., Skyum, S. & Nielsen, M. (2012). To Dexter - A Tribute from Aarhus. I R. L. Constable & A. Silva (red.), Logic and Program Semantics : Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday (s. 341). Springer. https://doi.org/10.1007/978-3-642-29485-3_30

Nasir, M. A. U., Aslay, C., de Francisi Morales, G. & Riondato, M. (2021). TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs. ACM Transactions on Knowledge Discovery from Data, 15(3), 1-35. Artikel 48. https://doi.org/10.1145/3442590

Döttling, N. M., Ghosh, S., Nielsen, J. B., Nilges, T. & Trifiletti, R. (2017). TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. I CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security: CCS '17 (s. 2263-2276). Association for Computing Machinery. https://doi.org/10.1145/3133956.3134024

Trifiletti, R., Nielsen, J. B., Jakobsen, T. P. & Frederiksen, T. K. (2015, apr. 3). TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-Party Computation. https://eprint.iacr.org/2015/309.pdf

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). TinyKeys: A New Approach to Efficient Multi-Party Computation. I H. Shacham & A. Boldyreva (red.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Bind 10993, s. 3-33). Springer VS. https://doi.org/10.1007/978-3-319-96878-0_1

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2022). TinyKeys: A New Approach to Efficient Multi-Party Computation. Journal of Cryptology, 35(2), Artikel 13. https://doi.org/10.1007/s00145-022-09423-5

Hansen, M. T. & Kusy, B. (2011). TinyInventor: A Holistic Approach to Sensor Network Application Development. Afhandling præsenteret på Extending the Internet to Low power and Lossy Networks. IP+SN 2011 , Chicago, IL, USA.

Hansen, M. T. (2011). TinyDebug: Multi-Purpose Passive Debugging Framework for Embedded Wireless Systems. D A I M I P B, (595).

Nyborg, J. C., Pelletier, C., Lefevre, S. & Assent, I. (2022). TimeMatch: Unsupervised Cross-Region Adaptation by Temporal Shift Estimation. ISPRS Journal of Photogrammetry and Remote Sensing, 188, 301-313. https://doi.org/10.1016/j.isprsjprs.2022.04.018

Larsen, K. G., Nelson, J. & Nguyen, H. L. (2015). Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. I R. Servedio & R. Rubinfeld (red.), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (s. 803-812). Association for Computing Machinery. https://doi.org/10.1145/2746539.2746542

Kjærgaard, M. B., Blunck, H., Wüstenberg, M., Grønbæk, K., Wirz, M., Roggen, D. & Tröster, G. (2013). Time-lag Method for Detecting Following and Leadership Behavior of Pedestrians from Mobile Sensing Data. I IEEE International Conference on Pervasive Computing and Communications (PerCom), 2013 (s. 56 - 64 ). IEEE. https://doi.org/10.1109/PerCom.2013.6526714

Bulánek, J., Koucky, M. & Saks, M. (2012). Tight lower bounds for the online labeling problem. I Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (s. 1185-1198). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214083

Gál, A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2011). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electronic Colloquium on Computational Complexity, 18(150). http://eccc.hpi-web.de/report/2011/150/

Gál , A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2012). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. I H. Karloff & T. Pitassi (red.), STOC '12 Proceedings of the 44th symposium on Theory of Computing (s. 479-494). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214023

Gal, A., Hansen, K. A., Koucky, M., Pudlak, P. & Viola, E. (2013). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. I E E E Transactions on Information Theory, 59(10), 6611-6627. https://doi.org/10.1109/TIT.2013.2270275

Hansen, J. C., Kjelstrøm, A. H. & Pavlogiannis, A. (2021). Tight bounds for reachability problems on one-counter and pushdown systems. Information Processing Letters, 171, Artikel 106135. https://doi.org/10.1016/j.ipl.2021.106135

Woodruff, D. P. & Zhang, Q. (2011). Tight Bounds for Distributed Functional Monitoring. http://arxiv.org/abs/1112.5153

David P., W. & Zhang, Q. (2012). Tight Bounds for Distributed Functional Monitoring. I Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (s. 941-960). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214063

Melissaris Papanikolaou, N., Ravi, D. & Yakoubov, S. (2023). Threshold-Optimal MPC With Friends and Foes. 3-24. https://doi.org/10.1007/978-3-031-56235-8_1

Danvy, O. & Zerny, I. (2011). Three Syntactic Theories for Combinatory Graph Reduction. Lecture Notes in Computer Science, 6564, 1-20. https://doi.org/10.1007/978-3-642-20551-4_1

Danvy, O. & Zerny, I. (2013). Three Syntactic Theories for Combinatory Graph Reduction. A C M Transactions on Computational Logic, 14(4), Artikel 29. https://doi.org/10.1145/2528932

Jørgensen, A. G. & Pettie, S. (2014). Threesomes, Degenerates, and Love Triangles. I B. Barak (red.), 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, FOCS (s. 621-630). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2014.72

Grønlund, A. & Pettie, S. (2018). Threesomes, degenerates, and love triangles. Journal of the ACM, 65(4), Artikel 22. https://doi.org/10.1145/3185378

Brewer, R. S., Xu, Y., Lee, G. E., Katchuck, M., Moore, C. A. & Johnson, P. M. (2013). Three Principles for the Design of Energy Feedback Visualizations. International Journal On Advances in Intelligent Systems, 6(3 & 4), 188-198. http://csdl.ics.hawaii.edu/techreports/2013/13-05/13-05.pdf

Sidlauskas, D., Ross, K. A., Jensen, C. S. & Saltenis, S. (2011). Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads. Lecture Notes in Computer Science, 6849, 186-204. https://doi.org/10.1007/978-3-642-22922-0_12

Madsen, O. L. & Møller-Pedersen, B. (2018). This is not a Model: On development of a common terminology for modeling and programming. I T. Margaria & B. Steffen (red.), Leveraging applications of formal methods, verification and validation (Bind I, s. 206-224). Springer. https://doi.org/10.1007/978-3-030-03418-4_13

Bødker, S. (2015). Third-wave HCI, 10 years later - participation and sharing. interactions, 22(5), 24-31. https://doi.org/10.1145/2804405

Hjorth, H. A. & Wilensky, U. (2020). Thinking in Levels Across Multiple Levels. Afhandling præsenteret på Constructionism 2020, Dublin, Irland.

Hu, E., Grønbæk, J. E., Ying, W., Du, R. & Heo, S. (2023). ThingShare: Ad-Hoc Digital Copies of Physical Objects for Sharing Things in Video Meetings. I A. Schmidt, K. Väänänen, T. Goyal, P. O. Kristensson, A. Peters, S. Mueller, J. R. Williamson & M. L. Wilson (red.), CHI'23: Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems Artikel 365 Association for Computing Machinery. https://doi.org/10.1145/3544548.3581148

Bardzell, J. & Bardzell, S. (2015). The User Reconfigured: On Subjectivities of Information. Aarhus Series on Human Centered Computing, 1(1). http://ojs.statsbiblioteket.dk/index.php/ashcc/article/view/21298/18772

Kuutti, K. & Bannon, L. J. (2014). The turn to practice in HCI: Towards a research agenda. I M. Jones , P. Palanque, A. Schmidt & T. Grossman (red.), Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI '14 (s. 3543-3552). Association for Computing Machinery. https://doi.org/10.1145/2556288.2557111

Damgård, I., Nielsen, J. B., Nielsen, M. & Ranellucci, S. (2017). The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. I J. Katz & H. Shacham (red.), Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Proceedings (Bind 10401, s. 167-187). Springer VS. https://doi.org/10.1007/978-3-319-63688-7_6

Chatterjee, K., Pavlogiannis, A., Adlam, B. & Nowak, M. A. (2014). The Time Scale of Evolutionary Innovation. PLoS Computational Biology, Edited by Niko Beerenwinkel, 10(9). https://doi.org/10.1371/journal.pcbi.1003818

Corry, A. V. & Søndergaard, B. D. (2011). The Teaching Portfolio. Developing Good Teachers and Scientists, 1.

Jensen, K., Kristensen, L. M. & Mailund, T. (2012). The sweep-line state space exploration method. Theoretical Computer Science, 429, 169–179. https://doi.org/10.1016/j.tcs.2011.12.036

Aranha, D. F., Engelmann, F. T., Kolby, S. & Yakoubov, S. (2022). The State of the Union: Union-Only Signatures for Data Aggregation. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (s. 387-410). Springer. https://doi.org/10.1007/978-3-031-14791-3_17

Hogräfer, M., Heitzler, M. & Schulz, H.-J. (2020). The State of the Art in Map‐Like Visualization. Computer Graphics Forum, 39(3), 647-674. https://doi.org/10.1111/cgf.14031

Sand, A. & Steel, M. (2013). The standard lateral gene transfer model is statistically consistent for pectinate four-taxon trees. Journal of Theoretical Biology, 335, 295-298. https://doi.org/10.1016/j.jtbi.2013.07.002

Viser resultater 251 til 300 ud af 2823

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series