Martin Dietzfelbinger - Google Scholar

Cited by

	All	Since 2015
Citations	2972	857
h-index	27	17
i10-index	43	24

200

100

150

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202036 26 64 57 72 62 78 86 63 63 58 60 57 56 69 80 49 101 104 120 124 100 146 181 132 168 140 119 141 160 127

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
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerified email at igi.tugraz.at
Rasmus PaghProfessor of computer science, IT University of CopenhagenVerified email at itu.dk
Anna R. KarlinMicrosoft Professor, Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityVerified email at eecs.harvard.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
Berthold VöckingProfessor of Computer Science, RWTH Aachen UniversityVerified email at cs.rwth-aachen.de
Jyrki KatajainenAcademic worker at the Institute of DalalogyVerified email at di.ku.dk
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Yossi GilThe TechnionVerified email at cs.technion.ac.il
Yossi MatiasGoogleVerified email at tau.ac.il
Fabiano Cupertino BotelhoEMCVerified email at emc.com
Jonathan RoweSchool of Computer Science, University of Birmingham Verified email at cs.bham.ac.uk
Daniel KrennAlpen-Adria-Universität Klagenfurt, AustriaVerified email at aau.at
Hannah BastProfessor of Computer Science, University of FreiburgVerified email at informatik.uni-freiburg.de
Hisao TamakiProfessor of Computer Science, Meiji UniversityVerified email at cs.meiji.ac.jp
Edelkamp, StefanProfessor of Computer Science, University of Koblenz-Landau

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	537	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	233	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	185*	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	130	1996
Balanced allocation and dictionaries with tightly packed constant size bins M Dietzfelbinger, C Weidling Theoretical Computer Science 380 (1-2), 47-68, 2007	124	2007
Polynomial hash functions are reliable M Dietzfelbinger, J Gil, Y Matias, N Pippenger International Colloquium on Automata, Languages, and Programming, 235-246, 1992	123	1992
Hash, displace, and compress D Belazzougui, FC Botelho, M Dietzfelbinger European Symposium on Algorithms, 682-693, 2009	113	2009
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	111	2010
Three disjoint path paradigms in star networks M Dietzfelbinger, S Madhavapeddy, IH Sudborough Proceedings of the third IEEE Symposium on Parallel and Distributed …, 1991	110	1991
Simple, efficient shared memory simulations M Dietzfelbinger, F Meyer auf der Heide SPAA 93, 110-119, 1993	94	1993
Primality testing in polynomial time: from randomized algorithms to" PRIMES is in P" M Dietzfelbinger Springer, 2004	89	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	76	2003
Succinct data structures for retrieval and approximate membership M Dietzfelbinger, R Pagh International Colloquium on Automata, Languages, and Programming, 385-396, 2008	73	2008
Linear hash functions N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos Journal of the ACM (JACM) 46 (5), 667-683, 1999	64*	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	63	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	54	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	48	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	42	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	41	2009
Optimal partitioning for dual-pivot quicksort M Aumüller, M Dietzfelbinger ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015	40	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

Upload PDF

Follow this author

Cited by

Co-authors