BibSLEIGH — Kurt

Travelled to:

1 × Belgium
1 × Germany
1 × Israel
1 × Portugal
1 × Sweden
2 × Greece
2 × Latvia
2 × Switzerland
2 × United Kingdom
3 × Finland
3 × USA
4 × Italy

Collaborated with:

∅ S.Näher H.Alt T.Hagerup T.Kavitha J.I.Munro R.Duan W.J.Paul C.Yap M.Kaufmann A.K.Tsakalidis F.P.Preparata E.M.Schmidt D.Altenkamp N.Megow P.Schweitzer R.Hariharan R.Osbild M.Sagraloff C.Uhrig J.Cheriyan J.Hong A.L.Rosenberg D.M.Kane T.Sauerwald H.Sun E.Alkassar S.Böhme C.Rizkallah K.Kaligosi P.Sanders D.Michail K.E.Paluch L.Becchetti V.Bonifaci M.Dirnberger A.Karrenbauer

Talks about:

comput (7) algorithm (6) graph (5) minimum (3) complex (3) optim (3) bound (3) time (3) combinatori (2) subrecurs (2)

Person: Kurt Mehlhorn

DBLP: Mehlhorn:Kurt

Facilitated 2 volumes:

Contributed to:

2013

2012

2011

2009

2006

2005

2004

2000

1997

1993

1990

1989

1988

1987

1985

1984

1982

1981

1980

1978

1977

1976

1974

Wrote 29 papers:

ICALP-v1-2013-DuanM #algorithm #combinator #linear #polynomial: A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market (RD, KM), pp. 425–436.
ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving: Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.
ICALP-v2-2012-KaneMSS #data type: Counting Arbitrary Subgraphs in Data Streams (DMK, KM, TS, HS), pp. 598–609.
CAV-2011-AlkassarBMR #verification: Verification of Certifying Computations (EA, SB, KM, CR), pp. 67–82.
ICALP-v2-2011-MegowMS #algorithm #graph #online: Online Graph Exploration: New Results on Old and New Algorithms (NM, KM, PS), pp. 478–489.
ICALP-v1-2009-Mehlhorn: Assigning Papers to Referees (KM), pp. 1–2.
ICALP-v1-2006-HariharanKM #algorithm #graph #performance: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.
ICALP-v1-2006-MehlhornOS #geometry #performance #reliability: Reliable and Efficient Computational Geometry Via Controlled Perturbation (KM, RO, MS), pp. 299–310.
ICALP-2005-KaligosiMMS #multi #towards: Towards Optimal Multiple Selection (KK, KM, JIM, PS), pp. 103–114.
ICALP-2004-KavithaMMP #algorithm #graph #performance: A Faster Algorithm for Minimum Cycle Basis of Graphs (TK, KM, DM, KEP), pp. 846–857.
ICALP-2000-Mehlhorn #algorithm #constraints #graph #programming: Constraint Programming and Graph Algorithms (KM), pp. 571–575.
ICALP-1997-MehlhornNU #combinator #framework #geometry #platform: The LEDA Platform of Combinatorial and Geometric Computing (KM, SN, CU), pp. 7–16.
ICALP-1993-HagerupMM #maintenance #probability: Maintaining Discrete Probability Distributions Optimally (TH, KM, JIM), pp. 253–264.
ICALP-1990-CheriyanHM #question: Can A Maximum Flow be Computed on o(nm) Time? (JC, TH, KM), pp. 235–248.
ICALP-1990-NaherM #algorithm #data type #library #named #performance: LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.
ICALP-1989-MehlhornP #source code: Two Versus One Index Register and Modifiable Versus Non-modifiable Programs (KM, WJP), pp. 603–609.
ICALP-1988-MehlhornY #how #theorem: Constructive Hopf’s Theorem: Or How to Untangle Closed Planar Curves (KM, CKY), pp. 410–423.
ICALP-1987-MehlhornNA #bound #complexity #problem: A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.
ICALP-1985-KaufmannM: Routing Through a Generalized Switchbox (MK, KM), pp. 328–337.
ICALP-1985-MehlhornT: Dynamic Interpolation Search (KM, AKT), pp. 424–434.
ICALP-1984-MehlhornP #integer #multi: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (KM, FPP), pp. 347–357.
STOC-1982-MehlhornS #distributed: Las Vegas Is better than Determinism in VLSI and Distributed Computing (KM, EMS), pp. 330–337.
ICALP-1981-HongMR #graph #trade-off: Cost Tradeoffs in Graph Embeddings, with Applications (JWH, KM, ALR), pp. 41–55.
ICALP-1980-Mehlhorn: Pebbling Mountain Ranges and its Application of DCFL-Recognition (KM), pp. 422–435.
ICALP-1978-AltenkampM #named: Codes: Unequal Probabilities, Unequal Letter Costs (DA, KM), pp. 15–25.
ICALP-1977-Mehlhorn: Dynamic Binary Search (KM), pp. 323–336.
ICALP-1976-AltM #bound #complexity #recognition: Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.
ICALP-1974-Mehlhorn #decidability #recursion: The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.
STOC-1974-Mehlhorn #polynomial #recursion: Polynomial and Abstract Subrecursive Classes (KM), pp. 96–109.