BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Finland
1 × France
1 × Germany
1 × Greece
1 × Iceland
1 × Latvia
1 × Portugal
4 × USA
Collaborated with:
P.Woelfel F.M.a.d.Heide R.Pagh M.Rink M.Aumüller C.Weidling W.Maass J.Y.Gil Y.Matias N.Pippenger N.Alon P.B.Miltersen E.Petrank G.Tardos A.Goerdt M.Mitzenmacher A.Montanari
Talks about:
hash (6) function (3) tight (3) dictionari (2) complex (2) linear (2) lower (2) bound (2) tape (2) transposit (1)

Person: Martin Dietzfelbinger

DBLP DBLP: Dietzfelbinger:Martin

Contributed to:

ICALP (1) 20132013
ICALP (1) 20102010
ICALP (1) 20092009
STOC 20092009
ICALP (1) 20082008
ICALP 20052005
STOC 20032003
STOC 19971997
ICALP 19921992
ICALP 19901990
STOC 19901990
ICALP 19881988
ICALP 19871987

Wrote 14 papers:

ICALP-v1-2013-AumullerD #clustering
Optimal Partitioning for Dual Pivot Quicksort — (MA, MD), pp. 33–44.
ICALP-v1-2010-DietzfelbingerGMMPR #satisfiability
Tight Thresholds for Cuckoo Hashing via XORSAT (MD, AG, MM, AM, RP, MR), pp. 213–225.
Applications of a Splitting Trick (MD, MR), pp. 354–365.
STOC-2009-DietzfelbingerW #bound
Tight lower bounds for greedy routing in uniform small world rings (MD, PW), pp. 591–600.
ICALP-A-2008-DietzfelbingerP #approximate #data type #retrieval
Succinct Data Structures for Retrieval and Approximate Membership (MD, RP), pp. 385–396.
ICALP-2005-DietzfelbingerW #constant
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins (MD, CW), pp. 166–178.
STOC-2003-DietzfelbingerW #graph #random
Almost random graphs with simple hash functions (MD, PW), pp. 629–638.
STOC-1997-AlonDMPT #linear #question
Is Linear Hashing Good? (NA, MD, PBM, EP, GT), pp. 465–474.
STOC-1997-Dietzfelbinger #communication #complexity #problem
The Linear-Array Problem in Communication Complexity Resolved (MD), pp. 373–382.
ICALP-1992-DietzfelbingerGMP #polynomial #reliability
Polynomial Hash Functions Are Reliable (MD, JYG, YM, NP), pp. 235–246.
ICALP-1990-DietzfelbingerH #realtime
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time (MD, FMadH), pp. 6–19.
STOC-1990-DietzfelbingerH #how #network #taxonomy
How to Distribute a Dictionary in a Complete Network (MD, FMadH), pp. 117–127.
ICALP-1988-DietzfelbingerM #complexity #matrix #turing machine
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
ICALP-1987-Dietzfelbinger #bound #sorting
Lower Bounds for Sorting of Sums (MD), pp. 457–466.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.