Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

1993/05/01 by Omer Berkman, O. Berkman, Baruch Schieber +3 · 87 citations
Computer Science · Mathematics · #Algorithm #Algorithms and Data Compression #Artificial intelligence #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Logarithm #Mathematical analysis #Mathematics #k-nearest neighbors algorithm

paper · doi:10.1006/jagm.1993.1018

published in Journal of Algorithms 14(3), 344-370 (Elsevier BV)

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

Cited by

• Communication Efficient BSP Algorithm for All Nearest Smaller Values Problem
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
• All nearest smaller values on the hypercube
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Finding patterns and periods in Cartesian tree matching
• All nearest smaller values [wikipedia]
• Cartesian tree [wikipedia]