BibSLEIGH — Mikkel

Travelled to:

1 × Canada
1 × China
1 × France
1 × Italy
1 × Portugal
12 × USA
2 × Germany
3 × Greece

Collaborated with:

∅ M.Patrascu U.Zwick S.Alstrup H.Kaplan N.G.Duffield C.Lund J.Holm K.d.Lichtenberg K.Kawarabayashi P.Bille A.Andersson M.R.Henzinger M.Farach A.Blikle E.Cohen T.Christiani R.Pagh Y.Dodis L.Roditty P.W.Lauridsen N.Alon I.L.Gørtz T.Rauhe A.L.Buchsbaum H.J.Karloff C.Kenyon N.Reingold D.R.Karger P.N.Klein C.Stein N.E.Young

Talks about:

dynam (9) time (6) graph (5) determinist (4) independ (4) minimum (4) fulli (4) cut (4) algorithm (3) prioriti (3)

Person: Mikkel Thorup

DBLP: Thorup:Mikkel

Contributed to:

2015

2013

2011

2010

2009

2008

2007

2006

2005

2003

2001

2000

1999

1998

1997

1996

1995

1990

Wrote 32 papers:

STOC-2015-AlstrupKTZ #graph: Adjacency Labeling Schemes and Induced-Universal Graphs (SA, HK, MT, UZ), pp. 625–634.
STOC-2015-ChristianiPT #independence: From Independence to Expansion and Back Again (TC, RP, MT), pp. 813–820.
STOC-2015-KawarabayashiT #graph: Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.
STOC-2013-Thorup #independence #set #similarity: Bottom-k and priority sampling, set similarity and subset sums with minimal independence (MT), pp. 371–380.
STOC-2011-PatrascuT #power of: The power of simple tabulation hashing (MP, MT), pp. 1–10.
STOC-2011-PatrascuT11a: Don’t rush into a union: take time to find your roots (MP, MT), pp. 559–568.
ICALP-v1-2010-PatrascuT #independence #linear #on the: On the k-Independence Required by Linear Probing and Minwise Independence (MP, MT), pp. 715–726.
STOC-2010-DodisPT: Changing base without losing space (YD, MP, MT), pp. 593–602.
ICALP-v1-2009-BilleT #performance #regular expression: Faster Regular Expression Matching (PB, MT), pp. 171–182.
VLDB-2009-CohenDKLT #composition #scalability #set #summary: Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (EC, NGD, HK, CL, MT), pp. 431–442.
STOC-2008-Thorup: Minimum k-way cuts via deterministic greedy tree packing (MT), pp. 159–166.
PODS-2007-CohenDKLT #data type #query #sketching: Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.
STOC-2006-PatrascuT #trade-off: Time-space trade-offs for predecessor search (MP, MT), pp. 232–240.
ICALP-2005-AlstrupGRTZ #constant: Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.
ICALP-2005-RodittyTZ #approximate #distance: Deterministic Constructions of Approximate Distance Oracles and Spanners (LR, MT, UZ), pp. 261–272.
PODS-2005-AlonDLT #set: Estimating arbitrary subset sums with few probes (NA, NGD, CL, MT), pp. 317–325.
STOC-2005-Thorup #worst-case: Worst-case update times for fully-dynamic all-pairs shortest paths (MT), pp. 112–119.
STOC-2003-BuchsbaumKKRT: OPT versus LOAD in dynamic storage allocation (ALB, HJK, CK, NR, MT), pp. 556–564.
STOC-2003-Thorup #constant #integer #problem: Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.
STOC-2003-Thorup03a #performance #query: Space efficient dynamic stabbing with fast queries (MT), pp. 649–658.
ICALP-2001-Thorup #graph: Quick k-Median, k-Center, and Facility Location for Sparse Graphs (MT), pp. 249–260.
STOC-2001-Thorup: Fully-dynamic min-cut (MT), pp. 224–230.
STOC-2001-ThorupZ #approximate #distance: Approximate distance oracles (MT, UZ), pp. 183–192.
STOC-2000-AnderssonT #bound #worst-case: Tight(er) worst-case bounds on dynamic searching and priority queues (AA, MT), pp. 335–342.
STOC-2000-Thorup #graph: Near-optimal fully-dynamic graph connectivity (MT), pp. 343–350.
STOC-1999-KargerKSTY #algorithm #geometry #multi: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
STOC-1998-HolmLT #algorithm: Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.
ICALP-1997-AlstrupHLT: Minimizing Diameters of Dynamic Trees (SA, JH, KdL, MT), pp. 270–280.
ICALP-1996-HenzingerT #algorithm #graph: Improved Sampling with Applications to Dynamic Graph Algorithms (MRH, MT), pp. 290–299.
SAS-1996-AlstrupLT #source code: Generalized Dominators for Structured Programs (SA, PWL, MT), pp. 42–51.
STOC-1995-FarachT #string: String matching in Lempel-Ziv compressed strings (MF, MT), pp. 703–712.
VDME-1990-BlikleT #development #on the #process #syntax: On Conservative Extensions of Syntax in the Process of System Development (AB, MT), pp. 504–525.