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 × Canada
1 × Germany
1 × The Netherlands
5 × USA
Collaborated with:
K.A.Hansen M.Koucký A.Gál H.Buhrman J.Radhakrishnan S.Venkatesh N.Nisan S.Safra A.Wigderson N.Lauritzen E.P.Tsigaridas N.Alon M.Dietzfelbinger E.Petrank G.Tardos
Talks about:
structur (2) complex (2) lower (2) bound (2) game (2) data (2) dictionari (1) exponenti (1) bitvector (1) algorithm (1)

Person: Peter Bro Miltersen

DBLP DBLP: Miltersen:Peter_Bro

Contributed to:

STOC 20112011
LICS 20092009
ICALP 20032003
STOC 20002000
STOC 19971997
ICALP 19961996
STOC 19951995
STOC 19941994

Wrote 8 papers:

STOC-2011-HansenKLMT #algorithm #game studies #probability
Exact algorithms for solving stochastic games: extended abstract (KAH, MK, NL, PBM, EPT), pp. 205–214.
LICS-2009-HansenKM #concurrent #game studies #reachability
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
ICALP-2003-GalM #complexity #data type
The Cell Probe Complexity of Succinct Data Structures (AG, PBM), pp. 332–344.
STOC-2000-BuhrmanMRV #question
Are bitvectors optimal? (HB, PBM, JR, SV), pp. 449–458.
STOC-1997-AlonDMPT #linear #question
Is Linear Hashing Good? (NA, MD, PBM, EP, GT), pp. 465–474.
ICALP-1996-Miltersen #bound #multi
Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication (PBM), pp. 442–453.
STOC-1995-MiltersenNSW #communication #complexity #data type #on the #symmetry
On data structures and asymmetric communication complexity (PBM, NN, SS, AW), pp. 103–111.
STOC-1994-Miltersen #bound #problem #random
Lower bounds for union-split-find related problems on random access machines (PBM), pp. 625–634.

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.