Department of Computer Science

  1. Published

    Cleaning up: garbage-free reversible circuits by design languages

    Thomsen, Michael Kirkedal, Axelsen, H. B. & Glück, Robert, 2013, 2012 International Symposium on Electronic System Design (ISED). IEEE, p. 6-10 5 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  2. Published

    Interpretation and programming of the reversible functional language RFUN

    Thomsen, Michael Kirkedal & Axelsen, H. B., 14 Sep 2015, Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, IFL 2015. Association for Computing Machinery, Inc., 13 p. 8. (ACM International Conference Proceeding Series, Vol. 14-16-September-2015).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  3. Published

    Bottom-k and priority sampling, set similarity and subset sums with minimal independence

    Thorup, Mikkel, 2013, STOC '13: Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing. Association for Computing Machinery, p. 371-380 10 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  4. Published

    Sample(x)=(a*x< =t) is a distinguisher with probability 1/8

    Thorup, Mikkel, 2015, Proceedings. 56th Annual Symposium on Foundations of Computer Science. IEEE, p. 1277-1291 15 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    Twisted tabulation hashing

    Thorup, Mikkel & Patrascu, M., 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 209-228 20 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Simple tabulation, fast expanders, double tabulation, and high independence

    Thorup, Mikkel, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 90-99 10 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Fast and powerful hashing using tabulation

    Thorup, Mikkel, 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Chatzigiannakis, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2 p. 4. (Leibniz International Proceedings in Informatics, Vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

  8. Published

    Fast and powerful hashing using tabulation

    Thorup, Mikkel, 2016, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Lal, A., Akshay, S., Saurabh, S. & Sen, S. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2 p. 1. (Leibniz International Proceedings in Informatics, Vol. 65).

    Research output: Chapter in Book/Report/Conference proceedingConference abstract in proceedingsResearchpeer-review

  9. Published

    Mihai Pätrascu: obituary and open problems

    Thorup, Mikkel, 2013, In: SIGACT News. 44, 1, p. 110-114 5 p.

    Research output: Contribution to journalJournal articleResearch

  10. Published

    Funding successful research

    Thorup, Mikkel, 2013, In: Communications of the A C M. 56, 3, p. 38-39 2 p.

    Research output: Contribution to journalComment/debateResearch