Distributed algorithms for selection in sets

DOI10.1016/0022-0000(88)90012-8zbMath0659.68066OpenAlexW2061032584MaRDI QIDQ1112607

Greg N. Frederickson

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1390&context=cstech

zbMATH Keywords

ringmeshdistributed algorithmscomplete binary treemessage complexitylinear-time selection algorithmNetwork topologies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

Message lower bounds via efficient network synchronization

Cites Work

• Unnamed Item
• Unnamed Item
• A parallel median algorithm
• Selection and sorting with limited storage
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Finding the median
• Time bounds for selection
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle