Finding an Approximate Maximum

DOI10.1137/0218017zbMath0677.68068OpenAlexW2011036899MaRDI QIDQ3833631

Noga Alon, Yossi Azar

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218017

zbMATH Keywords

searchingapproximate maximumparallel comparison algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (4)

Transforming comparison model lower bounds to the parallel-random-access-machine ⋮ Parallel selection ⋮ Parallel comparison merging of many-ordered lists ⋮ Parallel comparison algorithms for approximation problems

This page was built for publication: Finding an Approximate Maximum