Lista de obras - Kurt Mehlhorn - Dominio Público Uruguay

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

1977 scientific journal article

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

artículo científico publicado en 1996

A polyhedral approach to sequence alignment problems

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

Classroom examples of robustness problems in geometric computations

Congruence, Similarity, and Symmetries of Geometric Objects

artículo científico publicado en 1988

Dynamic Perfect Hashing: Upper and Lower Bounds

article

Dynamic fractional cascading

artículo científico publicado en 1990

Faster algorithms for the shortest path problem

article

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

Nearly Optimal Binary Search Trees ⬇️

1975 scientific journal article

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

article published in 1980

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

Online graph exploration: New results on old and new algorithms

Physarum can compute shortest paths

artículo científico publicado en 2012

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

Simultaneous Inner and Outer Approximation of Shapes

artículo científico publicado en 1992

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

artículo científico publicado en 1993

Lista de obras de Kurt Mehlhorn