Dynamic perfect hashing: Upper and lower bounds M Dietzfelbinger, A Karlin, K Mehlhorn, F Meyer Auf Der Heide, H Rohnert, ... SIAM Journal on Computing 23 (4), 738-761, 1994 | 625 | 1994 |
A reliable randomized algorithm for the closest-pair problem M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen Journal of Algorithms 25 (1), 19-51, 1997 | 296 | 1997 |
A new universal class of hash functions and dynamic hashing in real time M Dietzfelbinger, F Meyer auf der Heide Automata, Languages and Programming: 17th International Colloquium Warwick …, 1990 | 190 | 1990 |
Hash, displace, and compress D Belazzougui, FC Botelho, M Dietzfelbinger European Symposium on Algorithms, 682-693, 2009 | 177 | 2009 |
Balanced allocation and dictionaries with tightly packed constant size bins M Dietzfelbinger, C Weidling Theoretical Computer Science 380 (1-2), 47-68, 2007 | 174 | 2007 |
Tight thresholds for cuckoo hashing via XORSAT M Dietzfelbinger, A Goerdt, M Mitzenmacher, A Montanari, R Pagh, ... Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 168 | 2010 |
Polynomial hash functions are reliable M Dietzfelbinger, J Gil, Y Matias, N Pippenger Automata, Languages and Programming: 19th International Colloquium Wien …, 1992 | 156 | 1992 |
Universal hashing and k-wise independent random variables via integer arithmetic without primes M Dietzfelbinger STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science …, 1996 | 155 | 1996 |
Three disjoint path paradigms in star networks M Dietzfelbinger, S Madhavapeddy, IH Sudborough Proceedings of the third IEEE Symposium on Parallel and Distributed …, 1991 | 126 | 1991 |
Primality Testing in Polynomial Time: From Randomized Algorithms to" primes" is in P M Dietzfelbinger Springer, 2004 | 102 | 2004 |
Simple, efficient shared memory simulations M Dietzfelbinger, F Meyer auf der Heide SPAA 93, 110-119, 1993 | 102 | 1993 |
Succinct data structures for retrieval and approximate membership M Dietzfelbinger, R Pagh International Colloquium on Automata, Languages, and Programming, 385-396, 2008 | 100 | 2008 |
Almost random graphs with simple hash functions M Dietzfelbinger, P Woelfel Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing …, 2003 | 99 | 2003 |
Linear hash functions N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos Journal of the ACM (JACM) 46 (5), 667-683, 1999 | 81* | 1999 |
Sequential and Parallel Algorithms and Data Structures P Sanders, K Mehlhorn, M Dietzfelbinger, R Dementiev Springer, 2019 | 69 | 2019 |
Exact lower time bounds for computing Boolean functions on CREW PRAMs M Dietzfelbinger, M Kutyłowski, R Reischuk Journal of Computer and System Sciences 48 (2), 231-254, 1994 | 66 | 1994 |
The analysis of a recombinative hill-climber on H-IFF M Dietzfelbinger, B Naudts, C Van Hoyweghen, I Wegener IEEE Transactions on Evolutionary Computation 7 (5), 417-423, 2003 | 58 | 2003 |
A comparison of two lower-bound methods for communication complexity M Dietzfelbinger, J Hromkovič, G Schnitger Theoretical Computer Science 168 (1), 39-51, 1996 | 54 | 1996 |
Explicit and efficient hash families suffice for cuckoo hashing with a stash M Aumüller, M Dietzfelbinger, P Woelfel Algorithmica 70 (3), 428-456, 2014 | 52 | 2014 |
Optimal partitioning for dual-pivot quicksort M Aumüller, M Dietzfelbinger ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015 | 48 | 2015 |