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, K. A., Miltersen, P. B. & Ibsen-Jensen, R. (2011). The complexity of solving reachability games using value and strategy iteration. Lecture Notes in Computer Science, 6651, 77-90. https://doi.org/10.1007/978-3-642-20712-9_7

Axelsson, R., Lange, M. & Somla, R. (2007). The Complexity of Model Checking Higher-Order Fixpoint Logic. Logical Methods in Computer Science, 3(2). http://arxiv.org/pdf/0704.3931

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. I Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991. (s. 164-171). IEEE Computer Society Press. https://doi.org/10.1109/SCT.1991.160257

Caragiannis, I. & Fehrs, K. (2022). The Complexity of Learning Approval-Based Multiwinner Voting Rules. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 4925-4932. https://doi.org/10.1609/aaai.v36i5.20422

Hansen, T. D. & Ibsen-Jensen, R. (2013). The complexity of interior point methods for solving discounted turn-based stochastic games. I The Nature of Computation, Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings (s. 252-262). Springer VS. https://doi.org/10.1007/978-3-642-39053-1_29

Skyum, S., Frandsen, G. S., Miltersen, P. B. & Binderup, P. G. (1999). The Complexity of Identifying Large Equivalence Classes. Fundamenta Informaticae, 38(1-2), 25-37. https://doi.org/10.3233/FI-1999-381203

Frandsen, G. S., Miltersen, P. B. & Skyum, S. (1993). The complexity of finding replicas using equality tests. I A. M. Borzyszkowsji & S. Sokolowski (red.), Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gdansk, Poland, August 30-September 3, 1993 Proceedings (s. 463-472). Springer. https://doi.org/10.1007/3-540-57182-5_38

Fortune, S., Hopcroft, J. & Schmidt, E. M. (1978). The complexity of equivalence and containment for free single variable program schemes. I G. Ausiello & C. Böhm (red.), Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17–21, 1978 (s. 227-240). Springer. https://doi.org/10.1007/3-540-08860-1_17

Mathur, U., Pavlogiannis, A. & Viswanathan, M. (2020). The Complexity of Dynamic Data Race Prediction. I Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020 (s. 713–727). Artikel 3394783 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394783

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S. & Östlin, A. (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. I F. Orejas, P. G. Spirakis & J. van Leeuwen (red.), Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (s. 140-151). Springer. https://doi.org/10.1007/3-540-48224-5_12

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S., Östlin, A., Orejas, F. (red.), Spirakis, P. G. (red.) & Leeuwen, J. V. (red.) (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. I Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science udg., Bind 2076/2001, s. 140-151). Springer.

Brodal, G. S. & Skyum, S. (1996). The Complexity of Computing the -ary Composition of a Binary Associative Operator. Department of Computer Science, Aarhus University. BRICS Report Series Nr. 96-42 http://www.brics.dk/RS/96/42/BRICS-RS-96-42.pdf

Etessami, K., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2014). The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. I R. Lavi (red.), Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (s. 231-243 ). Springer VS. https://doi.org/10.1007/978-3-662-44803-8_20

Ghosh, S. & Simkin, M. (2019). The Communication Complexity of Threshold Private Set Intersection. I A. Boldyreva & D. Micciancio (red.), Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Bind II, s. 3-29). Springer. https://doi.org/10.1007/978-3-030-26951-7_1

Huang, Z. & Yi, K. (2014). The communication complexity of distributed epsilon-approximations. I D. Shmoys (red.), 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (s. 591-600). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2014.69

Evangelista, S., Westergaard, M. & Kristensen, L. M. (2008). The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection. I Ninth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (s. 63-82). Department of Computer Science.

Evangelista, S., Westergaard, M. & Kristensen, L. M. (2009). The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection. Lecture Notes in Computer Science, 5800, 189-215. https://doi.org/10.1007/978-3-642-04856-2_8

Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007). The ComBack Method - Extending Hash Compaction with Backtracking. I Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings (s. 455-464). Springer. https://doi.org/10.1007/978-3-540-73094-1_26

Ehn, P. & Kyng, M. (1987). The Collective Resource Approach to Systems Design. I G. Bjerknes, P. Ehn & M. Kyng (red.), Computers and Democracy - a Scandinavian Challenge (s. 17-58). Gower Publishing.

Brody, J. & Verbin, E. (2010). The Coin Problem and Pseudorandomness for Branching Programs. I 51st Annual IEEE Symposium on Foundations of Computer Science. FOCS 2010 (s. 30-39). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2010.10

Kranen, P., Assent, I., Baldauf, C. & Seidl, T. (2011). The ClusTree : indexing micro-clusters for anytime stream mining. Knowledge and Information Systems, 29(2), 249-272. https://doi.org/10.1007/s10115-010-0342-8

Bahr, P., Grathwohl, H. B. & Møgelberg, R. E. (2017). The clocks are ticking: No more delays! I 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 Artikel 8005097 IEEE. https://doi.org/10.1109/LICS.2017.8005097

Satyanarayan, A., Strazzulla, D., Klokmose, C. N., Beaudouin-Lafon, M. & Mackay, W. (2013). The CHI 2013 interactive schedule. I W. E. Mackay, S. Brewster & S. Brewster (red.), CHI EA '13 CHI '13 Extended Abstracts on Human Factors in Computing Systems (s. 2987-2990). Association for Computing Machinery. https://doi.org/10.1145/2468356.2479591

Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2015). The Chaining Lemma and its application. I A. Lehmann & S. Wolf (red.), Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (s. 181-196). Springer VS. https://doi.org/10.1007/978-3-319-17470-9_11

Gal, A. & Miltersen, P. B. (2003). The Cell Probe Complexity of Succinct Data Structures. I J. C. M. Baeten, J. K. Lenstra, J. Parrow & G. J. Wöeginger (red.), Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 - July 4, 2003 Proceedings (s. 442-453). Springer. https://doi.org/10.1007/3-540-45061-0_28

Miltersen, P. B. & Gal, A. (2007). The Cell Probe Complexity of Succinct Data Structures. Theoretical Computer Science, 379(3), 405-417. https://doi.org/10.1016/j.tcs.2007.02.047

Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. I STOC’12 : Proceedings of the 44th symposium on Theory of Computing (s. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987

Ernst, E. (2010). The Case for Simple Object-Orientation in VDM++. Datalogisk Institut, Aarhus Universitet. http://wiki.overturetool.org/images/5/5d/2010ernst.pdf

Arge, L. A. (2003). The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica, 37, Issue 1, 1-24. https://doi.org/10.1007/s00453-003-1021-x

Arge, L. A. (1995). The buffer tree: A new technique for optimal I/O-algorithms. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 334-345). Springer. https://doi.org/10.1007/3-540-60220-8_74

Westergaard, M. (2006). The BRITNeY Suite: A Platfor for Experiments. I K. Jensen (red.), Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools: CPN'06 workshop (s. 97-116). Aarhus Universitetsforlag.

Westergaard, M. & Lassen, K. B. (2006). The BRITNeY Suite Animation Tool. I Petri Nets and Other Models of Concurrency ICATPN 2006 (Bind 4024, s. 331-340). Springer.

Damgård, I. B. & Knudsen, L. R. (1994). The breaking of the AR Hash Function. I T. Helleseth (red.), Advances in Cryptology - EUROCRYPT '93: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23-27, 1993 Proceedings Springer. https://doi.org/10.1007/3-540-48285-7_25

Bødker, S., Zander, P.-O. & Borchorst, N. G. (2009). The boundaries of participatory citizenship. I I. Wagner, H. Tellioglu, E. Balka, C. Simone & L. Ciolfi (red.), Proceedings of the 11th European Conference on Computer Supported Cooperative Work, (ECSCW) (s. 1-20). Springer. https://doi.org/10.1007/978-1-84882-854-4_1

Eriksen, S. H., Jensen, B. B., Kristensen, B. B. & Madsen, O. L. (1977). The BOBS-system. Aarhus University. DAIMI PB Nr. 71

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

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2018). The Big Match with a Clock and a Bit of Memory. I É. Tardos, E. Elkind & R. Vohra (red.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (s. 149-150). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219198

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2023). The Big Match with a Clock and a Bit of Memory. Mathematics of Operations Research, 48(1), 419-432. https://doi.org/10.1287/moor.2022.1267

Hansen, K. A., Ibsen-Jensen, R. & Koucký, M. (2016). The big match in small space. I M. Gairing & R. Savani (red.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Bind 9928, s. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

Feldthaus, A. & Møller, A. (2009). The Big Manual for the Java String Analyzer: Latest release: version 2.1-1, November 30, 2009. http://www.brics.dk/JSA/

Kristensen, B. B., Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1987). The BETA Programming Language. I B. D. Shriver & P. Wegner (red.), Research Directions in Object Oriented Programming (s. 7-48). MIT Press.

Hansen, K. M. (1999). The BetaDBC Library.

Bilstrup, K.-E. K., Kaspersen, M. H., Larsen, M. F., Bouvin, N. O. & Petersen, M. G. (2022). The Best of Both Worlds: Designing a Tiered Hybrid Interface for Teaching Machine Learning in K-9 Education. I Participative Computing for Sustainable Futures : Proceedings of the 12th Nordic Conference on Human-Computer Interaction (NordiCHI’22) Artikel 51 https://doi.org/10.1145/3546155.3546156

Bardram, J. E. & Hansen, T. R. (2004). The AWARE Architecture: Supporting Context Mediated Social Awareness in Mobile Cooperation. I Ikke angivet (s. 192-201). Association for Computing Machinery.

Ackerman, M. & Branzei, S. (2014). The Authorship Dilemma: Alphabetical or Contribution? I A. Bazzan & M. Huhns (red.), Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems : AAMAS '14 (s. 1487-1488). Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2616025&bnc=1

Markussen, R., Mogensen, P. H., Bødker, S., Christiansen, E., Ehn, P. & Trigg, R. (1993). The AT project. Practical Research in Cooperative Design. I The AT Project (Bind DAIMI PB-454,). Department of Computer Science, University of Aarhus.

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. I 33rd Annual Symposium on Foundations of Computer Science, 1992. Proceedings. (s. 236-246). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1992.267768

Buemann, B., Schierning, B., Toubro, S., Bibby, B. M., Sørensen, T., Dalgaard, L., Pedersen, O. & Astrup, A. (2001). The association between the val/ala-55 polymorphism of the uncoupling protein 2 gene and exercise efficiency. International Journal of Obesity, 25(4), 467-471. https://doi.org/10.1038/sj.ijo.0801564

Viser resultater 801 til 850 ud af 6042

Forrige

Næste

Revideret 26.11.2025

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series