| 2009 |
|---|
| 62 | EE | Martin Dietzfelbinger,
Ulf Schellbach:
On risks of using cuckoo hashing with simple universal hash classes.
SODA 2009: 795-804 |
| 61 | EE | Martin Dietzfelbinger,
Ulf Schellbach:
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes.
SOFSEM 2009: 217-228 |
| 2008 |
|---|
| 60 | | Berthold Vöcking,
Helmut Alt,
Martin Dietzfelbinger,
Rüdiger Reischuk,
Christian Scheideler,
Heribert Vollmer,
Dorothea Wagner:
Taschenbuch der Algorithmen
Springer 2008 |
| 59 | EE | Martin Dietzfelbinger,
Jonathan E. Rowe,
Ingo Wegener,
Philipp Woelfel:
Precision, local search and unimodal functions.
GECCO 2008: 771-778 |
| 58 | EE | Martin Dietzfelbinger,
Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract).
ICALP (1) 2008: 385-396 |
| 57 | EE | Martin Dietzfelbinger,
Jonathan E. Rowe,
Ingo Wegener,
Philipp Woelfel:
Tight Bounds for Blind Search on the Integers.
STACS 2008: 241-252 |
| 56 | EE | Martin Dietzfelbinger:
Fingerprinting.
Taschenbuch der Algorithmen 2008: 193-204 |
| 55 | EE | Martin Dietzfelbinger,
Martin Hühne,
Christoph Weidling:
A dictionary implementation based on dynamic perfect hashing.
ACM Journal of Experimental Algorithmics 12: (2008) |
| 54 | EE | Martin Dietzfelbinger,
Jonathan E. Rowe,
Ingo Wegener,
Philipp Woelfel:
Tight Bounds for Blind Search on the Integers
CoRR abs/0802.2852: (2008) |
| 53 | EE | Martin Dietzfelbinger,
Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership
CoRR abs/0803.3693: (2008) |
| 52 | EE | 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 2(2): 131-136 (2008) |
| 2007 |
|---|
| 51 | | Martin Dietzfelbinger,
Shang-Hua Teng,
Eli Upfal,
Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 50 | EE | 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 |
| 49 | EE | Martin Dietzfelbinger:
Design Strategies for Minimal Perfect Hash Functions.
SAGA 2007: 2-17 |
| 48 | EE | Martin Dietzfelbinger,
Henning Wunderlich:
A characterization of average case communication complexity.
Inf. Process. Lett. 101(6): 245-249 (2007) |
| 47 | EE | Martin Dietzfelbinger,
Christoph Weidling:
Balanced allocation and dictionaries with tightly packed constant size bins.
Theor. Comput. Sci. 380(1-2): 47-68 (2007) |
| 2005 |
|---|
| 46 | EE | Martin Dietzfelbinger,
Christoph Weidling:
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins.
ICALP 2005: 166-178 |
| 45 | EE | Martin Dietzfelbinger,
Hisao Tamaki:
On the probability of rendezvous in graphs.
Random Struct. Algorithms 26(3): 266-288 (2005) |
| 2004 |
|---|
| 44 | | Martin Dietzfelbinger:
Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"
Springer 2004 |
| 43 | EE | Martin Dietzfelbinger:
Gossiping and broadcasting versus computing functions in networks.
Discrete Applied Mathematics 137(2): 127-153 (2004) |
| 2003 |
|---|
| 42 | EE | Martin Dietzfelbinger,
Philipp Woelfel:
Almost random graphs with simple hash functions.
STOC 2003: 629-638 |
| 41 | | Martin Dietzfelbinger,
Manfred Kunde:
A case against using Stirling's formula (unless you really need it).
Bulletin of the EATCS 80: 153-158 (2003) |
| 40 | | Martin Dietzfelbinger,
Bart Naudts,
Clarissa Van Hoyweghen,
Ingo Wegener:
The analysis of a recombinative hill-climber on H-IFF.
IEEE Trans. Evolutionary Computation 7(5): 417-423 (2003) |
| 2002 |
|---|
| 39 | EE | Martin Dietzfelbinger:
The Probability of a Rendezvous is Minimal in Complete Graphs.
ISAAC 2002: 55-66 |
| 2001 |
|---|
| 38 | EE | Martin Dietzfelbinger,
Torben Hagerup:
Simple Minimal Perfect Hashing in Less Space.
ESA 2001: 109-120 |
| 37 | | Martin Dietzfelbinger,
Anna Gambin,
Slawomir Lasota:
On Different Models for Packet Flow in Multistage Interconnection Networks.
Fundam. Inform. 46(4): 287-314 (2001) |
| 1999 |
|---|
| 36 | EE | Martin Dietzfelbinger,
Martin Hühne:
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape.
Computational Complexity 8(4): 371-392 (1999) |
| 35 | EE | Noga Alon,
Martin Dietzfelbinger,
Peter Bro Miltersen,
Erez Petrank,
Gábor Tardos:
Linear Hash Functions.
J. ACM 46(5): 667-683 (1999) |
| 1997 |
|---|
| 34 | | Martin Dietzfelbinger:
Gossiping and Broadcasting versus Computing Functions in Networks.
STACS 1997: 189-200 |
| 33 | EE | Martin Dietzfelbinger:
The Linear-Array Problem in Communication Complexity Resolved.
STOC 1997: 373-382 |
| 32 | EE | Noga Alon,
Martin Dietzfelbinger,
Peter Bro Miltersen,
Erez Petrank,
Gábor Tardos:
Is Linear Hashing Good?
STOC 1997: 465-474 |
| 31 | | Martin Dietzfelbinger,
Torben Hagerup,
Jyrki Katajainen,
Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem.
J. Algorithms 25(1): 19-51 (1997) |
| 1996 |
|---|
| 30 | | Martin Dietzfelbinger:
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes.
STACS 1996: 569-580 |
| 29 | EE | Martin Dietzfelbinger:
Gossiping and Broadcasting versus Computing Functions in Networks
Electronic Colloquium on Computational Complexity (ECCC) 3(52): (1996) |
| 28 | EE | Martin Dietzfelbinger:
The Linear-Array Problem in Communication Complexity Resolved
Electronic Colloquium on Computational Complexity (ECCC) 3(63): (1996) |
| 27 | | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines.
SIAM J. Comput. 25(6): 1196-123 (1996) |
| 26 | EE | Martin Dietzfelbinger,
Juraj Hromkovic,
Georg Schnitger:
A Comparison of Two Lower-Bound Methods for Communication Complexity.
Theor. Comput. Sci. 168(1): 39-51 (1996) |
| 1995 |
|---|
| 25 | EE | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs
Electronic Colloquium on Computational Complexity (ECCC) 2(4): (1995) |
| 1994 |
|---|
| 24 | | Martin Dietzfelbinger,
Martin Hühne:
Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape.
FSTTCS 1994: 24-35 |
| 23 | | Martin Dietzfelbinger,
Juraj Hromkovic,
Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity.
MFCS 1994: 326-335 |
| 22 | | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs.
J. Comput. Syst. Sci. 48(2): 231-254 (1994) |
| 21 | | 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. 23(4): 738-761 (1994) |
| 1993 |
|---|
| 20 | | Martin Dietzfelbinger:
Simulations Between Different Models of Parallel Computers.
FCT 1993: 16-30 |
| 19 | EE | Martin Dietzfelbinger,
Friedhelm Meyer auf der Heide:
Simple, Efficient Shared Memory Simulations.
SPAA 1993: 110-119 |
| 18 | | Martin Dietzfelbinger,
Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary
Inf. Comput. 102(2): 196-217 (1993) |
| 17 | | Martin Dietzfelbinger,
Wolfgang Maass:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape.
Theor. Comput. Sci. 108(2): 271-290 (1993) |
| 1992 |
|---|
| 16 | | Martin Dietzfelbinger,
Friedhelm Meyer auf der Heide:
High Performance Universal Hashing, with Applications to Shared Memory Simulations.
Data Structures and Efficient Algorithms 1992: 250-269 |
| 15 | | Martin Dietzfelbinger,
Joseph Gil,
Yossi Matias,
Nicholas Pippenger:
Polynomial Hash Functions Are Reliable (Extended Abstract).
ICALP 1992: 235-246 |
| 14 | | Holger Bast,
Martin Dietzfelbinger,
Torben Hagerup:
A Perfect Parallel Dictionary.
MFCS 1992: 133-141 |
| 1991 |
|---|
| 13 | | Martin Dietzfelbinger,
Wolfgang Maass,
Georg Schnitger:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines.
Theor. Comput. Sci. 82(1): 113-129 (1991) |
| 1990 |
|---|
| 12 | | Martin Dietzfelbinger,
Friedhelm Meyer auf der Heide:
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.
ICALP 1990: 6-19 |
| 11 | EE | Martin Dietzfelbinger,
Miroslaw Kutylowski,
Rüdiger Reischuk:
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.
SPAA 1990: 125-135 |
| 10 | | Martin Dietzfelbinger,
Friedhelm Meyer auf der Heide:
How to Distribute a Dictionary in a Complete Network
STOC 1990: 117-127 |
| 1989 |
|---|
| 9 | EE | Martin Dietzfelbinger,
Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary.
SPAA 1989: 360-368 |
| 8 | | Martin Dietzfelbinger:
The Speed of Copying on One-Tape Off-Line Turing Machines.
Inf. Process. Lett. 33(2): 83-89 (1989) |
| 7 | | Martin Dietzfelbinger:
Lower Bounds for Sorting of Sums.
Theor. Comput. Sci. 66(2): 137-155 (1989) |
| 1988 |
|---|
| 6 | | 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: 524-531 |
| 5 | | Martin Dietzfelbinger,
Wolfgang Maass:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape.
ICALP 1988: 188-200 |
| 4 | | Martin Dietzfelbinger,
Kurt Mehlhorn,
Friedhelm Meyer auf der Heide,
Hans Rohnert:
Upper and Lower Bounds for the Dictionary Problem (Abstract).
SWAT 1988: 214-215 |
| 3 | | Martin Dietzfelbinger,
Wolfgang Maass:
Lower Bound Arguments with "Inaccessible" Numbers.
J. Comput. Syst. Sci. 36(3): 313-335 (1988) |
| 1987 |
|---|
| 2 | | Martin Dietzfelbinger:
Lower Bounds for Sorting of Sums.
ICALP 1987: 457-466 |
| 1986 |
|---|
| 1 | | Martin Dietzfelbinger,
Wolfgang Maass:
two Lower Bound Arguments with "Inaccessible" Numbers.
Structure in Complexity Theory Conference 1986: 163-183 |
