Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Sort by: Date | Author | Title

Damm, C. H., Hansen, K. M. & Thomsen, M. (2000). Tool support for cooperative object-oriented design: gesture based modelling on an electric whiteboard. In Proceedings of the SIGCHI conference on Human factors in computing systems (pp. 518-525). Association for Computing Machinery. https://doi.org/10.1145/332040.332488

Hansen, K. M. & Ratzer, A. V. (2002). Tool Support for Collaborative Teaching and Learning of Object-Oriented Modelling. In Proceedings of the 7th annual conference on Innovation and technology in computer science education (pp. 146-150). Association for Computing Machinery. https://doi.org/10.1145/544414.544458

Feldthaus, A., Millstein, T., Møller, A., Schäfer, M. & Tip, F. (2011). Tool-supported Refactoring for JavaScript. In Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications (pp. 119-138). Association for Computing Machinery. https://doi.org/10.1145/2048066.2048078

Bouvin, N. O., Brodersen, A. C., Hansen, F. A., Iversen, O. S. & Nørregaard, P. (2005). Tools of Contextualization: Extending the Classroom to the Field. In Proceedings of the 2005 conference on Interaction design and children (pp. 24-31). Association for Computing Machinery. https://doi.org/10.1145/1109540.1109544

Grønbæk, K. & Knudsen, J. L. (1992). Tools and Techniques for Experimental System Development. In K. Systä, P. Kellomäki & R. Mäkinen (Eds.), Proceedings of the Nordic Workshop on Programming Environment Research

Jensen, K. & Podelski, A. (Eds.) (2004). Tools and Algorithms for the Construction and Analysis of Systems: 10th International Conference, TACAS 2004, held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004,Barcelona, Spain, March 29 - April 2, 2004 : proceedings. Springer. Lecture Notes in Computer Science Vol. 2988 https://doi.org/10.1007/b96393

Schwartzbach, M. I. & Graf, S. (Eds.) (2000). Tools and Algorithms for Construction and Analysis of Systems: 6th International Conference, TACAS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings. Springer. Lecture Notes in Computer Science Vol. 1785 https://doi.org/10.1007/3-540-46419-0

Bertelsen, O. W., Breinbjerg, M. & Pold, S. (2008). Tool – Material, Metaphor – Metonymy, Instrument(ness). In J. J. Jensen (Ed.), Proceedings of the Eighth Danish Human-Computer Interaction Research Symposium (pp. 5-9). Aalborg Universitetsforlag.

Damm, C. H., Hansen, K. M., Thomsen, M. & Tyrsted, M. (2000). Tool Integration: Experiences and Issues in Using XMI and Component Technology. In Proceedings of the Technology of Object-Oriented Languages and Systems Conference (pp. 94-107). IEEE Computer Society Press. https://doi.org/10.1109/TOOLS.2000.848754

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

Petersen, M. B., Slothuus, R., Stubager, R. & Togeby, L. (2007). Tolerance. Frisind gælder ikke alle mindretal. Politiken, 4.

Christensen, P. K., Skovgaard, C. Ø. & Petersen, M. G. (2019). Together together: Combining shared and separate activities in designing technology for family life. In Proceedings of the 18th ACM International Conference on Interaction Design and Children, IDC 2019 (pp. 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. In R. L. Constable & A. Silva (Eds.), Logic and Program Semantics : Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday (pp. 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. Article 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. In CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security: CCS '17 (pp. 2263-2276). Association for Computing Machinery. https://doi.org/10.1145/3133956.3134024

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). TinyKeys: A New Approach to Efficient Multi-Party Computation. In H. Shacham & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Vol. 10993, pp. 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), Article 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. Paper presented at Extending the Internet to Low power and Lossy Networks. IP+SN 2011 , Chicago, IL, United States.

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

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

Agarwal, P. K., Arge, L. A. & Vahrenhold, J. (2001). Time Responsive External Data Structures for Moving Points. In F. Dehne, J.-R. Sack & R. Tamassia (Eds.), Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings (pp. 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. In R. Servedio & R. Rubinfeld (Eds.), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (pp. 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. In Proceedings of the 28th International Conference on Human factors in computing Systems. CHI '10 (pp. 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. In IEEE International Conference on Pervasive Computing and Communications (PerCom), 2013 (pp. 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. In L. Brim, J. Gruska & J. Zlatuska (Eds.), Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98 Brno, Czech Republic, August 24-28, 1998 Proceedings (pp. 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. In M. Penttonen & E. M. Schmidt (Eds.), Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings (pp. 20-29). Springer. https://doi.org/10.1007/3-540-45471-3_3

Petersen, M. G. (2002). Time and Learning in HCI. In E. Frøkjær & K. Hornbæk (Eds.), Proceedings of the 2nd Danish Human-Computer Interaction Research Symposium (pp. 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. In Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (pp. 1185-1198). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214083

Chakraborty, D., Kamma, L. & Larsen, K. G. (2018). Tight cell probe bounds for succinct boolean matrix-Vector multiplication. In STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1297-1306). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188830

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. In H. Karloff & T. Pitassi (Eds.), STOC '12 Proceedings of the 44th symposium on Theory of Computing (pp. 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, Article 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. In Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (pp. 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. B R I C S Report Series, (RS-96-19).

Hatcliff, J. & Danvy, O. (1997). Thunks and the λ-calculus. B R I C S 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. In A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (Eds.), Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Vol. 2, pp. 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. In 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023 (pp. 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

Displaying results 501 to 550 out of 5702

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University