| 2007 |
| 11 | 07471 Abstracts Collection - Equilibrium Computation. P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel. Equilibrium Computation 2007. Web SearchBibTeXDownload |
| 2001 |
| 10 | Deterministic Dictionaries. Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh. J. Algorithms (41): 69-85 (2001). Web SearchBibTeXDownload |
| 1999 |
| 9 | Linear Hash Functions. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. J. ACM (46): 667-683 (1999). Web SearchBibTeXDownload |
| 8 | Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Nord. J. Comput. (6): 135-136 (1999). Web SearchBibTeX |
| 7 | Fusion Trees can be Implemented with AC0 Instructions Only. Arne Andersson, Peter Bro Miltersen, Mikkel Thorup. Theor. Comput. Sci. (215): 337-344 (1999). Web SearchBibTeXDownload |
| 1997 |
| 6 | Is Linear Hashing Good?. Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. STOC 1997, 465-474. Web SearchBibTeXDownload |
| 5 | Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro. WADS 1997, 426-439. Web SearchBibTeXDownload |
| 1996 |
| 4 | Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. Arne Andersson, Peter Bro Miltersen, Sřren Riis, Mikkel Thorup. FOCS 1996, 441-450. Web SearchBibTeXDownload |
| 3 | The Asymptotic Complexity of Merging Networks. Peter Bro Miltersen, Mike Paterson, Jun Tarui. J. ACM (43): 147-165 (1996). Web SearchBibTeXDownload |
| 1994 |
| 2 | Complexity Models for Incremental Computation. Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia. Theor. Comput. Sci. (130): 203-236 (1994). Web SearchBibTeXDownload |
| 1992 |
| 1 | The Asymptotic Complexity of Merging Networks. Peter Bro Miltersen, Mike Paterson, Jun Tarui. FOCS 1992, 236-246. Web SearchBibTeXDownload |