| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Martin Dietzfelbinger, Hendrik Peilke, Michael Rink |
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel |
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Michael Rink |
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
On Randomness in Hash Functions (Invited Talk). |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
Precision, Local Search and Unimodal Functions. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink |
Cuckoo Hashing with Pages |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (eds.) |
Algorithms Unplugged |
|
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Fingerprinting. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink |
Cuckoo Hashing with Pages. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Ingo Wegener: seine Bücher. |
Informatik Spektrum |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
Tight Bounds for Blind Search on the Integers and the Reals. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
Tight Thresholds for Cuckoo Hashing via XORSAT. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink |
Tight Thresholds for Cuckoo Hashing via XORSAT |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger |
Hash, Displace, and Compress. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Aumüller, Martin Dietzfelbinger, Michael Rink |
Experimental Variations of a Theoretically Good Retrieval Data Structure. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Ulf Schellbach |
On risks of using cuckoo hashing with simple universal hash classes. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Michael Rink |
Applications of a Splitting Trick. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Philipp Woelfel |
Brief announcement: tight lower bounds for greedy routing in uniform small world rings. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
peer-to-peer, lower bound, random graphs, small worlds, greedy routing |
| 1 | Martin Dietzfelbinger, Ulf Schellbach |
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
universal hash classes, data structures, lower bounds, randomized algorithms, cuckoo hashing |
| 1 | Martin Dietzfelbinger, Stefan Edelkamp |
Perfect Hashing for State Spaces in BDD Representation. |
KI |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Philipp Woelfel |
Tight lower bounds for greedy routing in uniform small world rings. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
peer-to-peer, lower bound, random graphs, small worlds, greedy routing, small world graphs |
| 1 | Martin Dietzfelbinger |
Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, Algorithms, McGraw Hill, Boston (2007) ISBN 978-007352340-8, Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson/Addison Wesley, Boston (2006) ISBN 978-032129535-4. |
Computer Science Review |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Rasmus Pagh |
Succinct Data Structures for Retrieval and Approximate Membership |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
Tight Bounds for Blind Search on the Integers |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Martin Hühne, Christoph Weidling |
A dictionary implementation based on dynamic perfect hashing. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
dynamic hashing, Data structures, implementation, hash functions, dictionaries |
| 1 | Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (eds.) |
Taschenbuch der Algorithmen |
|
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Fingerprinting. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
Precision, local search and unimodal functions. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
unimodal functions, computational complexity, local search, precision |
| 1 | Martin Dietzfelbinger, Rasmus Pagh |
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
Tight Bounds for Blind Search on the Integers. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Henning Wunderlich |
A characterization of average case communication complexity. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Christoph Weidling |
Balanced allocation and dictionaries with tightly packed constant size bins. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (eds.) |
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007 |
Probabilistic Methods in the Design and Analysis of Algorithms |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking |
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. |
Probabilistic Methods in the Design and Analysis of Algorithms |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Design Strategies for Minimal Perfect Hash Functions. |
SAGA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Hisao Tamaki |
On the probability of rendezvous in graphs. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Christoph Weidling |
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Gossiping and broadcasting versus computing functions in networks. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P" |
|
2004 |
DOI RDF |
|
| 1 | Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener |
The analysis of a recombinative hill-climber on H-IFF. |
IEEE Trans. Evolutionary Computation |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Manfred Kunde |
A case against using Stirling's formula (unless you really need it). |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Philipp Woelfel |
Almost random graphs with simple hash functions. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
uniform hashing, hash function, random graphs, cuckoo hashing |
| 1 | Martin Dietzfelbinger |
The Probability of a Rendezvous is Minimal in Complete Graphs. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Anna Gambin, Slawomir Lasota |
On Different Models for Packet Flow in Multistage Interconnection Networks. |
Fundam. Inform. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Torben Hagerup |
Simple Minimal Perfect Hashing in Less Space. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
minimal perfect hash functions, space requirements, Data structures, randomized algorithms, hashing, dictionaries, hash tables |
| 1 | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos |
Linear Hash Functions. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
hashing via linear maps, universal hashing |
| 1 | Martin Dietzfelbinger, Martin Hühne |
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen |
A Reliable Randomized Algorithm for the Closest-Pair Problem. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Gossiping and Broadcasting versus Computing Functions in Networks. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
The Linear-Array Problem in Communication Complexity Resolved. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos |
Is Linear Hashing Good? |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
The Linear-Array Problem in Communication Complexity Resolved |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Gossiping and Broadcasting versus Computing Functions in Networks |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
A Comparison of Two Lower-Bound Methods for Communication Complexity. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
Dynamic Perfect Hashing: Upper and Lower Bounds. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
A Comparison of Two Lower Bound Methods for Communication Complexity. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Martin Hühne |
Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. |
FSTTCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Wolfgang Maass |
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
An Optimal Parallel Dictionary |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Simulations Between Different Models of Parallel Computers. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
Simple, Efficient Shared Memory Simulations. |
SPAA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger |
Polynomial Hash Functions Are Reliable (Extended Abstract). |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Bast, Martin Dietzfelbinger, Torben Hagerup |
A Perfect Parallel Dictionary. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
High Performance Universal Hashing, with Applications to Shared Memory Simulations. |
Data Structures and Efficient Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger |
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough |
Three disjoint path paradigms in star networks. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk |
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
How to Distribute a Dictionary in a Complete Network |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
The Speed of Copying on One-Tape Off-Line Turing Machines. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Lower Bounds for Sorting of Sums. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Friedhelm Meyer auf der Heide |
An Optimal Parallel Dictionary. |
SPAA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Wolfgang Maass |
Lower Bound Arguments with "Inaccessible" Numbers. |
J. Comput. Syst. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Wolfgang Maass |
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert |
Upper and Lower Bounds for the Dictionary Problem (Abstract). |
SWAT |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
Dynamic Perfect Hashing: Upper and Lower Bounds |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
dynamic perfect hashing, amortized expected time, amortized worst-case time complexity, lower bounds, randomized algorithm, upper bounds, deterministic algorithm, insertion, deletion, lookup, worst-case time, dictionary problem |
| 1 | Martin Dietzfelbinger |
Lower Bounds for Sorting of Sums. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Wolfgang Maass |
two Lower Bound Arguments with "Inaccessible" Numbers. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")