Optimal search algorithm for a minimum of a discrete periodic bimodal function

DOI10.1016/0020-0190(88)90115-9zbMath0662.68060OpenAlexW2040046436MaRDI QIDQ1114409

Boris S. Veroy

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90115-9

zbMATH Keywords

partition analysisoptimal algorithmsearchcommunication networkinformation-based complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Applications of design theory to circuits and networks (94C30)

Cites Work

• Distributed packet switching queueing network design
• Average complexity of divide-and-conquer algorithms
• An optimal algorithm for search of extrema of a bimodal function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal search algorithm for a minimum of a discrete periodic bimodal function