Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

DOI10.1006/JAGM.1997.0905zbMATH Open0919.68072DBLPjournals/jal/BerkmanMR98OpenAlexW2067506436WikidataQ61661659 ScholiaQ61661659MaRDI QIDQ4209262FDOQ4209262

Authors: Omer Berkman, Y. Matias, Prabhakar Ragde 

Publication date: 24 November 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0905

Recommendations

• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
• The complexity of parallel prefix problems on small domains
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Parallel range minima on coarse grained multicomputers

zbMATH Keywords

ANSV problems

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited In (7)

• All Nearest Smallers Made Simple
• Dominance made simple
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs
• Parallel algorithms for separable permutations
• A faster parallel connectivity algorithm on cographs
• Algorithms for testing occurrences of length 4 patterns in permutations

This page was built for publication: Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

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