Martin Dietzfelbinger - Citas de Google Académico

Citado por

	Total	Desde 2015
Citas	2882	755
Índice h	25	16
Índice i10	42	21

200

100

150

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202034 28 64 59 73 60 76 84 61 62 60 58 56 58 74 80 54 101 109 122 118 101 146 190 132 167 137 119 139 180 12

Coautores

Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusDirección de correo verificada de mpi-inf.mpg.de
Friedhelm Meyer auf der HeideProfessor of Computer Science, University of PaderbornDirección de correo verificada de upb.de
Philipp WoelfelUniversity of CalgaryDirección de correo verificada de ucalgary.ca
Rasmus PaghProfessor of computer science, IT University of CopenhagenDirección de correo verificada de itu.dk
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyDirección de correo verificada de igi.tugraz.at
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityDirección de correo verificada de eecs.harvard.edu
Anna R. KarlinMicrosoft Professor, Computer Science and Engineering, University of WashingtonDirección de correo verificada de cs.washington.edu
Noga AlonPrinceton University and Tel Aviv UniversityDirección de correo verificada de tau.ac.il
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityDirección de correo verificada de cs.au.dk
Jyrki KatajainenAcademic worker at the Institute of DalalogyDirección de correo verificada de di.ku.dk
Berthold VöckingProfessor of Computer Science, RWTH Aachen UniversityDirección de correo verificada de cs.rwth-aachen.de
Yossi GilThe TechnionDirección de correo verificada de cs.technion.ac.il
Yossi MatiasGoogleDirección de correo verificada de tau.ac.il
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverDirección de correo verificada de thi.uni-hannover.de
Fabiano Cupertino BotelhoEMCDirección de correo verificada de emc.com
Jonathan RoweSchool of Computer Science, University of Birmingham Dirección de correo verificada de cs.bham.ac.uk
Daniel KrennAlpen-Adria-Universität Klagenfurt, AustriaDirección de correo verificada de aau.at
Hannah BastProfessor of Computer Science, University of FreiburgDirección de correo verificada de informatik.uni-freiburg.de
Edelkamp, StefanProfessor of Computer Science, King's College LondonDirección de correo verificada de kcl.ac.uk
Hisao TamakiProfessor of Computer Science, Meiji UniversityDirección de correo verificada de cs.meiji.ac.jp

Martin Dietzfelbinger

Professor of Computer Science, Technische Universität Ilmenau

Dirección de correo verificada de tu-ilmenau.de - Página principal

Theoretical Computer Science Algorithms Complexity Theory


Título	Citado por	Año
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	523	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	227	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	181*	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	129	1996
Polynomial hash functions are reliable M Dietzfelbinger, J Gil, Y Matias, N Pippenger International Colloquium on Automata, Languages, and Programming, 235-246, 1992	125	1992
Balanced allocation and dictionaries with tightly packed constant size bins M Dietzfelbinger, C Weidling Theoretical Computer Science 380 (1-2), 47-68, 2007	118	2007
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
Hash, displace, and compress D Belazzougui, FC Botelho, M Dietzfelbinger European Symposium on Algorithms, 682-693, 2009	108	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	107	2010
Simple, efficient shared memory simulations M Dietzfelbinger, F Meyer auf der Heide SPAA 93, 110-119, 1993	92	1993
Primality testing in polynomial time: from randomized algorithms to" PRIMES is in P" M Dietzfelbinger Springer, 2004	86	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	70	2008
Linear hash functions N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos Journal of the ACM (JACM) 46 (5), 667-683, 1999	65*	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	60	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	55	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	47	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	35	2015

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Subir PDF

Seguir a este autor

Citado por

Coautores