The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Bro Miltersen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia
    Complexity Models for Incremental Computation. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:203-236 [Journal]
  2. Peter Bro Miltersen
    The Computational Complexity of One-Dimensional Sandpiles. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:342-348 [Conf]
  3. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    On Monotone Planar Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:24-0 [Conf]
  4. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
    On the Complexity of Numerical Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:331-339 [Conf]
  5. Harry Buhrman, Sophie Laplante, Peter Bro Miltersen
    New Bounds for the Language Compression Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:126-130 [Conf]
  6. Steven M. Kautz, Peter Bro Miltersen
    Relative to a Random Oracle, NP is Not Small. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:162-174 [Conf]
  7. Peter Bro Miltersen
    The Complexity of Malign Ensembles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:164-171 [Conf]
  8. Jesper Torp Kristensen, Peter Bro Miltersen
    Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:489-496 [Conf]
  9. Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe
    Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:210-220 [Conf]
  10. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on Cylinders. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:171-182 [Conf]
  11. Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
    Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:441-450 [Conf]
  12. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
    Dynamic Word Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:470-479 [Conf]
  13. Peter Bro Miltersen, Mike Paterson, Jun Tarui
    The Asymptotic Complexity of Merging Networks [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:236-246 [Conf]
  14. Peter Bro Miltersen, N. V. Vinodchandran
    Derandomizing Arthur-Merlin Games Using Hitting Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:71-80 [Conf]
  15. Anna Gál, Peter Bro Miltersen
    The Cell Probe Complexity of Succinct Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:332-344 [Conf]
  16. Peter Bro Miltersen
    On the Shannon Function for Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:253-258 [Conf]
  17. Peter Bro Miltersen
    Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:442-453 [Conf]
  18. Mary Cryan, Peter Bro Miltersen
    On Pseudorandom Generators in NC. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:272-284 [Conf]
  19. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
    The Complexity of Finding Replicas Using Equality Tests. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:463-472 [Conf]
  20. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
    Some Meet-in-the-Middle Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:334-345 [Conf]
  21. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:612-621 [Conf]
  22. Peter Bro Miltersen
    Lower bounds on the size of selection and rank indexes. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:11-12 [Conf]
  23. Peter Bro Miltersen
    Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:556-563 [Conf]
  24. Peter Bro Miltersen, Troels Bjerre Sørensen
    Computing sequential equilibria for two-player games. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:107-116 [Conf]
  25. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Searching Constant Width Mazes Captures the AC0 Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:73-83 [Conf]
  26. Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
    Lower Bounds for Dynamic Algebraic Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:362-372 [Conf]
  27. Peter Bro Miltersen
    The Bit Probe Complexity Measure Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:662-671 [Conf]
  28. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
    Is Linear Hashing Good? [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:465-474 [Conf]
  29. Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    Are bitvectors optimal? [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:449-458 [Conf]
  30. Peter Bro Miltersen
    Lower bounds for union-split-find related problems on random access machines. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:625-634 [Conf]
  31. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
    On data structures and asymmetric communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:103-111 [Conf]
  32. Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
    Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:426-439 [Conf]
  33. Faith E. Fich, Peter Bro Miltersen
    Tables Should Be Sorted (On Random Access Machines). [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:482-493 [Conf]
  34. Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
    Dynamic Algorithms for the Dyck Languages. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:98-108 [Conf]
  35. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on cylinders. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:1, pp:62-81 [Journal]
  36. Peter Bro Miltersen, N. V. Vinodchandran
    Derandomizing Arthur-Merlin Games using Hitting Sets. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:256-279 [Journal]
  37. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
    Circuits on Cylinders [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:066, pp:- [Journal]
  38. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:017, pp:- [Journal]
  39. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
    Reviewing Bounds on the Circuit Size of the Hardest Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:032, pp:- [Journal]
  40. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
    On the Complexity of Numerical Analysis [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:037, pp:- [Journal]
  41. Jesper Torp Kristensen, Peter Bro Miltersen
    Finding small OBDDs for incompletely specified truth tables is hard [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:004, pp:- [Journal]
  42. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Searching constant width mazes captures the AC0 hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:44, pp:- [Journal]
  43. Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup
    The Complexity of Identifying Large Equivalence Classes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:25-37 [Journal]
  44. Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
    Lower Bounds for Dynamic Algebraic Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:2, pp:333-349 [Journal]
  45. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
    Reviewing bounds on the circuit size of the hardest functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:354-357 [Journal]
  46. Peter Bro Miltersen
    Circuit Depth Relative to a Random Oracle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:295-298 [Journal]
  47. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos
    Linear Hash Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:5, pp:667-683 [Journal]
  48. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
    Dynamic word problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:2, pp:257-271 [Journal]
  49. Peter Bro Miltersen, Mike Paterson, Jun Tarui
    The Asymptotic Complexity of Merging Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:1, pp:147-165 [Journal]
  50. Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh
    Deterministic Dictionaries. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:69-85 [Journal]
  51. Steven M. Kautz, Peter Bro Miltersen
    Relative to a Random Oracle, NP Is Not Small. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:235-250 [Journal]
  52. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
    On Data Structures and Asymmetric Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:1, pp:37-49 [Journal]
  53. Jens Lagergren, Peter Bro Miltersen
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:2, pp:135-136 [Journal]
  54. Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
    Are Bitvectors Optimal? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1723-1744 [Journal]
  55. Peter Bro Miltersen
    The Complexity of Malign Measures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:147-156 [Journal]
  56. Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
    Fusion Trees can be Implemented with AC0 Instructions Only. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:337-344 [Journal]
  57. Peter Bro Miltersen
    On the Cell Probe Complexity of Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:167-174 [Journal]
  58. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:325-335 [Journal]
  59. Peter Bro Miltersen, Troels Bjerre Sørensen
    Computing Proper Equilibria of Zero-Sum Games. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2006, pp:200-211 [Conf]
  60. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
    Finding Equilibria in Games of No Chance. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:274-284 [Conf]
  61. Peter Bro Miltersen
    The Computational Complexity of One-Dimensional Sandpiles. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:1, pp:119-125 [Journal]
  62. Anna Gál, Peter Bro Miltersen
    The cell probe complexity of succinct data structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:405-417 [Journal]

  63. On Range of Skill. [Citation Graph (, )][DBLP]


  64. A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament. [Citation Graph (, )][DBLP]


  65. Existence and computation of equilibria of first-price auctions with integral valuations and bids. [Citation Graph (, )][DBLP]


  66. Deterministic Graphical Games Revisited. [Citation Graph (, )][DBLP]


  67. Privacy-Enhancing Auctions Using Rational Cryptography. [Citation Graph (, )][DBLP]


  68. On the Complexity of Numerical Analysis. [Citation Graph (, )][DBLP]


  69. The Cell Probe Complexity of Succinct Data Structures. [Citation Graph (, )][DBLP]


  70. 07471 Abstracts Collection - Equilibrium Computation. [Citation Graph (, )][DBLP]


  71. The Complexity of Solving Stochastic Games on Graphs. [Citation Graph (, )][DBLP]


  72. Hilbert's Thirteenth Problem and Circuit Complexity. [Citation Graph (, )][DBLP]


  73. Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. [Citation Graph (, )][DBLP]


  74. Fast algorithms for finding proper strategies in game trees. [Citation Graph (, )][DBLP]


  75. Approximability and Parameterized Complexity of Minmax Values. [Citation Graph (, )][DBLP]


  76. Special Issue: "Conference on Computational Complexity 2007" Guest Editor's Foreword. [Citation Graph (, )][DBLP]


  77. Simple Recursive Games [Citation Graph (, )][DBLP]


  78. Approximability and parameterized complexity of minmax values [Citation Graph (, )][DBLP]


  79. On the computational complexity of solving stochastic mean-payoff games [Citation Graph (, )][DBLP]


  80. Trembling hand perfection is NP-hard [Citation Graph (, )][DBLP]


  81. The complexity of solving reachability games using value and strategy iteration [Citation Graph (, )][DBLP]


  82. Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor [Citation Graph (, )][DBLP]


Search in 0.099secs, Finished in 0.102secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002