Efficient algorithms for local ranking
From MaRDI portal
Publication:436589
DOI10.1016/j.ipl.2012.03.011zbMath1243.68159MaRDI QIDQ436589
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.011
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for Reporting and Counting Geometric Intersections
- Fast Algorithms for Finding Nearest Common Ancestors
- TIME SERIES FROM THE ORDINAL VIEWPOINT
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Fast Pattern Matching in Strings
- Lowest common ancestors in trees and directed acyclic graphs