Martin Dietzfelbinger

Cited by

	All	Since 2018
Citations	3620	994
h-index	29	17
i10-index	50	25

220

110

165

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202332 30 66 63 77 67 81 89 61 61 64 71 56 60 82 83 57 99 102 123 130 105 145 173 132 170 151 126 155 152 155 149 178 205

Public access

View all

11 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Friedhelm Meyer auf der HeideProfessor of Computer Science, University of PaderbornVerified email at upb.de
Philipp WoelfelUniversity of CalgaryVerified email at ucalgary.ca
Martin AumüllerIT University of CopenhagenVerified email at itu.dk
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Rasmus PaghProfessor of computer science, University of CopenhagenVerified email at di.ku.dk
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerified email at igi.tugraz.at
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityVerified email at eecs.harvard.edu
Anna R. KarlinBill & Melinda Gates Chair and Professor of Computer Science and Engineering, University ofVerified email at cs.washington.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityVerified email at cs.au.dk
Erez PetrankProfessor of Computer Science, Technion - Israel Institute of TechnologyVerified email at cs.technion.ac.il
Jyrki KatajainenAcademic worker at the Institute of DalalogyVerified email at di.ku.dk
Stefan WalzerUniversität zu KölnVerified email at cs.uni-koeln.de
Jonathan RoweSchool of Computer Science, University of Birmingham Verified email at cs.bham.ac.uk
Fabiano Cupertino BotelhoRubrik Inc.Verified email at emc.com
djamal belazzouguiCERISTVerified email at cerist.dz
Yossi GilThe TechnionVerified email at cs.technion.ac.il
Yossi MatiasGoogleVerified email at tau.ac.il
Nicholas PippengerEmeritus Professor of Mathematics, Harvey Mudd CollegeVerified email at math.hmc.edu

Martin Dietzfelbinger

Professor of Computer Science, Technische Universität Ilmenau

Verified email at tu-ilmenau.de - Homepage

Theoretical Computer Science Algorithms Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	617	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	288	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	182	1990
Balanced allocation and dictionaries with tightly packed constant size bins M Dietzfelbinger, C Weidling Theoretical Computer Science 380 (1-2), 47-68, 2007	165	2007
Hash, displace, and compress D Belazzougui, FC Botelho, M Dietzfelbinger European Symposium on Algorithms, 682-693, 2009	160	2009
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	158	2010
Polynomial hash functions are reliable M Dietzfelbinger, J Gil, Y Matias, N Pippenger Automata, Languages and Programming: 19th International Colloquium Wien …, 1992	151	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	148	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	123	1991
Primality Testing in Polynomial Time: From Randomized Algorithms to" primes" is in P M Dietzfelbinger Springer, 2004	100	2004
Simple, efficient shared memory simulations M Dietzfelbinger, F Meyer auf der Heide SPAA 93, 110-119, 1993	99	1993
Succinct data structures for retrieval and approximate membership M Dietzfelbinger, R Pagh International Colloquium on Automata, Languages, and Programming, 385-396, 2008	92	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	91	2003
Linear hash functions N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos Journal of the ACM (JACM) 46 (5), 667-683, 1999	76*	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	67	1994
Sequential and Parallel Algorithms and Data Structures P Sanders, K Mehlhorn, M Dietzfelbinger, R Dementiev Springer, 2019	58	2019
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	57	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	52	1996
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	48	1990
Optimal partitioning for dual-pivot quicksort M Aumüller, M Dietzfelbinger ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015	45	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors