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

Miltersen, P. B. & Sørensen, T. B. (2008). Fast algorithms for finding proper strategies in game trees. In S.-T. Huang (Ed.), Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 874-883). Society for Industrial and Applied Mathematics.

Miltersen, P. B., Allender, E., Burgisser, P. & Kjeldgaard-Pedersen, J. (2009). On the complexity of numerical analysis. S I A M Journal on Computing, 38(5), 1987-2006. https://doi.org/10.1137/070697926

Miltersen, P. B. (Ed.) (2008). Conference on Computational Complexity 2007: Guest Editor's Foreword. Computational Complexity, 17(2), 147-148. https://doi.org/10.1007/s00037-008-0247-z

Miltersen, P. B., Nielsen, J. B. & Triandopoulos, N. (2009). Privacy-Enhancing Auctions Using Rational Cryptography. Lecture Notes in Computer Science, 5677, 541-558. https://doi.org/10.1007/978-3-642-03356-8_32

Miltersen, P. B. (1994). Lower bounds for union-split-find related problems on random access machines. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (pp. 625-634). Association for Computing Machinery. https://doi.org/10.1145/195058.195415

Miltersen, P. B. (2008). Trembling hand perfection is NP-hard. http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.0492v1.pdf

Miltersen, P. B., Gurvich, V. & Andersson, D. (2008). The Complexity of Solving Stochastic Games on Graphs. Department of Computer Science, Aarhus University. http://www.daimi.au.dk/~bromille/Papers/mean.pdf

Miltersen, P. B. & Vinodchandran, N. V. (1999). Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th annual Foundations of Computer Science (pp. 71-80). IEEE Computer Society Press. https://doi.org/10.1109/SFFCS.1999.814579

Miltersen, P. B. (2000). On the Shannon function for partially defined Boolean functions. In Proceedings of the Workshop on Boolean Functions and Applications

Miltersen, P. B. (1998). Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms (pp. 556-563). Association for Computing Machinery.

Miltersen, P. B., Vinodchandran, N. V. & Watanabe, O. (1999). Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. In T. Asano, H. Imai, D. T. Lee, S. Nakano & T. Tokuyama (Eds.), Computing and Combinatorics: 5th Annual International Conference, COCOON'99 Tokyo, Japan, July 26-28, 1999 Proceedings (pp. 210-220). Springer. https://doi.org/10.1007/3-540-48686-0_21

Miltersen, P. B., Nisan, N., Safra, S. & Wigderson, A. (1995). On data structures and asymmetric communication complexity. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing (pp. 103-111). Association for Computing Machinery. https://doi.org/10.1145/225058.225093

Miltersen, P. B., Nisan, N., Safra, S. & Wigderson, A. (1998). On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1), 37-49. https://doi.org/10.1006/jcss.1998.1577

Miltersen, P. B. (1996). Lower bounds for static dictionaries on RAMs with bit operations but no multiplication. In Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8-12, 1996 Proceedings (pp. 442-453). Springer. https://doi.org/10.1007/3-540-61440-0_149

Miltersen, P. B., Paterson, M. & Tarui, J. (1996). The asymptotic complexity of merging networks. Journal of the ACM, 43(1), 147-165. https://doi.org/10.1145/227595.227693

Miltersen, P. B., Paterson, M. & Tarui, J. (1992). The asymptotic complexity of merging networks. In 33rd Annual Symposium on Foundations of Computer Science, 1992. Proceedings. (pp. 236-246). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1992.267768

Miltersen, P. B. (1995). On the cell probe complexity of polynomial evaluation. Theoretical Computer Science, 143(1), 167-174. https://doi.org/10.1016/0304-3975(95)80032-5

Miltersen, P. B., Subramanian, S., Vitter, J. S. & Tamassia, R. (1994). Complexity models for incremental computation. Theoretical Computer Science, 130(1), 203-236. https://doi.org/10.1016/0304-3975(94)90159-7

Miltersen, P. B. (1993). The bit probe complexity measure revisited. In P. Enjalbert, A. Finkel & K. W. Wagner (Eds.), STACS 93: 10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25-27, 1993 Proceedings (pp. 662-671). Springer. https://doi.org/10.1007/3-540-56503-5_65

Miltersen, P. B. (1993). The complexity of malign measures. S I A M Journal on Computing, 22(1), 147-156. https://doi.org/10.1137/0222012

Miltersen, P. B. (1991). The complexity of malign ensembles. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991. (pp. 164-171). IEEE Computer Society Press. https://doi.org/10.1109/SCT.1991.160257

Miltersen, P. B. (1992). Circuit depth relative to a random oracle. Information Processing Letters, 42(6), 295-298. https://doi.org/10.1016/0020-0190(92)90225-K

Miltersen, P. B. & Sheffet, O. (2012). Send mixed signals : earn more, work less. In B. Faltings, K. Leyton-Brown & P. Ipeirotis (Eds.), EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce (pp. 234-247). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229033

Miltersen, P. B. (2013). Recent results on howard's algorithm. In A. Kučera (Ed.), Mathematical and Engineering Methods in Computer Science: 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers (pp. 53-56). Springer VS. https://doi.org/10.1007/978-3-642-36046-6_6

Miltersen, P. B. (2014). Leibniz International Proceedings in Informatics: Invited talk. Leibniz International Proceedings in Informatics, 25, 11-12. https://doi.org/10.4230/LIPIcs.STACS.2014.11

Miltersen, P. B. (2014). Semi-algebraic geometry in computational game theory - A consumer's perspective: Invited Talk. In E. W. Mayr & N. Portier (Eds.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (pp. 11-12). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2014.11

Milo, M., Nielsen, E. H., Annenkov, D. & Spitters, B. (2022). Finding smart contract vulnerabilities with ConCert's property-based testing framework. FMBC: Formal Methods for Blockchains https://doi.org/10.48550/arXiv.2208.00758

Milo, M., Nielsen, E. H., Annenkov, D. & Spitters, B. (2022). Finding Smart Contract Vulnerabilities with ConCert's Property-Based Testing Framework. In Z. Dargaye & C. Schneidewind (Eds.), 4th International Workshop on Formal Methods for Blockchains (FMBC 2022) Dagstuhl Publishing. https://doi.org/10.4230/OASIcs.FMBC.2022.2

Millikin, K. (2007). A Structured Approach to the Transformation, Normalization and Execution of Computer Programs.

Milagro, F., Antolin, P., Fernandes, J. M., Zhang, W., Hansen, K. M. & Kool, P. (2009). Deploying Pervasive Web Services over a P2P Overlay. In S. M. Reddy (Ed.), Proceedings of the 18th International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (pp. 240-245). IEEE Computer Society Press. https://doi.org/10.1109/WETICE.2009.39

Mikkelsen, G. L., Keller, M. & Rupp, A. (2012). Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols. Lecture Notes in Computer Science, 7412, 147-166 . https://doi.org/10.1007/978-3-642-32284-6_9

Mikkelsen, G. L. (2011). On the Protection of Digital Identities Through Threshold Cryptography. Department of Computer Science, Aarhus University.

Mikkelsen, T., Zhou, Q., Lystbæk, M. N., Liu, Y., Gellersen, H. & Pfeuffer, K. (2025). DOF-Separation for 3D Manipulation in XR: Understanding Finger-Wrist Separation to Simultaneously Translate and Rotate Objects. In U. Eck, G. Lee, A. Plopski, M. Smith, Q. Sun & M. Tatzgern (Eds.), Proceedings - 2025 IEEE International Symposium on Mixed and Augmented Reality, ISMAR 2025 (pp. 1246-1256). IEEE. https://doi.org/10.1109/ISMAR67309.2025.00130

Mikkelsen, T., Jiang, Y., Coskun, B. F., Wessely, M. & Pfeuffer, K. (2025). Gaze+Mouth: Gaze-Directed Tongue Input with Intraoral Device for Selection in XR. In U. Eck, G. Lee, A. Plopski, M. Smith, Q. Sun & M. Tatzgern (Eds.), Proceedings - 2025 IEEE International Symposium on Mixed and Augmented Reality Adjunct, ISMAR-Adjunct 2025 (pp. 54-58) https://doi.org/10.1109/ISMAR-Adjunct68609.2025.00017

Midtgaard, J. & Jensen, T. P. (2009). Control-flow analysis of function calls and returns by abstract interpretation. In G. Hutton & T. Andrew (Eds.), Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming (pp. 287-298). Association for Computing Machinery. https://doi.org/10.1145/1596550.1596592

Midtgaard, J. (2012). Control-flow analysis of functional programs. A C M Computing Surveys, 44(3), 10:1 - 10:33. https://doi.org/10.1145/2187671.2187672

Midtgaard, J. & Jensen, T. P. (2012). Control-flow analysis of function calls and returns by abstract interpretation. Information and Computation, 211, 49-76. https://doi.org/10.1016/j.ic.2011.11.005

Midtgaard, J., Adams, M. D. & Matthew , M. (2012). A Structural Soundness Proof for Shivers's Escape Technique: A Case for Galois Connections . Lecture Notes in Computer Science, 7460, 352-369. https://doi.org/10.1007/978-3-642-33125-1_24

Midtgaard, J. & Might, M. (Eds.) (2012). Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, NSAD 2012. Elsevier. https://doi.org/10.1016/j.entcs.2012.09.001

Midtgaard, J. & Might, M. (2012). Preface. Elsevier. https://doi.org/10.1016/j.entcs.2012.09.001

Midtgaard, J., Ramsay, N. & Larsen, B. (2013). Engineering Definitional Interpreters. In T. Schrijvers & R. Peña (Eds.), Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming , PPDP '13 (pp. 121-132). Association for Computing Machinery. https://doi.org/10.1145/2505879.2505894

Midtgaard, J., Brabrand, C. & Wasowski , A. (2014). Systematic Derivation of Static Analyses for Software Product Lines. In W. Binder (Ed.), MODULARITY '14 Proceedings of the 13th international conference on Modularity (pp. 181-192 ). Association for Computing Machinery. https://doi.org/10.1145/2577080.2577091

Midtgaard, J. & Møller, A. (2015). QuickChecking Static Analysis Properties. In 8th IEEE International Conference on Software Testing, Verification and Validation (ICST), 2015 (pp. 1-10). IEEE. https://doi.org/10.1109/ICST.2015.7102603

Midtgaard, J. & Møller, A. (2017). QuickChecking static analysis properties. Software Testing, Verification and Reliability, 27(6), Article e1640. https://doi.org/10.1002/stvr.1640

Midtgaard, J. (2007). Transformation, Analysis, and Interpretation of Higher-Order Procedural Programs.

Michalak, T. P., Szczepański , P. L., Rahwan, T., Chrobak, A., Branzei, S., Wooldridge, M. & Jennings , N. (2014). Implementation and Computation of a Value for Generalized Characteristic Function Games. A C M Transactions on Economics and Computation, 2(4), Article 16. https://doi.org/10.1145/2665007

Michael-Grigoriou, D., Zachmann, G., Kopper, R., Yoon, S. H., Zollmann, S. & Bourdot, P. (2025). Preface. In Virtual Reality and Mixed Reality: 22nd EuroXR International Conference, EuroXR 2025, Winterthur, Switzerland, September 3–5, 2025, Proceedings (Vol. 16101 LNCS, pp. v-vi)

Micenková, B., van Beusekom, J. & Shafait, F. (2012). Stamp Verification for Automated Document Authentication. Paper presented at International Workshop on Computational Forensics , Tsukuba, Japan.

Micenková, B., Ng, R. T., Dang, X.-H. & Assent, I. (2013). Explaining outliers by subspace separability. In H. Xiong, G. Karypis, B. Thuraisingham, D. Cook & X. Wu (Eds.), Proceedings, IEEE 13th International Conference on Data Mining (ICDM 2013) (pp. 518 - 527 ). IEEE Press. http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6724379

Micenková, B., McWilliams, B. & Assent, I. (2014). Learning Outlier Ensembles: The Best of Both Worlds–Supervised and Unsupervised. Paper presented at ACM SIGKDD 2014 Workshop ODD2 , New York, United States. http://outlier-analytics.org/odd14kdd/odd-2014-proceedings.pdf

Displaying results 1501 to 1550 out of 5919

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University