Searching for authors named Peter Bro Miltersen – sorted by Relevance.
-
Universal Hashing
- Universal Hashing by Peter Bro Miltersen This lecture note was written for the course "Pearls
- Add To MetaCart
-
Trembling hand perfection is NP-hard (note)
- Trembling hand perfection is NP-hard (note) Peter Bro Miltersen 8th October 2008 Abstract It is NP
- Add To MetaCart
-
On the Shannon function for partially defined Boolean functions
- On the Shannon function for partially dened Boolean functions Peter Bro Miltersen June 3, 1999
- Add To MetaCart
-
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
- Peter Bro Miltersen BRICS Report Series RS-97-17 ISSN 0909-0878 June 1997 Copyright c fl 1997, BRICS
- Cited by 16 (2 self) – Add To MetaCart
-
Two Notes on the Computational Complexity of One-Dimensional Sandpiles
- Two notes on the computational complexity of one-dimensional sandpiles Peter Bro Miltersen June
- Cited by 1 (0 self) – Add To MetaCart
-
The Complexity of Malign Ensembles
- The Complexity of Malign Ensembles Peter Bro Miltersen Computer Science Department, Aaarhus
- Cited by 7 (0 self) – Add To MetaCart
-
On the Cell Probe Complexity of Polynomial Evaluation
- On the cell probe complexity of polynomial evaluation (note) Peter Bro Miltersen y Aarhus
- Cited by 11 (4 self) – Add To MetaCart
-
The Bit Probe Complexity Measure Revisited
- The bit probe complexity measure revisited ? Peter Bro Miltersen Aarhus University, Computer
- Cited by 14 (3 self) – Add To MetaCart
-
Lower bounds for Union-Split-Find related problems on random access machines
- Lower bounds for Union-Split-Find related problems on random access machines Peter Bro Miltersen
- Cited by 31 (4 self) – Add To MetaCart
-
Lower bounds for static dictionaries on RAMs with bit operations but no multiplication
- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication Peter Bro
- Cited by 10 (4 self) – Add To MetaCart

