Martin Dietzfelbinger

Cited by

	All	Since 2019
Citations	3812	1001
h-index	29	16
i10-index	52	25

240

120

180

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202434 30 62 59 77 69 82 86 61 63 65 74 58 58 81 83 59 97 102 125 127 104 147 176 132 186 153 123 163 154 165 148 170 226 138

Public access

View all

10 articles

5 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
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityVerified email at eecs.harvard.edu
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerified email at igi.tugraz.at
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 PetrankViterbi Professor of Computer Science, Technion - Israel Institute of TechnologyVerified email at cs.technion.ac.il
Stefan WalzerKarlsruhe Institute of TechnologyVerified email at kit.edu
Jyrki KatajainenAcademic worker at the Institute of DalalogyVerified email at di.ku.dk
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
Dr. rer. nat. Ulf Christian SchellbachGoetheschule IlmenauVerified email at schule.thueringen.de

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	627	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	298	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	192	1990
Hash, displace, and compress D Belazzougui, FC Botelho, M Dietzfelbinger European Symposium on Algorithms, 682-693, 2009	178	2009
Balanced allocation and dictionaries with tightly packed constant size bins M Dietzfelbinger, C Weidling Theoretical Computer Science 380 (1-2), 47-68, 2007	178	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	169	2010
Polynomial hash functions are reliable M Dietzfelbinger, J Gil, Y Matias, N Pippenger Automata, Languages and Programming: 19th International Colloquium Wien …, 1992	157	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	156	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	103	2004
Succinct data structures for retrieval and approximate membership M Dietzfelbinger, R Pagh International Colloquium on Automata, Languages, and Programming, 385-396, 2008	102	2008
Simple, efficient shared memory simulations M Dietzfelbinger, F Meyer auf der Heide SPAA 93, 110-119, 1993	102	1993
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	74	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

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