All Nearest Smallers Made Simple

DOI10.1142/S0129626420500085zbMath1490.68297OpenAlexW3043347199MaRDI QIDQ5087073

Sanjeev Saxena

Publication date: 8 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626420500085

zbMATH Keywords

parallel algorithmminimumCRCW modelnearest largersnearest smallersprefix minima

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallelism in Comparison Problems
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

This page was built for publication: All Nearest Smallers Made Simple