Martin Dietzfelbinger
Martin Dietzfelbinger
Professor of Computer Science, Technische Universität Ilmenau
Verified email at - Homepage
Cited by
Cited by
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
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
A new universal class of hash functions and dynamic hashing in real time
M Dietzfelbinger, FM auf der Heide
International Colloquium on Automata, Languages, and Programming, 6-19, 1990
Universal hashing and k-wise independent random variables via integer arithmetic without primes
M Dietzfelbinger
Annual Symposium on Theoretical Aspects of Computer Science, 567-580, 1996
Balanced allocation and dictionaries with tightly packed constant size bins
M Dietzfelbinger, C Weidling
Theoretical Computer Science 380 (1-2), 47-68, 2007
Polynomial hash functions are reliable
M Dietzfelbinger, J Gil, Y Matias, N Pippenger
International Colloquium on Automata, Languages, and Programming, 235-246, 1992
Hash, displace, and compress
D Belazzougui, FC Botelho, M Dietzfelbinger
European Symposium on Algorithms, 682-693, 2009
Three disjoint path paradigms in star networks
M Dietzfelbinger, S Madhavapeddy, IH Sudborough
Proceedings of the third IEEE Symposium on Parallel and Distributed …, 1991
Tight thresholds for cuckoo hashing via XORSAT
M Dietzfelbinger, A Goerdt, M Mitzenmacher, A Montanari, R Pagh, ...
International Colloquium on Automata, Languages, and Programming, 213-225, 2010
Simple, efficient shared memory simulations
M Dietzfelbinger, F Meyer auf der Heide
SPAA 93, 110-119, 1993
Primality testing in polynomial time: from randomized algorithms to" PRIMES is in P"
M Dietzfelbinger
Springer, 2004
Almost random graphs with simple hash functions
M Dietzfelbinger, P Woelfel
Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing …, 2003
Succinct data structures for retrieval and approximate membership
M Dietzfelbinger, R Pagh
International Colloquium on Automata, Languages, and Programming, 385-396, 2008
Linear hash functions
N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos
Journal of the ACM (JACM) 46 (5), 667-683, 1999
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
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
A comparison of two lower-bound methods for communication complexity
M Dietzfelbinger, J Hromkovič, G Schnitger
Theoretical Computer Science 168 (1), 39-51, 1996
Optimal partitioning for dual-pivot quicksort
M Aumüller, M Dietzfelbinger
ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015
How to distribute a dictionary in a complete network
M Dietzfelbinger, F Meyer auf der Heide
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
On risks of using cuckoo hashing with simple universal hash classes
M Dietzfelbinger, U Schellbach
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
The system can't perform the operation now. Try again later.
Articles 1–20