Some triply-logarithmic parallel algorithms

Authors:
O. Berkman;J. Jaja;S. Krishnamurthy;R. Thurimella;U. Vishkin
Affiliations:
Maryland Univ., College Park, MD, USA;Maryland Univ., College Park, MD, USA;Maryland Univ., College Park, MD, USA;Maryland Univ., College Park, MD, USA;Maryland Univ., College Park, MD, USA
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 1

A bibliography on computational molecular biology and genetics

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is established that several natural problems have triply logarithmic, or even faster, optimal parallel algorithms. These problems include: merging two sorted lists, where the values are drawn from a large, but restricted, domain on a CREW PRAM; finding all prefix minima, where the values are drawn from a restricted domain; and top-bottom global routing around a rectangle, a well-investigated problem in VLSI routing for which only highly involved serial algorithms were known.