Personal information

Emails & domains

Verified email addresses

Verified email domains

Websites & social links

Homepage at TU Ilmenau

Countries

Germany

Activities

Collapse all

Employment (2)

Technische Universität Ilmenau Fakultät für Wirtschaftswissenschaften und Medien: Ilmenau, Thüringen, DE

1998 to 2022 | Professor (Department of Computer Science and Automation)
Employment
Source: Self-asserted source
Martin Dietzfelbinger

Technische Universität Dortmund: Dortmund, Nordrhein-Westfalen, DE

1992 to 1998 | Professor (Informatik)
Employment
Source: Self-asserted source
Martin Dietzfelbinger

Education and qualifications (3)

Universität Paderborn: Paderborn, Nordrhein-Westfalen, DE

1992 | Habilitation (Informatik)
Education
Source: Self-asserted source
Martin Dietzfelbinger

University of Illinois at Chicago: Chicago, IL, US

1987 | PhD (Computer Science)
Education
Source: Self-asserted source
Martin Dietzfelbinger

Ludwig-Maximilians-Universität Munchen: München, Bayern, DE

1983 | Diplom (Mathematik)
Education
Source: Self-asserted source
Martin Dietzfelbinger

Professional activities (2)

Gesellschaft für Informatik e.V.: Bonn, DE

1992-01-01 to present
Membership
Source: Self-asserted source
Martin Dietzfelbinger

Association for Computing Machinery: New York, NY, US

1990 to present | Distinguished Scientist
Membership
Source: Self-asserted source
Martin Dietzfelbinger

Works (50 of 62)

Items per page:
Page 1 of 2

Constant-Time Retrieval with O(log m) Extra Bits

36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany
2019 | Conference paper
DOI: 10.4230/LIPIcs.STACS.2019.24
Source: Self-asserted source
Martin Dietzfelbinger

Dense Peelable Random Uniform Hypergraphs

27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.
2019 | Conference paper
DOI: 10.4230/LIPIcs.ESA.2019.38
Source: Self-asserted source
Martin Dietzfelbinger

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths

Combinatorics, Probability & Computing
2019 | Journal article
DOI: 10.1017/S096354831800041X
Source: Self-asserted source
Martin Dietzfelbinger

Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications

27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.
2019 | Conference paper
DOI: 10.4230/LIPIcs.ESA.2019.39
Source: Self-asserted source
Martin Dietzfelbinger

Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox
Source: Self-asserted source
Martin Dietzfelbinger

A Subquadratic Algorithm for 3XOR

43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK
2018 | Conference paper
DOI: 10.4230/LIPIcs.MFCS.2018.59
Source: Self-asserted source
Martin Dietzfelbinger

Universal Hashing via Integer Arithmetic Without Primes, Revisited

Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday
2018 | Conference paper
DOI: 10.1007/978-3-319-98355-4\_15
Source: Self-asserted source
Martin Dietzfelbinger

How Good Is Multi-Pivot Quicksort?

ACM Trans. Algorithms
2016 | Journal article
DOI: 10.1145/2963102
Source: Self-asserted source
Martin Dietzfelbinger

Optimal Partitioning for Dual-Pivot Quicksort

ACM Trans. Algorithms
2016 | Journal article
DOI: 10.1145/2743020
Source: Self-asserted source
Martin Dietzfelbinger

On testing single connectedness in directed graphs and some related problems

Inf. Process. Lett.
2015 | Journal article
DOI: 10.1016/j.ipl.2015.04.008
Source: Self-asserted source
Martin Dietzfelbinger

Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs

Theory Comput. Syst.
2015 | Journal article
DOI: 10.1007/s00224-014-9577-1
Source: Self-asserted source
Martin Dietzfelbinger

Algorithmen und Datenstrukturen - die Grundwerkzeuge
Source: Self-asserted source
Martin Dietzfelbinger

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash

Algorithmica
2014 | Journal article
DOI: 10.1007/s00453-013-9840-x
Source: Self-asserted source
Martin Dietzfelbinger

Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014
2014 | Conference paper
DOI: 10.1137/1.9781611973402.60
Source: Self-asserted source
Martin Dietzfelbinger

A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
2012 | Conference paper
DOI: 10.1007/978-3-642-30850-5_14
Source: Self-asserted source
Martin Dietzfelbinger

Algorithms Unplugged
Source: Self-asserted source
Martin Dietzfelbinger

Cuckoo Hashing with Pages

Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings
2011 | Conference paper
DOI: 10.1007/978-3-642-23719-5_52
Source: Self-asserted source
Martin Dietzfelbinger

Precision, Local Search and Unimodal Functions

Algorithmica
2011 | Journal article
DOI: 10.1007/s00453-009-9352-x
Source: Self-asserted source
Martin Dietzfelbinger

Tight Bounds for Blind Search on the Integers and the Reals

Combinatorics, Probability & Computing
2010 | Journal article
DOI: 10.1017/S0963548309990599
Source: Self-asserted source
Martin Dietzfelbinger

Tight Thresholds for Cuckoo Hashing via XORSAT

Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I
2010 | Conference paper
DOI: 10.1007/978-3-642-14165-2_19
Source: Self-asserted source
Martin Dietzfelbinger

Applications of a Splitting Trick

Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I
2009 | Conference paper
DOI: 10.1007/978-3-642-02927-1_30
Source: Self-asserted source
Martin Dietzfelbinger

Experimental Variations of a Theoretically Good Retrieval Data Structure

Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings
2009 | Conference paper
DOI: 10.1007/978-3-642-04128-0_66
Source: Self-asserted source
Martin Dietzfelbinger

Hash, Displace, and Compress

Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings
2009 | Conference paper
DOI: 10.1007/978-3-642-04128-0_61
Source: Self-asserted source
Martin Dietzfelbinger

On risks of using cuckoo hashing with simple universal hash classes

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009
2009 | Conference paper
Source: Self-asserted source
Martin Dietzfelbinger

Perfect Hashing for State Spaces in BDD Representation

KI 2009: Advances in Artificial Intelligence, 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings
2009 | Conference paper
DOI: 10.1007/978-3-642-04617-9_5
Source: Self-asserted source
Martin Dietzfelbinger

Tight lower bounds for greedy routing in uniform small world rings

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009
2009 | Conference paper
DOI: 10.1145/1536414.1536494
Source: Self-asserted source
Martin Dietzfelbinger

Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes

SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings
2009 | Conference paper
DOI: 10.1007/978-3-540-95891-8_22
Source: Self-asserted source
Martin Dietzfelbinger

A dictionary implementation based on dynamic perfect hashing

ACM Journal of Experimental Algorithmics
2008 | Journal article
DOI: 10.1145/1227161.1370602
Source: Self-asserted source
Martin Dietzfelbinger

Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games
2008 | Conference paper
DOI: 10.1007/978-3-540-70575-8_32
Source: Self-asserted source
Martin Dietzfelbinger

A characterization of average case communication complexity

Inf. Process. Lett.
2007 | Journal article
DOI: 10.1016/j.ipl.2006.10.006
Source: Self-asserted source
Martin Dietzfelbinger

Balanced allocation and dictionaries with tightly packed constant size bins

Theor. Comput. Sci.
2007 | Journal article
DOI: 10.1016/j.tcs.2007.02.054
Source: Self-asserted source
Martin Dietzfelbinger

Design Strategies for Minimal Perfect Hash Functions

Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
2007 | Conference paper
DOI: 10.1007/978-3-540-74871-7_2
Source: Self-asserted source
Martin Dietzfelbinger

On the probability of rendezvous in graphs

Random Struct. Algorithms
2005 | Journal article
DOI: 10.1002/rsa.20032
Source: Self-asserted source
Martin Dietzfelbinger

Gossiping and broadcasting versus computing functions in networks

Discrete Applied Mathematics
2004 | Journal article
DOI: 10.1016/S0166-218X(03)00257-9
Source: Self-asserted source
Martin Dietzfelbinger

Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"

2004 | Book
DOI: 10.1007/b12334
ISBN: 3-540-40344-2
Source: Self-asserted source
Martin Dietzfelbinger

Almost random graphs with simple hash functions

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA
2003 | Conference paper
DOI: 10.1145/780542.780634
Source: Self-asserted source
Martin Dietzfelbinger

The analysis of a recombinative hill-climber on H-IFF

IEEE Trans. Evolutionary Computation
2003 | Journal article
DOI: 10.1109/TEVC.2003.818192
Source: Self-asserted source
Martin Dietzfelbinger

On Different Models for Packet Flow in Multistage Interconnection Networks

Fundam. Inform.
2001 | Journal article
Source: Self-asserted source
Martin Dietzfelbinger

Simple Minimal Perfect Hashing in Less Space

Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings
2001 | Conference paper
DOI: 10.1007/3-540-44676-1_9
Source: Self-asserted source
Martin Dietzfelbinger

Linear Hash Functions

J. ACM
1999 | Journal article
DOI: 10.1145/324133.324179
Source: Self-asserted source
Martin Dietzfelbinger

Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape

Computational Complexity
1999 | Journal article
DOI: 10.1007/s000370050006
Source: Self-asserted source
Martin Dietzfelbinger

A Reliable Randomized Algorithm for the Closest-Pair Problem

J. Algorithms
1997 | Journal article
DOI: 10.1006/jagm.1997.0873
Source: Self-asserted source
Martin Dietzfelbinger

The Linear-Array Problem in Communication Complexity Resolved

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997
1997 | Conference paper
DOI: 10.1145/258533.258622
Source: Self-asserted source
Martin Dietzfelbinger

A Comparison of Two Lower-Bound Methods for Communication Complexity

Theor. Comput. Sci.
1996 | Journal article
DOI: 10.1016/S0304-3975(96)00062-X
Source: Self-asserted source
Martin Dietzfelbinger

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines

SIAM J. Comput.
1996 | Journal article
DOI: 10.1137/S0097539791224285
Source: Self-asserted source
Martin Dietzfelbinger

Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes

STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings
1996 | Conference paper
DOI: 10.1007/3-540-60922-9_46
Source: Self-asserted source
Martin Dietzfelbinger

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM J. Comput.
1994 | Journal article
DOI: 10.1137/S0097539791194094
Source: Self-asserted source
Martin Dietzfelbinger

Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs

J. Comput. Syst. Sci.
1994 | Journal article
DOI: 10.1016/S0022-0000(05)80003-0
Source: Self-asserted source
Martin Dietzfelbinger

An Optimal Parallel Dictionary

Inf. Comput.
1993 | Journal article
DOI: 10.1006/inco.1993.1007
Source: Self-asserted source
Martin Dietzfelbinger

Simple, Efficient Shared Memory Simulations

SPAA
1993 | Conference paper
DOI: 10.1145/165231.165246
Source: Self-asserted source
Martin Dietzfelbinger
Items per page:
Page 1 of 2

Peer review (2 reviews for 2 publications/grants)

Review activity for SIAM journal on computing. (1)
Review activity for Theory of computing systems. (1)
How many people are using ORCID?