Concepedia

Martin Dietzfelbinger

MD

27

Publications

1.1K

Citations

18

H-Index

1988

Active since

Affiliations

Technische Universität Ilmenau(Current)

TU Dortmund University

Paderborn University

University of Calgary

IT University of Copenhagen

Martin Dietzfelbinger is an author at Technische Universität Ilmenau specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityDiscrete MathematicsCombinatorial OptimizationTheory Of ComputingCryptographyComputer EngineeringMathematical ProgrammingGraph Theory

Publications per year

1988–2019

27

Publications

27

A Reliable Randomized Algorithm for the Closest-Pair Problem

Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen et al. · Journal of Algorithms · 1997 · 203 citations

Mathematical Programming, Engineering, Reliable Randomized Algorithm +7

Balanced allocation and dictionaries with tightly packed constant size bins

Martin Dietzfelbinger, Christoph Weidling · Theoretical Computer Science · 2007 · 126 citations

Engineering, Computer Engineering, Computational Complexity +6

Almost random graphs with simple hash functions

Martin Dietzfelbinger, Philipp Woelfel · 2003 · 90 citations

Theory Of Computing, Simple Randomized Construction, Engineering +15

Three disjoint path paradigms in star networks

Martin Dietzfelbinger, S. Madhavapeddy, I. Hal Sudborough · 2002 · 88 citations

Network Theory (Electrical Engineering), Directed Graph, Engineering +21

Simple, efficient shared memory simulations

Martin Dietzfelbinger, Friedhelm Meyer auf der Heide · 1993 · 63 citations

Memory Simulations Authors, Engineering, Shared Memory +12

Rows per page

1–5 of 27