- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication
- The Complexity of Malign Ensembles Peter Bro Miltersen \Lambda
- On the cell probe complexity of polynomial evaluation \Lambda Peter Bro Miltersen y
- Transdichotomous algorithms without multiplication some upper and lower bounds
- Linear Hash Functions Noga Alon Martin Dietzfelbinger y Peter Bro Miltersen z Erez Petrank x
- Complexity Models for Incremental Computation \Lambda Peter Bro Miltersen y Sairam Subramanian z
- Circuit depth relative to a random oracle \Lambda Peter Bro Miltersen
- Existence and computation of equilibria of first-price auctions with integral valuations and bids
- Are bitvectors optimal? H. Buhrman 1 P. B. Miltersen 2 J. Radhakrishnan 3 S. Venkatesh 3 ;4
- Searching constant width mazes captures the AC 0 hierarchy David A. Mix Barrington \Lambda ChiJen Lu \Lambda Peter Bro Miltersen y Sven Skyum y
- Exact Algorithms for Solving Stochastic Games (Extended Abstract)
- Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
- Computing a quasi-perfect equilibrium of a two-player game Peter Bro Miltersen
- Computing sequential equilibria for two-player games (Extended Abstract)
- Computing sequential equilibria for two-player games (extended abstract)
- Privacy-Enhancing Auctions Using Rational Cryptography
- Winning concurrent reachability games requires doubly-exponential patience Kristoffer Arnsfelt Hansen
- On Range of Skill Thomas Dueholm Hansen and Peter Bro Miltersen and Troels Bjerre Srensen
- Fast algorithms for finding proper strategies in game trees Peter Bro Miltersen
- A Near-Optimal Strategy for a Heads-Up No-Limit Texas Hold'em Poker Tournament
- Reviewing bounds on the circuit size of the hardest functions
- Lower bounds on the size of selection and rank indexes Peter Bro Miltersen
- Deterministic Dictionaries* Torben Hagerup
- Journal of Computer and System Sciences 57, 37 49 (1998) On Data Structures and Asymmetric Communication Complexity*
- Derandomizing ArthurMerlin games using hitting sets Peter Bro Miltersen N.V. Vinodchandran
- The complexity of solving reachability games using value and strategy iteration
- DYNAMIC ALGORITHMS FOR THE DYCK LANGUAGES
- Static Dictionaries on AC 0 RAMs: Query time \Theta( log n= log log n)
- Lower bounds for dynamic algebraic problems Gudmund Skovbjerg Frandsen \Lambda Johan P. Hansen y Peter Bro Miltersen \Lambda
- Implemented Instructions
- Cell probe complexity a survey Peter Bro Miltersen
- On Monotone Planar Circuits David A. Mix Barrington ChiJen Lu Peter Bro Miltersen and Sven Skyum
- Dynamic Word Problems \Lambda Gudmund Skovbjerg Frandsen Peter Bro Miltersen
- Tables should be sorted (on random access machines)
- Lower bounds for UnionSplitFind related problems on random access machines \Lambda
- Discounted stochastic games poorly approximate undiscounted ones Peter Bro Miltersen
- On the Shannon function for partially de ned Boolean functions
- Fast algorithms for finding proper strategies in game trees Peter Bro Miltersen
- New Bounds for the Language Compression Problem H. Buhrman S. Laplante y P. B. Miltersen z
- Existence and computation of equilibria of first-price auctions with integral valuations and bids
- Finding Equilibria in Games of No Chance Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, and Troels Bjerre Srensen
- The computational complexity of trembling hand perfection and other equilibrium refinements
- The Complexity of Solving Stochastic Games on Graphs
- Relative to a Random Oracle, NP Is Not Small Steven M. Kautz \Lambda
- The bit probe complexity measure revisited ? Peter Bro Miltersen
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Circuits on Cylinders Kristo#er Arnsfelt Hansen # Peter Bro Miltersen # V Vinay +
- Approximability and Parameterized Complexity of Minmax Values
- The Cell Probe Complexity of Succinct Data and Peter Bro Miltersen2
- Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
- Deterministic Graphical Games Revisited Daniel Andersson, Kristoffer Arnsfelt Hansen,
- On pseudorandom generators in NC 0# Mary Cryan and Peter Bro Miltersen
- Computing Proper Equilibria of Zero-Sum Games
- Hilbert's thirteenth problem and circuit Kristoffer Arnsfelt Hansen1
- ON THE COMPLEXITY OF NUMERICAL ANALYSIS ERIC ALLENDER, PETER BURGISSER, JOHAN KJELDGAARD-PEDERSEN, AND
- On Converting CNF to DNF Peter Bro Miltersen 1
- The Asymptotic Complexity of Merging Networks \Lambda Peter Bro Miltersen
- Some MeetintheMiddle Circuit Lower Bounds Kristo#er Arnsfelt Hansen and Peter Bro Miltersen
- Super-polynomial versus half-exponential circuit size in the exponential hierarchy
- Peter Bro Miltersen -Publication list 1. Kristoffer Arnsfelt Hansen, Michal Koucky, Niels Lauritzen, Peter Bro Miltersen, Elias Tsigaridas.
- On the Shannon function for partially defined Boolean functions
