All nearest smallers made simple

DOI10.1142/S0129626420500085MaRDI QIDQ5087073zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• scientific article; zbMATH DE number 4074476
• New algorithms for the LCA problem and the binary tree reconstruction problem
• Time-space tradeoffs for all-nearest-larger-neighbors problems
• Communication efficient BSP algorithm for all nearest smaller values problem

Cites work

• scientific article; zbMATH DE number 4074480 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Finding the maximum, merging, and sorting in a parallel computation model
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Parallelism in Comparison Problems
• Routing, merging, and sorting on parallel models of computation
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

Cited in

(3)

• \textsf{tHyENA}: making \textsf{HyENA} even smaller
• New algorithms for the LCA problem and the binary tree reconstruction problem
• Finding Nearest Larger Neighbors

This page was built for publication: All nearest smallers made simple

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