Advanced search

Authors whose works are in public domain in at least one jurisdiction

List of works by Kurt Mehlhorn

1-22 of 22 results

Physarum can compute shortest paths

scientific article published on 23 June 2012

Faster algorithms for the shortest path problem

article

Congruence, Similarity, and Symmetries of Geometric Objects

journal article from 'Discrete & Computational Geometry' published in 1988

Dynamic fractional cascading

scientific article (publication date: June 1990)

A polyhedral approach to sequence alignment problems

On the average number of rebalancing operations in weight-balanced trees

article published in 1980

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

Simultaneous Inner and Outer Approximation of Shapes

journal article from 'Algorithmica' published in 1992

Dynamic Perfect Hashing: Upper and Lower Bounds

article

EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number

scientific article published on 07 July 2023

A Best Possible Bound for the Weighted Path Length of Binary Search Trees

1977 scientific journal article

Algorithms and Data Structures

scholarly article published 2008

Classroom examples of robustness problems in geometric computations

An analysis of the highest-level selection rule in the preflow-push max-flow algorithm

Bounded ordered dictionaries in O(log log N) time and O(n) space

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

scientific article published in 1996

Online Graph Exploration: New Results on Old and New Algorithms

scholarly article by Nicole Megow et al published 2011 in Lecture Notes in Computer Science

Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection

journal article from 'Comput. Geom.' published in 1993

Online graph exploration: New results on old and new algorithms

Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design

Nearly Optimal Binary Search Trees

1975 scientific journal article

Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)