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

1998/08/01 by Omer Berkman, Yossi Matias, Prabhakar Ragde · 10 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Logarithm #Materials science #Mathematical analysis #Mathematics #Maxima and minima #Optimization and Search Problems #Range (aeronautics) #Upper and lower bounds

paper · doi:10.1006/jagm.1997.0905

published in Journal of Algorithms 28(2), 197-215 (Elsevier BV)

crossref issued 1998/08/01 · crossref published 1998/08/01 · crossref published-print 1998/08/01 · openalex publication_date 1998/08/01 · crossref created 2002/10/07 · crossref deposited 2019/05/07 · openalex created_date 2025/10/10 · crossref indexed 2025/10/12 · openalex updated_date 2026/07/28

Citations

• Scaling and related techniques for geometry problems
• Fast Algorithms for Finding Nearest Common Ancestors
• Intersection Theorems for Systems of Sets
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Parallel Algorithmic Techniques For CombinationalComputation

Cited by

• All nearest smaller values [wikipedia]