Du er her: Om instituttet » Personer og Lokationer » Personer » Peter Bro Miltersen » Publikationer

Peter Bro Miltersen

1 - 87 ud af 87Pr. side: 100
RSS feed af denne liste
Sortering: Udgivelsesår
  1. 2012
  2. Udgivet

    Deterministic Graphical Games Revisited. / Andersson, Klas Olof Daniel ; Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Journal of Logic and Computation, Vol. 22, Nr. 2, 2012, s. 165-178.

    Publikation: Forskning - peer review › Tidsskriftartikel

  3. 2011
  4. Udgivet

    Exact algorithms for solving stochastic games. / Hansen, Kristoffer Arnsfelt ; Koucký, Michal ; Lauritzen, Niels ; Miltersen, Peter Bro ; Tsigaridas, Elias.

    I: STOC'11: proceedings of the 43rd annual ACM symposium on Theory of computing. New York : Association for Computing Machinery, 2011. s. 205-214.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  5. Udgivet

    Solving simple stochastic games with few coin toss positions. / Ibsen-Jensen, Rasmus ; Miltersen, Peter Bro.

    2011.

    Publikation: Forskning › Working paper

  6. Udgivet

    Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. / Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Zwick, Uri.

    I: Proceedings of the Second Symposium on Innovations in Computer Science . Tsinghua University Press, Beijing, 2011. s. 253-263.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  7. Udgivet

    The complexity of solving reachability games using value and strategy iteration. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Ibsen-Jensen, Rasmus.

    I: Lecture Notes in Computer Science, Vol. 6651, 2011, s. 77-90.

    Publikation: Forskning - peer review › Konferenceartikel

  8. 2010
  9. Udgivet

    Computing a quasi-perfect equilibrium of a two-player game. / Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Economic Theory, Vol. 42, Nr. 1, 2010, s. 175-192.

    Publikation: Forskning - peer review › Tidsskriftartikel

  10. Udgivet

    The computational complexity of trembling hand perfection and other equilibrium refinements. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Lecture Notes in Computer Science, Vol. 6386, 2010, s. 198-209.

    Publikation: Forskning - peer review › Konferenceartikel

  11. 2009
  12. Udgivet

    Existence and computation of equilibria of first-price auctions with integral valuations and bids. / Escamocher, Guillaume ; Miltersen, Peter Bro ; Santillan, Rocio.

    I: Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'09): SESSION: Interactions. red. / Keith S. Decker ; Jaime Simão Sichman ; Carles Sierra ; Cristiano Castelfranchi. Vol. 2 International Foundation for Autonomous Agents and Multiagent Systems, 2009. s. 1227-1228.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  13. Udgivet

    Hilbert's thirteenth problem and circuit complexity. / Hansen, Kristoffer Arnsfelt ; Lachish, Oded ; Miltersen, Peter Bro.

    I: Lecture Notes in Computer Science, Vol. 5878, 2009, s. 153-162.

    Publikation: Forskning - peer review › Konferenceartikel

  14. Udgivet

    On the complexity of numerical analysis. / Miltersen, Peter Bro ; Allender, Eric ; Burgisser, Peter ; Kjeldgaard-Pedersen, Johan.

    I: S I A M Journal on Computing, Vol. 38, Nr. 5, 2009, s. 1987-2006.

    Publikation: Forskning - peer review › Tidsskriftartikel

  15. Udgivet

    Privacy-Enhancing Auctions Using Rational Cryptography. / Miltersen, Peter Bro ; Nielsen, Jesper Buus ; Triandopoulos, Nikolaos.

    I: Lecture Notes in Computer Science, Vol. 5677, 2009, s. 541-558.

    Publikation: Forskning - peer review › Konferenceartikel

  16. Udgivet

    SOFSEM 2009: Theory and Practice of Computer Science : 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. / Bielikova, Maria (Redaktør) ; Nielsen, Mogens (Redaktør) ; Kucera, Antonin (Redaktør) ; Miltersen, Peter Bro (Redaktør) ; Palamidessi, Catuscia (Redaktør) ; Tuma, Petr (Redaktør) ; Valencia, Frank (Redaktør).

    Springer, 2009. 132 s. (Lecture Notes in Computer Science).

    Publikation: Forskning › Antologi

  17. Udgivet

    The complexity of solving stochastic games on graphs. / Andersson, Daniel ; Miltersen, Peter Bro.

    I: Lecture Notes in Computer Science, 2009, s. 112-121.

    Publikation: Forskning - peer review › Konferenceartikel

  18. Udgivet

    Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. / Hansen, Kristoffer Arnsfelt ; Koucký, Michal ; Miltersen, Peter Bro.

    I: Symposium on Logic in Computer Science, 2009, s. 332-341.

    Publikation: Forskning - peer review › Konferenceartikel

  19. 2008
  20. Udgivet

    Approximability and Parameterized Complexity of Minmax Values. / Hansen, Kristoffer Arnsfelt ; Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Lecture Notes in Computer Science, Vol. 5385, 2008, s. 684-695.

    Publikation: Forskning - peer review › Konferenceartikel

  21. Udgivet

    Conference on Computational Complexity 2007 : Guest Editor's Foreword. / Miltersen, Peter Bro (Redaktør).

    I: Computational Complexity, Vol. 17, Nr. 2, 2008, s. 147-148.

    Publikation: Forskning › Tidsskriftartikel

  22. Udgivet

    Deterministic Graphical Games Revisited. / Andersson, Daniel ; Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Lecture Notes in Computer Science, Vol. 5028, 2008, s. 1-10.

    Publikation: Forskning - peer review › Konferenceartikel

  23. Udgivet

    Equilibrium Computation : 18.11. - 23.11.2007. / Herings, P. Jean-Jacques ; Jurdzinski, Marcin ; Miltersen, Peter Bro ; Tardos, Éva ; von Stengel, Bernhard.

    I: Dagstuhl Seminar Proceedings, Vol. 07471, 2008.

    Publikation: Forskning › Leder

  24. Udgivet

    Fast algorithms for finding proper strategies in game trees. / Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. red. / Shang-Teng Huang. Society for Industriel & Applied Mathematics, 2008. s. 874-883.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  25. Udgivet

    On Range of Skill. / Hansen, Thomas Dueholm ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence: Constraints, Satisfiability, and Search. AAAI Press, 2008. s. 277-282.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  26. Udgivet

    The Complexity of Solving Stochastic Games on Graphs. / Miltersen, Peter Bro ; Gurvich, Vladimir ; Andersson, Daniel.

    Department of Computer Science, Aarhus University, 2008.

    Publikation: Forskning › Working paper

  27. Udgivet

    Trembling hand perfection is NP-hard. / Miltersen, Peter Bro.

    2008.

    Publikation: Forskning › Working paper

  28. 2007
  29. Udgivet

    Special issue of "Computational Complexity" for IEEE Conference on Computational Complexity, 2007. / Miltersen, Peter Bro (Redaktør).

    I: Mangler titel. 2007.

    Publikation: Forskning › Bidrag til bog/antologi

  30. Udgivet

    A Near-Optimal Strategy for a Heads-Up No-Limit Texas Hold'em Poker Tournament. / Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems. 2007. s. 1168-1175.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  31. Udgivet

    Computing Proper Equilibria of Zero-Sum Games. / Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Proceedings of the 5th International Conference on Computers and Games: Computers and Games. Springer Verlag. ISBN-rødder: 0-978, 2007. s. 200-211 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  32. Udgivet

    Finding Equilibria in Games of No Chance. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Computing and Combinatorics: Proc. of 13th Annual International Computing and Combinatorics Conference (COCOON 2007). red. / Guohui Lin. Springer, 2007. s. 274-284 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  33. Udgivet

    The Cell Probe Complexity of Succinct Data Structures. / Miltersen, Peter Bro ; Gal, Anna.

    I: Theoretical Computer Science, Vol. 379, Nr. 3, 2007, s. 405-417.

    Publikation: Forskning - peer review › Tidsskriftartikel

  34. Udgivet

    The Computational Complexity of One-dimensional Sandpiles. / Miltersen, Peter Bro.

    I: Theory of Computing Systems, Vol. Volume 41, Nr. 1, 2007, s. 119-125.

    Publikation: Forskning - peer review › Tidsskriftartikel

  35. 2006
  36. Udgivet

    Circuits on Cylinders. / Hansen, Kristoffer Arnsfelt ; Miltersen, Peter Bro ; Vinay, V.

    I: Computational Complexity, Vol. 15, Nr. 1, 2006, s. 62-81.

    Publikation: Forskning - peer review › Tidsskriftartikel

  37. Udgivet

    Computing Sequential Equilibria for Two-Player Games. / Miltersen, Peter Bro ; Sørensen, Troels Bjerre.

    I: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. 1. udg. Association for Computing Machinery, 2006. s. 107-116.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  38. Udgivet

    Computing sequential equilibria for two-player games.. / Miltersen, Peter Bro.

    I: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06). ACM-SIAM, 2006. s. 107-116.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  39. Udgivet

    Finding small OBDDs for incompletely specified truth tables is hard. / Miltersen, Peter Bro ; Kristensen, Jesper Torp.

    I: Computing and Combinatorics: 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006. Proceedings. red. / Danny Z. Chen ; D. T. Lee. Springer Verlag. ISBN-rødder: 0-978, 2006. s. 489-496 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  40. Udgivet

    Finding small OBDDs for incompletely specified truth tables is hard. / Kristensen, Jesper Torp ; Miltersen, Peter Bro.

    I: Electronic Colloquium on Computational Complexity, Nr. TR06-004, 2006, s. 1-6.

    Publikation: Forskning › Tidsskriftartikel

  41. Udgivet

    On the Complexity of Numerical Analysis. / Miltersen, Peter Bro ; Kjeldgaard-Pedersen, Johan ; Burgisser, Peter ; Allender, Eric.

    I: Proceedings of the 21st Annual IEEE Conference on Computational Complexity. IEEE Computer Society Press, 2006. s. 331-339.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  42. 2005
  43. Udgivet

    Derandomizing Arthur-Merlin Games using Hitting Sets. / Miltersen, Peter Bro ; Vinodchandran, N. V..

    I: I E E E Conference on Computational Complexity. Proceedings, Vol. 14, Nr. 3, 2005, s. 256-279.

    Publikation: Forskning - peer review › Tidsskriftartikel

  44. Udgivet

    Lower bounds on the size of rank and selection indexes. / Miltersen, Peter Bro.

    I: Proceedings of the Symposium on Discrete Algorithms. Society for Industriel & Applied Mathematics, 2005. s. 11-12.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  45. Udgivet

    On converting CNF to DNF. / Miltersen, Peter Bro ; Radhakrishnan, Jaikumar ; Wegener, Ingo.

    I: Theoretical Computer Science, Vol. 347, 2005, s. 325-335.

    Publikation: Forskning - peer review › Tidsskriftartikel

  46. Udgivet

    On the Complexity of Numerical Analysis. / Allender, Eric ; Bürgisser, Peter ; Kjeldgaard-Pedersen, Johan ; Miltersen, Peter Bro.

    I: Electronic Colloquium on Computational Complexity, Nr. TR05-037, 2005, s. 1-12.

    Publikation: Forskning › Tidsskriftartikel

  47. Udgivet

    Reviewing Bounds on the Circuit Size of the Hardest Functions. / Frandsen, Gudmund Skovbjerg ; Miltersen, Peter Bro.

    I: Information Processing Letters, Vol. 95, Nr. 2, 2005, s. 354-357.

    Publikation: Forskning - peer review › Tidsskriftartikel

  48. Udgivet

    The Computational Complexity of One-Dimensional Sandpiles. / Miltersen, Peter Bro.

    I: New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings. red. / S. Barry Cooper ; Benedikt Löwe ; Leen Torenvliet. Springer Verlag. ISBN-rødder: 0-978, 2005. s. 342-350 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  49. 2004
  50. Udgivet

    Some Meet-in-the-middle Circuit Lower Bounds. / Hansen, K.A. ; Miltersen, P.B..

    I: Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings. red. / Jiri Fiala ; Vaclav Koubek ; Jan Kratochvil. Springer, 2004. s. 334-345 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  51. 2003
  52. Udgivet

    Circuits on Cylinders. / Hansen, K.A. ; Miltersen, P.B. ; Vinay, V..

    I: Fundamentals of Computation Theory. Springer Verlag. ISBN-rødder: 0-978, 2003. s. 171-182 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  53. Udgivet

    On converting CNF to DNF. / Miltersen, Peter Bro ; Radhakrishnan, J. ; Wegener, I..

    I: Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings. red. / Branislav Rovan ; Peter Vojtás. Springer Verlag. ISBN-rødder: 0-978, 2003. s. 612-621 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  54. Udgivet

    The Cell Probe Complexity of Succinct Data Structures. / Gal, Anna ; Miltersen, Peter Bro.

    I: Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 - July 4, 2003 Proceedings. red. / Jos C.M. Baeten ; Jan Karel Lenstra ; Joachim Parrow ; Gerhard J. Wöeginger. Springer, 2003. s. 442-453 (Lecture Notes in Computer Science).

    Publikation: Forskning › Konferencebidrag i proceedings

  55. 2002
  56. Udgivet

    Are Bitvectors Optimal?. / Buhrman, Harry ; Miltersen, Peter Bro ; Radhakrishnan, Jaikumar ; Venkatesh, Srinivasan.

    I: S I A M Journal on Computing, Vol. 31, Nr. 6, 2002, s. 1723-1744.

    Publikation: Forskning - peer review › Tidsskriftartikel

  57. Udgivet

    Circuits on Cylinders. / Hansen, K.A. ; Miltersen, P.B. ; Vinay, V..

    I: Electronic Colloquium on Computational Complexity, Nr. TR02-066, 2002.

    Publikation: Forskning - peer review › Tidsskriftartikel

  58. 2001
  59. Udgivet

    Derandomizing complexity classes. / Miltersen, Peter Bro ; Rajasekaran, Sanguthevar (Redaktør) ; Pardalos, Panos Miltiades (Redaktør) ; Reif, John Henry (Redaktør) ; Rolim, José Diaulas Palazzo (Redaktør).

    I: Handbook on Randomized Computing: Combinatorial Optimization, Vol. 9. Vol. II, chapter 19 chapter 19. udg. Kluwer Academic Publishers (Springer), 2001. s. 843-935.

    Publikation: Forskning › Bidrag til bog/antologi

  60. Udgivet

    Deterministic Dictionaries. / Hagerup, Torben ; Miltersen, Peter Bro ; Pagh, Rasmus.

    I: J. Algorithms, Vol. 41, Nr. 1, 2001, s. 69-85.

    Publikation: Forskning - peer review › Tidsskriftartikel

  61. Udgivet

    Deterministic Dictionaries. / Hagerup, T. ; Miltersen, P.B. ; Pagh, R..

    I: Journal of Algorithms, Vol. 41, 2001, s. 69-85.

    Publikation: Forskning - peer review › Tidsskriftartikel

  62. Udgivet

    Lower Bounds for Dynamic Algebraic Problems. / Frandsen, Gudmund Skovbjerg ; Hansen, J.P. ; Miltersen, Peter Bro.

    I: Information and Computation, Vol. 171, Nr. 2, 2001, s. 333-349.

    Publikation: Forskning - peer review › Tidsskriftartikel

  63. Udgivet

    On pseudorandom generators in NC0. / Cryan, Mary ; Miltersen, Peter Bro.

    I: Mathematical Foundations of Computer Science 2001: Lecture Notes in Computer Science. red. / Jiŕı Sgall ; Ales Pultr ; Petr Kolman. Vol. 2136/2001 Lecture Notes in Computer Science 2136. udg. Springer, 2001. s. 272-284.

    Publikation: Forskning › Konferencebidrag i proceedings

  64. 2000
  65. Udgivet

    Are bitvectors optimal?. / Buhrman, Harry ; Miltersen, Peter Bro ; Radhakrishnan, Jaikumar ; Venkatesh, Srinivasan.

    I: Proceedings of the thirty-second annual ACM symposium on Theory of computing. Association for Computing Machinery, 2000. s. 449-458.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  66. Udgivet

    New bounds for the language compression problem. / Buhrman, Harry ; Miltersen, Peter Bro ; Laplante, Sophie.

    I: 15th Annual IEEE Conference on Computational Complexity, 2000. Proceedings. . IEEE Computer Society Press, 2000. s. 126-130.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  67. Udgivet

    On the Shannon function for partially defined Boolean functions. / Miltersen, Peter Bro.

    I: Proceedings of the Workshop on Boolean Functions and Applications. 2000.

    Publikation: Forskning › Konferencebidrag i proceedings

  68. 1999
  69. Udgivet

    Derandomizing Arthur-Merlin games using hitting sets. / Miltersen, Peter Bro ; Vinodchandran, N. V..

    I: Proceedings of the 40th annual Foundations of Computer Science. IEEE Computer Society Press, 1999. s. 71-80.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  70. Udgivet

    Fusion trees can be implemented with AC0 instructions only . / Andersson, Arne ; Miltersen, Peter Bro ; Thorup, Mikkel.

    I: Theoretical Computer Science, Vol. 215, 1999, s. 337-344.

    Publikation: Forskning - peer review › Tidsskriftartikel

  71. Udgivet

    Linear hash functions. / Alon, Noga ; Dietzfelbinger, Martin ; Miltersen, Peter Bro ; Petrank, Erez ; Tardos, Gábor.

    I: Association for Computing Machinery. Journal, Vol. 46, Nr. 5, 1999, s. 667-683.

    Publikation: Forskning - peer review › Tidsskriftartikel

  72. Udgivet

    Lower bounds for dynamic algebraic problems. / Frandsen, Gudmund Skovbjerg ; Hansen, Johan Peder ; Miltersen, Peter Bro.

    I: Lecture Notes in Computer Science, 1999, s. 362-372.

    Publikation: Forskning - peer review › Konferenceartikel

  73. Udgivet

    On monotone planar circuits. / Barrington, David A. Mix ; Lu, Chi-Jen ; Miltersen, Peter Bro ; Skyum, Sven.

    I: Fourteenth Annual IEEE Conference on Computational Complexity, 1999. Proceedings. . IEEE Computer Society Press, 1999. s. 24-31.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  74. Udgivet

    On showing lower bounds for external-memory computational geometry problems. / Arge, Lars Allan ; Miltersen, Peter Bro.

    I: D I M A C S Series in Discrete Mathematics and Theoretical Computer Science, Vol. 50, 1999, s. 139-160.

    Publikation: Forskning › Tidsskriftartikel

  75. Udgivet

    Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. / Miltersen, Peter Bro ; Vinodchandran, N. V. ; Watanabe, Osamu.

    I: Computing and Combinatorics: 5th Annual International Conference, COCOON'99 Tokyo, Japan, July 26-28, 1999 Proceedings. red. / Takano Asano ; Hideki Imai ; D. T. Lee ; Shin-ichi Nakano ; Takeshi Tokuyama. Springer Verlag. ISBN-rødder: 0-978, 1999. s. 210-220 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  76. Udgivet

    The Complexity of Identifying Large Equivalence Classes. / Skyum, Sven ; Frandsen, Gudmund Skovbjerg ; Miltersen, Peter Bro ; Binderup, Peter G..

    I: Fundamenta Informaticae, Vol. 38, Nr. 1-2, 1999, s. 25-37.

    Publikation: Forskning › Tidsskriftartikel

  77. 1998
  78. Udgivet

    Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. / Miltersen, Peter Bro.

    I: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. Association for Computing Machinery, 1998. s. 556-563.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  79. Udgivet

    On data structures and asymmetric communication complexity. / Miltersen, Peter Bro ; Nisan, Noam ; Safra, Shmuel ; Wigderson, Avi.

    I: Journal of Computer and System Sciences, Vol. 57, Nr. 1, 1998, s. 37-49.

    Publikation: Forskning - peer review › Tidsskriftartikel

  80. Udgivet

    Searching constant width mazes captures the AC0 hierarchy. / Barrington, David A. Mix ; Lu, Chi-Jen ; Miltersen, Peter Bro ; Skyum, Sven.

    I: STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 25-27, 1998 Proceedings. red. / Michel Morvan ; Christoph Meinel ; Daniel Krob. Springer Verlag. ISBN-rødder: 0-978, 1998. s. 73-83 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  81. 1997
  82. Udgivet

    Dynamic word problems. / Frandsen, Gudmund Skovbjerg ; Miltersen, Peter Bro ; Skyum, Sven.

    I: Association for Computing Machinery. Journal, Vol. 44, Nr. 2, 1997, s. 257-271.

    Publikation: Forskning - peer review › Tidsskriftartikel

  83. Udgivet

    Is linear hashing good?. / Alon, Noga ; Dietzfelbinger, Martin ; Miltersen, Peter Bro ; Petrank, Erez ; Tardos, Gábor.

    I: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. Association for Computing Machinery, 1997. s. 465-474.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  84. Udgivet

    Trans-dichotomous algorithms without multiplication - some upper and lower bounds. / Brodnik, Andrej ; Miltersen, Peter Bro ; Munro, J. Ian.

    I: Algorithms and Data Structures: 5th International Workshop, WADS'97 Halifax, Nova Scotia, Canada August 6-8, 1997 Proceedings. red. / Frank Dehne ; Andrew Rau-Chaplin ; Jörg-Rudiger Sack ; Roberto Tamassia. Springer Verlag. ISBN-rødder: 0-978, 1997. s. 426-436 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  85. 1996
  86. Udgivet

    Lower bounds for static dictionaries on RAMs with bit operations but no multiplication. / Miltersen, Peter Bro.

    I: Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8-12, 1996 Proceedings. Springer Verlag. ISBN-rødder: 0-978, 1996. s. 442-453 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  87. Udgivet

    Relative to a Random Oracle, NP is not small. / Kautz, Steven M. ; Miltersen, Peter Bro.

    I: Journal of Computer and System Sciences, 1996, s. 235-250.

    Publikation: Forskning - peer review › Tidsskriftartikel

  88. Udgivet

    Static dictionaries on AC0 RAMs: query time (√log n/log log n) is necessary and sufficient. / Andersson, Arne ; Miltersen, Peter Bro ; Riis, Søren ; Thorup, Mikkel.

    I: 37th Annual Symposium on Foundations of Computer Science, 1996. Proceedings.. IEEE Computer Society Press, 1996. s. 441-450.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  89. Udgivet

    The asymptotic complexity of merging networks. / Miltersen, Peter Bro ; Paterson, Mike ; Tarui, Jun.

    I: Association for Computing Machinery. Journal, Vol. 43, Nr. 1, 1996, s. 147-165.

    Publikation: Forskning - peer review › Tidsskriftartikel

  90. 1995
  91. Udgivet

    Dynamic algorithms for the Dyck languages. / Frandsen, Gudmund Skovbjerg ; Husfeldt, Thore ; Miltersen, Peter Bro ; Rauhe, Theis ; Skyum, Søren.

    I: Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings. red. / Selim G. Akl ; Frank Dehne ; Jörg-Rüdiger Sack ; Nicola Santoro. Springer Verlag. ISBN-rødder: 0-978, 1995. s. 98-108.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  92. Udgivet

    On data structures and asymmetric communication complexity. / Miltersen, Peter Bro ; Nisan, Noam ; Safra, Shmuel ; Wigderson, Avi.

    I: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. Association for Computing Machinery, 1995. s. 103-111.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  93. Udgivet

    On the cell probe complexity of polynomial evaluation. / Miltersen, Peter Bro.

    I: Theoretical Computer Science, Vol. 143, Nr. 1, 1995, s. 167-174.

    Publikation: Forskning - peer review › Tidsskriftartikel

  94. Udgivet

    Tables should be sorted (on random access machines). / Fich, Faith ; Miltersen, Peter Bro.

    I: Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings. red. / Selim G. Akl ; Frank Dehne ; Jörg-Rüdiger Sack ; Nicola Santoro. Springer Verlag. ISBN-rødder: 0-978, 1995. s. 482-493 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  95. 1994
  96. Udgivet

    Complexity models for incremental computation. / Miltersen, Peter Bro ; Subramanian, Sairam ; Vitter, Jeffrey Scott ; Tamassia, Roberto.

    I: Theoretical Computer Science, Vol. 130, Nr. 1, 1994, s. 203-236.

    Publikation: Forskning - peer review › Tidsskriftartikel

  97. Udgivet

    Lower bounds for union-split-find related problems on random access machines. / Miltersen, Peter Bro.

    I: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing. Association for Computing Machinery, 1994. s. 625-634.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  98. Udgivet

    Relative to a Random Oracle, NP is not small. / Kautz, Steven M. ; Miltersen, Peter Bro.

    I: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, 1994.. IEEE Computer Society Press, 1994. s. 162-174.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  99. 1993
  100. Udgivet

    Dynamic Word Problems. / Frandsen, Gudmund Skovbjerg ; Miltersen, Peter Bro ; Skyum, Sven.

    I: 34th Annual Symposium on Foundations of Computer Science, 1993. Proceedings.. IEEE Computer Society Press, 1993. s. 470-479.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  101. Udgivet

    The bit probe complexity measure revisited. / Miltersen, Peter Bro.

    I: STACS 93: 10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25-27, 1993 Proceedings. red. / P. Enjalbert ; A. Finkel ; K. W. Wagner. Springer Verlag. ISBN-rødder: 0-978, 1993. s. 662-671 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  102. Udgivet

    The complexity of finding replicas using equality tests. / Frandsen, Gudmund Skovbjerg ; Miltersen, Peter Bro ; Skyum, Sven.

    I: Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gdansk, Poland, August 30-September 3, 1993 Proceedings. red. / Andrzej M. Borzyszkowsji ; Stefan Sokolowski. Springer Verlag. ISBN-rødder: 0-978, 1993. s. 463-472 (Lecture Notes in Computer Science).

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  103. Udgivet

    The complexity of malign measures. / Miltersen, Peter Bro.

    I: S I A M Journal on Computing, Vol. 22, Nr. 1, 1993, s. 147-156.

    Publikation: Forskning - peer review › Tidsskriftartikel

  104. 1992
  105. Udgivet

    Circuit depth relative to a random oracle. / Miltersen, Peter Bro.

    I: Information Processing Letters, Vol. 42, Nr. 6, 1992, s. 295-298.

    Publikation: Forskning - peer review › Tidsskriftartikel

  106. Udgivet

    Circuit depth relative to a random oracle. / Miltersen, Peter Bro.

    I: Information Processing Letters, Vol. 42, Nr. 6, 1992, s. 295-298.

    Publikation: Forskning › Tidsskriftartikel

  107. Udgivet

    The asymptotic complexity of merging networks. / Miltersen, Peter Bro ; Paterson, Mike ; Tarui, Jun.

    I: 33rd Annual Symposium on Foundations of Computer Science, 1992. Proceedings.. IEEE Computer Society Press, 1992. s. 236-246.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings

  108. 1991
  109. Udgivet

    The complexity of malign ensembles. / Miltersen, Peter Bro.

    I: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991.. IEEE Computer Society Press, 1991. s. 164-171.

    Publikation: Forskning - peer review › Konferencebidrag i proceedings