A provably fast linear-expected-time maxima-finding algorithm

DOI10.1007/BF01189991zbMath0823.68112OpenAlexW2067403198MaRDI QIDQ1329142

Mordecai J. Golin

Publication date: 29 October 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189991

zbMATH Keywords

component independent distributionmove-to-front algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

A phase transition for the probability of being a maximum among random vectors with general iid coordinates ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach ⋮ A volume first maxima-finding algorithm ⋮ On constant factors in comparison-based geometric algorithms and data structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• Applications of the theory of records in the study of random trees
• On the average number of maximal in a set of vectors
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications

This page was built for publication: A provably fast linear-expected-time maxima-finding algorithm