Martin Dietzfelbinger Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDjamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger: Hash, Displace, and Compress. ESA 2009: 682-693
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Aumüller, Martin Dietzfelbinger, Michael Rink: Experimental Variations of a Theoretically Good Retrieval Data Structure. ESA 2009: 742-751
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Michael Rink: Applications of a Splitting Trick. ICALP (1) 2009: 354-365
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Stefan Edelkamp: Perfect Hashing for State Spaces in BDD Representation. KI 2009: 33-40
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Philipp Woelfel: Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC 2009: 300-301
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Ulf Schellbach: On risks of using cuckoo hashing with simple universal hash classes. SODA 2009: 795-804
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Ulf Schellbach: Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. SOFSEM 2009: 217-228
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Philipp Woelfel: Tight lower bounds for greedy routing in uniform small world rings. STOC 2009: 591-600
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink: Tight Thresholds for Cuckoo Hashing via XORSAT CoRR abs/0912.0287: (2009)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008. Theor. Comput. Sci. 410(44): 4446-4447 (2009)
2008
61no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBerthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Taschenbuch der Algorithmen Springer 2008
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, local search and unimodal functions. GECCO 2008: 771-778
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Rasmus Pagh: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) 2008: 385-396
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Fingerprinting. Taschenbuch der Algorithmen 2008: 193-204
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Martin Hühne, Christoph Weidling: A dictionary implementation based on dynamic perfect hashing. ACM Journal of Experimental Algorithmics 12: (2008)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers CoRR abs/0802.2852: (2008)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Rasmus Pagh: Succinct Data Structures for Retrieval and Approximate Membership CoRR abs/0803.3693: (2008)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Design Strategies for Minimal Perfect Hash Functions. SAGA 2007: 2-17
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Henning Wunderlich: A characterization of average case communication complexity. Inf. Process. Lett. 101(6): 245-249 (2007)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Christoph Weidling: Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380(1-2): 47-68 (2007)
2005
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Christoph Weidling: Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. ICALP 2005: 166-178
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Hisao Tamaki: On the probability of rendezvous in graphs. Random Struct. Algorithms 26(3): 266-288 (2005)
2004
45no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P" Springer 2004
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Gossiping and broadcasting versus computing functions in networks. Discrete Applied Mathematics 137(2): 127-153 (2004)
2003
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Philipp Woelfel: Almost random graphs with simple hash functions. STOC 2003: 629-638
42no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Manfred Kunde: A case against using Stirling's formula (unless you really need it). Bulletin of the EATCS 80: 153-158 (2003)
41no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: The Probability of a Rendezvous is Minimal in Complete Graphs. ISAAC 2002: 55-66
2001
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Torben Hagerup: Simple Minimal Perfect Hashing in Less Space. ESA 2001: 109-120
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Anna Gambin, Slawomir Lasota: On Different Models for Packet Flow in Multistage Interconnection Networks. Fundam. Inform. 46(4): 287-314 (2001)
1999
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Linear Hash Functions. J. ACM 46(5): 667-683 (1999)
1997
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Gossiping and Broadcasting versus Computing Functions in Networks. STACS 1997: 189-200
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: The Linear-Array Problem in Communication Complexity Resolved. STOC 1997: 373-382
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Is Linear Hashing Good? STOC 1997: 465-474
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen: A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997)
1996
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. STACS 1996: 569-580
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Gossiping and Broadcasting versus Computing Functions in Networks Electronic Colloquium on Computational Complexity (ECCC) 3(52): (1996)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: The Linear-Array Problem in Communication Complexity Resolved Electronic Colloquium on Computational Complexity (ECCC) 3(63): (1996)
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996)
1995
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Martin Hühne: Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. FSTTCS 1994: 24-35
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger: A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Simulations Between Different Models of Parallel Computers. FCT 1993: 16-30
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Friedhelm Meyer auf der Heide: Simple, Efficient Shared Memory Simulations. SPAA 1993: 110-119
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Friedhelm Meyer auf der Heide: An Optimal Parallel Dictionary Inf. Comput. 102(2): 196-217 (1993)
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Friedhelm Meyer auf der Heide: High Performance Universal Hashing, with Applications to Shared Memory Simulations. Data Structures and Efficient Algorithms 1992: 250-269
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger: Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP 1992: 235-246
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHolger Bast, Martin Dietzfelbinger, Torben Hagerup: A Perfect Parallel Dictionary. MFCS 1992: 133-141
1991
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough: Three disjoint path paradigms in star networks. SPDP 1991: 400-406
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Friedhelm Meyer auf der Heide: A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. ICALP 1990: 6-19
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk: Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA 1990: 125-135
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Friedhelm Meyer auf der Heide: How to Distribute a Dictionary in a Complete Network STOC 1990: 117-127
1989
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Friedhelm Meyer auf der Heide: An Optimal Parallel Dictionary. SPAA 1989: 360-368
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: The Speed of Copying on One-Tape Off-Line Turing Machines. Inf. Process. Lett. 33(2): 83-89 (1989)
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Lower Bounds for Sorting of Sums. Theor. Comput. Sci. 66(2): 137-155 (1989)
1988
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Wolfgang Maass: The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. ICALP 1988: 188-200
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert: Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Wolfgang Maass: Lower Bound Arguments with "Inaccessible" Numbers. J. Comput. Syst. Sci. 36(3): 313-335 (1988)
1987
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger: Lower Bounds for Sorting of Sums. ICALP 1987: 457-466
1986
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Wolfgang Maass: two Lower Bound Arguments with "Inaccessible" Numbers. Structure in Complexity Theory Conference 1986: 163-183

Coauthor Index

1Noga Alon [33] [36]
2Helmut Alt [61]
3Martin Aumüller [70]
4Hannah Bast (Holger Bast) [15]
5Djamal Belazzougui [71]
6Fabiano C. Botelho [71]
7Stefan Edelkamp [68]
8Anna Gambin [38]
9Joseph Gil (Yossi Gil) [16]
10Andreas Goerdt [63]
11Torben Hagerup [15] [32] [39]
12Friedhelm Meyer auf der Heide [4] [6] [9] [10] [12] [17] [19] [20] [22]
13Clarissa Van Hoyweghen [41]
14Juraj Hromkovic [24] [27]
15Martin Hühne [25] [37] [56]
16Anna R. Karlin [6] [22]
17Jyrki Katajainen [32]
18Manfred Kunde [42]
19Miroslaw Kutylowski [11] [23] [26] [28]
20Slawomir Lasota [38]
21Wolfgang Maass [1] [3] [5] [13] [18]
22Seshu Madhavapeddy [14]
23Yossi Matias [16]
24Kurt Mehlhorn [4] [6] [22]
25Peter Bro Miltersen [33] [36]
26Michael Mitzenmacher [63]
27Andrea Montanari [63]
28Bart Naudts [41]
29Rasmus Pagh [54] [59] [63]
30Martti Penttonen [32]
31Erez Petrank [33] [36]
32Nicholas Pippenger [16]
33Rüdiger Reischuk [11] [23] [26] [28] [61]
34Michael Rink [63] [69] [70]
35Hans Rohnert [4] [6] [22]
36Jonathan E. Rowe [55] [58] [60]
37Christian Scheideler [61]
38Ulf Schellbach [65] [66]
39Georg Schnitger [13] [24] [27]
40Ivan Hal Sudborough [14]
41Hisao Tamaki [46]
42Gábor Tardos [33] [36]
43Robert Endre Tarjan [6] [22]
44Shang-Hua Teng [51] [52]
45Eli Upfal [51] [52]
46Berthold Vöcking [51] [52] [61]
47Heribert Vollmer [61]
48Dorothea Wagner [61]
49Ingo Wegener [41] [55] [58] [60]
50Christoph Weidling [47] [48] [56]
51Philipp Woelfel [43] [55] [58] [60] [64] [67]
52Henning Wunderlich [49]

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)