Finding an Approximate Maximum

DOI10.1137/0218017MaRDI QIDQ3833631zbMATH OpenOpenAlexFDO

Authors 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

approximate maximumparallel comparison algorithmssearching

Mathematics Subject Classification ID

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

Recommendations

• Estimating the maximum
• Finding the maximum and minimum
• A Maximum Problem
• Determination of maxima for arbitrary orders
• Experimental Determination of the Maximum of a Function
• scientific article; zbMATH DE number 3923028
• Evaluation of the limits of maximal means
• scientific article; zbMATH DE number 2090702
• scientific article; zbMATH DE number 3214950

Cited in

(11)

• On computing majority by comparisons
• Finding the n-th largest element
• Finding extrema with unary predicates
• Transforming comparison model lower bounds to the parallel-random-access-machine
• scientific article; zbMATH DE number 403951 (Why is no real title available?)
• Finding the maximum with linear error probabilities: a sequential analysis approach
• Estimating the maximum
• The recursive structure of some ordering problems
• Parallel comparison merging of many-ordered lists
• Parallel comparison algorithms for approximation problems
• Parallel selection

This page was built for publication: Finding an Approximate Maximum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833631)