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

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).

Larsen, K. G. & Simkin, M. (2026). Time/Space Tradeoffs for Generic Attacks on Delay Functions. I B. Applebaum & H. Lin (red.), Theory of Cryptography: 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1–5, 2025, Proceedings, Part IV (s. 451-477). Springer. https://doi.org/10.1007/978-3-032-12290-2_15

Pagter, J. I. (2001). Time-Space Trade-Offs. (BRICS Dissertation Series DS-01-2 udg.) Aarhus University.

Agarwal, P. K., Arge, L. A. & Vahrenhold, J. (2001). Time Responsive External Data Structures for Moving Points. I F. Dehne, J.-R. Sack & R. Tamassia (red.), Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings (s. 50-61). Springer. https://doi.org/10.1007/3-540-44634-6_6

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

Bohøj, M. (2009). Timelines as a Collaborative Planning Tool. D A I M I P B, (591), 6-9.

Bohøj, M., Borchorst, N. G., Bouvin, N. O., Bødker, S. & Zander, P.-O. (2010). Timeline Collaboration. I Proceedings of the 28th International Conference on Human factors in computing Systems. CHI '10 (s. 523-532). Association for Computing Machinery. https://doi.org/10.1145/1753326.1753404

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

Brodal, G. S. & Jacob, R. (2003). Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries. Electronic Notes in Theoretical Computer Science, 92, 3-15. https://doi.org/10.1016/j.entcs.2003.12.019

Brodal, G. S. & Jacob, R. (2001). Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electronic Colloquium on Computational Complexity, 92(ALCOMFT-TR-01-176).

Hune, T. & Nielsen, M. (1998). Timed bisimulation and open maps. I L. Brim, J. Gruska & J. Zlatuska (red.), Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98 Brno, Czech Republic, August 24-28, 1998 Proceedings (s. 378-387). Springer. https://doi.org/10.1007/BFb0055787

Alstrup, S., Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2001). Time and Space Efficient Multi-Method Dispatching. Electronic Colloquium on Computational Complexity, (ITU-TR-2001-8).

Alstrup, S., Brodal, G. S., Gørtz, I. L. & Rauhe, T. (2002). Time and Space Efficient Multi-Method Dispatching. I M. Penttonen & E. M. Schmidt (red.), Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (s. 20-29). Springer. https://doi.org/10.1007/3-540-45471-3_3

Petersen, M. G. (2002). Time and Learning in HCI. I E. Frøkjær & K. Hornbæk (red.), Proceedings of the 2nd Danish Human-Computer Interaction Research Symposium (s. 42-45). University of Copenhagen.

Chrobak, M., Dürr, C., Guíñez, F., Lozano, A. & Thang, N. K. (2010). Tile-Packing Tomography Is NP-hard. Lecture Notes in Computer Science, 6196, 254-263. https://doi.org/10.1007/978-3-642-14031-0_29

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

Larsen, K. G. & Schalburg, N. (2025). Tight Generalization Bounds for Large-Margin Halfspaces. I The Thirty-ninth Annual Conference on Neural Information Processing Systems https://openreview.net/forum?id=wAq0ZLxrGq

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

Hatcliff, J. & Danvy, O. (1997). Thunks and the λ-calculus. Journal of Functional Programming, 7(3), 303-319.

Hatcliff, J. & Danvy, O. (1996). Thunks and the λ-calculus. BRICS Report Series, (RS-96-19).

Hatcliff, J. & Danvy, O. (1997). Thunks and the λ-calculus. BRICS Report Series, (RS-97-7).

Bødker, S. (1987). Through the Interface - a human activity approach to user interfaces. Department of Computer Science, Aarhus University.

Bødker, S. (1991). Through the Interface - a Human Activity Approach to User Interface. Lawrence Erlbaum Associates.

Melissaris Papanikolaou, N., Ravi, D. & Yakoubov, S. (2024). Threshold-Optimal MPC With Friends and Foes. I A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (red.), Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Bind 2, s. 3-24). Springer. https://doi.org/10.1007/978-3-031-56235-8_1

Bendlin, R. & Damgård, I. B. (2010). Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. Lecture Notes in Computer Science, 5978, 201-218. https://doi.org/10.1007/978-3-642-11799-2_13

Doerner, J., Kondi, Y., Lee, E., Shelat, A. & Tyner, L. (2023). Threshold BBS+ Signatures for Distributed Anonymous Credential Issuance. I 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023 (s. 773-789). IEEE. https://doi.org/10.1109/SP46215.2023.10179470

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

Lange, M. (2007). Three Notes on the Complexity of Model Checking Fixpoint Logic with Chop. R.A.I.R.O. - Theoretical Informatics and Applications.

Schwartzbach, M. I. & Palsberg, J. (1992). Three discussions on object-oriented typing. I S. B. Zdonik (red.), ACM SIGPLAN OOPS Messenger (April udg., Bind Vol. 3, Issue 2, s. 31-38). Association for Computing Machinery. https://doi.org/10.1145/130943.130949

Brix, L., Ringgaard, S., Rasmusson, A., Sørensen, T. S. & Kim, W. Y. (2009). Three dimensional three component whole heart cardiovascular magnetic resonance velocity mapping: comparison of flow measurements from 3D and 2D acquisitions. Journal of Cardiovascular Magnetic Resonance, 11(1), 3. https://doi.org/10.1186/1532-429X-11-3

Jensen, H., Jensen, M. Ø. J., Smerup, M. H., Ringgaard, S., Sørensen, T. S., Andersen, N. T., Wierup, P., Hasenkam, J. M. & Nielsen, S. L. (2010). Three-dimensional assessment of papillary muscle displacement in a porcine model of ischemic mitral regurgitation. Journal of Thoracic and Cardiovascular Surgery, 140(6), 1312-1318. https://doi.org/10.1016/j.jtcvs.2009.12.042

Bødker, S. & Mathiasen, N. R. (2008). Threats or threads: from usable security to secure experience. I K. Tollmar & B. Jönsson (red.), ACM International Conference Proceeding Series: Proceedings of the 5th Nordic conference on Human-computer interaction: building bridges (Bind 358, s. 283-290). Association for Computing Machinery.

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

Hansen, K. M. (2004). Thoth - A Publish/Subscribe Architecture for Peer-to-Peer Tool Integration. International Journal on Software Tools for Technology Transfer, 6(3), 219-230. https://doi.org/10.1007/s10009-004-0156-7

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

Jensen, K. (red.) (2001). Third Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools: Aarhus, Denmark, August 29-31, 2001. Department of Computer Science, Aarhus University.

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

Viser resultater 551 til 600 ud af 6058

Forrige

Næste

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series