| 2017 | MFCS | Walrasian Pricing in Multi-Unit Auctions. | Simina Brnzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng |
| 2015 | IJCAI | A Dictatorship Theorem for Cake Cutting. | Simina Brnzei, Peter Bro Miltersen |
| 2015 | SAGT | Characterization and Computation of Equilibria for Indivisible Goods. | Simina Brnzei, Hadi Hosseini, Peter Bro Miltersen |
| 2014 | STACS | Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk). | Peter Bro Miltersen |
| 2014 | SAGT | The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. | Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2013 | CONCUR | A Faster Algorithm for Solving One-Clock Priced Timed Games. | Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2013 | CRYPTO | Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). | Gil Cohen, Ivan Bjerre Damgrd, Yuval Ishai, Jonas Klker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum |
| 2013 | ISAAC | Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. | Sren Kristoffer Stiil Frederiksen, Peter Bro Miltersen |
| 2012 | ESA | Solving Simple Stochastic Games with Few Coin Toss Positions. | Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2011 | CSR | The Complexity of Solving Reachability Games Using Value and Strategy Iteration. | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen |
| 2011 | STOC | Exact algorithms for solving stochastic games: extended abstract. | Kristoffer Arnsfelt Hansen, Michal Kouck, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas |
| 2010 | SAGT | The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2009 | CRYPTO | Privacy-Enhancing Auctions Using Rational Cryptography. | Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos |
| 2009 | ISAAC | The Complexity of Solving Stochastic Games on Graphs. | Daniel Andersson, Peter Bro Miltersen |
| 2009 | ISAAC | Hilbert's Thirteenth Problem and Circuit Complexity. | Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen |
| 2009 | LICS | Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. | Kristoffer Arnsfelt Hansen, Michal Kouck, Peter Bro Miltersen |
| 2008 | AAAI | On Range of Skill. | Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2008 | CiE | Deterministic Graphical Games Revisited. | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2008 | SODA | Fast algorithms for finding proper strategies in game trees. | Peter Bro Miltersen, Troels Bjerre Srensen |
| 2007 | COCOON | Finding Equilibria in Games of No Chance. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen |
| 2006 | COCOON | Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. | Jesper Torp Kristensen, Peter Bro Miltersen |
| 2006 | SODA | Computing sequential equilibria for two-player games. | Peter Bro Miltersen, Troels Bjerre Srensen |
| 2005 | CiE | The Computational Complexity of One-Dimensional Sandpiles. | Peter Bro Miltersen |
| 2005 | SODA | Lower bounds on the size of selection and rank indexes. | Peter Bro Miltersen |
| 2004 | MFCS | Some Meet-in-the-Middle Circuit Lower Bounds. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen |
| 2003 | FCT | Circuits on Cylinders. | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay |
| 2003 | ICALP | The Cell Probe Complexity of Succinct Data Structures. | Anna Gl, Peter Bro Miltersen |
| 2003 | MFCS | On Converting CNF to DNF. | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
| 2001 | MFCS | On Pseudorandom Generators in NC. | Mary Cryan, Peter Bro Miltersen |
| 2000 | ICALP | On the Shannon Function for Partially Defined Boolean Functions. | Peter Bro Miltersen |
| 2000 | STOC | Are bitvectors optimal? | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
| 1999 | COCOON | Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. | Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe |
| 1999 | FOCS | Derandomizing Arthur-Merlin Games Using Hitting Sets. | Peter Bro Miltersen, N. V. Vinodchandran |
| 1999 | STACS | Lower Bounds for Dynamic Algebraic Problems. | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen |
| 1998 | SODA | Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries. | Peter Bro Miltersen |
| 1998 | STACS | Searching Constant Width Mazes Captures the AC | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum |
| 1997 | STOC | Is Linear Hashing Good? | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gbor Tardos |
| 1997 | WADS | Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. | Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro |
| 1996 | FOCS | Static Dictionaries on AC | Arne Andersson, Peter Bro Miltersen, Sren Riis, Mikkel Thorup |
| 1996 | ICALP | Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication. | Peter Bro Miltersen |
| 1995 | STOC | On data structures and asymmetric communication complexity. | Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson |
| 1995 | WADS | Tables Should Be Sorted (On Random Access Machines). | Faith E. Fich, Peter Bro Miltersen |
| 1995 | WADS | Dynamic Algorithms for the Dyck Languages. | Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Sren Skyum |
| 1994 | STOC | Lower bounds for union-split-find related problems on random access machines. | Peter Bro Miltersen |
| 1993 | FOCS | Dynamic Word Problems | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum |
| 1993 | MFCS | The Complexity of Finding Replicas Using Equality Tests. | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum |
| 1993 | STACS | The Bit Probe Complexity Measure Revisited. | Peter Bro Miltersen |
| 1992 | FOCS | The Asymptotic Complexity of Merging Networks | Peter Bro Miltersen, Mike Paterson, Jun Tarui |