Martin Dietzfelbinger - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Cuckoo Hashing with PagesMartin Dietzfelbinger, Michael Mitzenmacher, Michael Rink. esa 2011: 615-627 [doi]

FingerprintingMartin Dietzfelbinger. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 181-193, Springer, 2011. [doi]

Precision, Local Search and Unimodal FunctionsMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel. algorithmica, 59(3):301-322, 2011. [doi]

Algorithms UnpluggedBerthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Springer, 2011. [doi]

2010

2009

Experimental Variations of a Theoretically Good Retrieval Data StructureMartin AumÃ¼ller, Martin Dietzfelbinger, Michael Rink. esa 2009: 742-751 [doi]

Hash, Displace, and CompressDjamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger. esa 2009: 682-693 [doi]

On risks of using cuckoo hashing with simple universal hash classesMartin Dietzfelbinger, Ulf Schellbach. soda 2009: 795-804 [doi]

Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large UniversesMartin Dietzfelbinger, Ulf Schellbach. sofsem 2009: 217-228 [doi]

Perfect Hashing for State Spaces in BDD RepresentationMartin Dietzfelbinger, Stefan Edelkamp. ki 2009: 33-40 [doi]

Applications of a Splitting TrickMartin Dietzfelbinger, Michael Rink. icalp 2009: 354-365 [doi]

In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008Martin Dietzfelbinger. TCS, 410(44):4446-4447, 2009. [doi]

Brief announcement: tight lower bounds for greedy routing in uniform small world ringsMartin Dietzfelbinger, Philipp Woelfel. podc 2009: 300-301 [doi]

Tight lower bounds for greedy routing in uniform small world ringsMartin Dietzfelbinger, Philipp Woelfel. stoc 2009: 591-600 [doi]

2008

Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)Martin Dietzfelbinger, Rasmus Pagh. icalp 2008: 385-396 [doi]

A dictionary implementation based on dynamic perfect hashingMartin Dietzfelbinger, Martin Hühne, Christoph Weidling. jea, 12, 2008. [doi]

Tight Bounds for Blind Search on the IntegersMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel. STACS 2008: 241-252 [doi]

Precision, local search and unimodal functionsMartin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel. gecco 2008: 771-778 [doi]

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-4Martin Dietzfelbinger. csr, 2(2):131-136, 2008. [doi]

2007

Balanced allocation and dictionaries with tightly packed constant size binsMartin Dietzfelbinger, Christoph Weidling. TCS, 380(1-2):47-68, 2007. [doi]

A characterization of average case communication complexityMartin Dietzfelbinger, Henning Wunderlich. ipl, 101(6):245-249, 2007. [doi]

Design Strategies for Minimal Perfect Hash FunctionsMartin Dietzfelbinger. saga 2007: 2-17 [doi]

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of AlgorithmsMartin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking. dagstuhl 2007: [doi]

Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking, editors, Volume 07391 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

2005

Balanced Allocation and Dictionaries with Tightly Packed Constant Size BinsMartin Dietzfelbinger, Christoph Weidling. icalp 2005: 166-178 [doi]

On the probability of rendezvous in graphsMartin Dietzfelbinger, Hisao Tamaki. rsa, 26(3):266-288, 2005. [doi]

2004

Gossiping and broadcasting versus computing functions in networksMartin Dietzfelbinger. DAM, 137(2):127-153, 2004. [doi]

Primality Testing in Polynomial Time, From Randomized Algorithms to PRIMES Is in P Martin Dietzfelbinger. Volume 3000 of Lecture Notes in Computer Science, Springer, 2004.

2003

A case against using Stirling s formula (unless you really need it)Martin Dietzfelbinger, Manfred Kunde. eatcs, 80:153-158, 2003.

Almost random graphs with simple hash functionsMartin Dietzfelbinger, Philipp Woelfel. stoc 2003: 629-638 [doi]

The analysis of a recombinative hill-climber on H-IFFMartin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener. tec, 7(5):417-423, 2003.

2002

The Probability of a Rendezvous is Minimal in Complete GraphsMartin Dietzfelbinger. isaac 2002: 55-66 [doi]

2001

Simple Minimal Perfect Hashing in Less SpaceMartin Dietzfelbinger, Torben Hagerup. esa 2001: 109-120 [doi]

On Different Models for Packet Flow in Multistage Interconnection NetworksMartin Dietzfelbinger, Anna Gambin, Slawomir Lasota. FUIN, 46(4):287-314, 2001.

1999

Linear Hash FunctionsNoga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos. JACM, 46(5):667-683, 1999. [doi]

Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tapeMartin Dietzfelbinger, Martin Hühne. cc, 8(4):371-392, 1999. [doi]

1997

1996

1995

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMsMartin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk. eccc, 2(4), 1995. [doi]

1994

1993

An Optimal Parallel DictionaryMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. iandc, 102(2):196-217, February 1993.

The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output TapeMartin Dietzfelbinger, Wolfgang Maass. TCS, 108(2):271-290, 1993.

Simple, Efficient Shared Memory SimulationsMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. spaa 1993: 110-119 [doi]

Simulations Between Different Models of Parallel ComputersMartin Dietzfelbinger. fct 1993: 16-30

1992

A Perfect Parallel DictionaryHolger Bast, Martin Dietzfelbinger, Torben Hagerup. mfcs 1992: 133-141

Polynomial Hash Functions Are Reliable (Extended Abstract)Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger. icalp 1992: 235-246

High Performance Universal Hashing, with Applications to Shared Memory SimulationsMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. dfg 1992: 250-269

1991

Three disjoint path paradigms in star networksMartin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough. spdp 1991: 400-406 [doi]

The Complexity of Matrix Transposition on One-Tape Off-Line Turing MachinesMartin Dietzfelbinger, Wolfgang Maass, Georg Schnitger. TCS, 82(1):113-129, 1991.

1990

A New Universal Class of Hash Functions and Dynamic Hashing in Real TimeMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. icalp 1990: 6-19

Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous WritesMartin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk. spaa 1990: 125-135 [doi]

How to Distribute a Dictionary in a Complete NetworkMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. stoc 1990: 117-127

1989

Lower Bounds for Sorting of SumsMartin Dietzfelbinger. TCS, 66(2):137-155, 1989.

An Optimal Parallel DictionaryMartin Dietzfelbinger, Friedhelm Meyer auf der Heide. spaa 1989: 360-368 [doi]

The Speed of Copying on One-Tape Off-Line Turing MachinesMartin Dietzfelbinger. ipl, 33(2):83-89, 1989.

1988

1987

Lower Bounds for Sorting of SumsMartin Dietzfelbinger. icalp 1987: 457-466

1986

two Lower Bound Arguments with Inaccessible NumbersMartin Dietzfelbinger, Wolfgang Maass. cocoon 1986: 163-183