A note on the expected time for finding maxima by list algorithms
From MaRDI portal
Publication:1277391
DOI10.1007/PL00009256zbMath0913.68089OpenAlexW2084336096MaRDI QIDQ1277391
Publication date: 2 February 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009256
Related Items (3)
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 ⋮ On the variance of the number of maxima in random vectors and its applications
This page was built for publication: A note on the expected time for finding maxima by list algorithms