Finding extrema with unary predicates

DOI10.1007/BF01190157zbMath0801.68078OpenAlexW1990879545MaRDI QIDQ2366238

Yanyan Li

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

lower boundscommunication complexitymaximum findingadversary argumentthreshold predicatesunary predicates

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (2)

An optimal parallel algorithm for digital curve segmentation ⋮ An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search

Cites Work

• Efficient search for rationals
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding extrema with unary predicates