Efficient algorithms for local ranking

DOI10.1016/J.IPL.2012.03.011zbMath1243.68159OpenAlexW2006114606MaRDI QIDQ436589

Chia-Jung Chang, Kun-Mao Chao

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

zbMATH Keywords

data structuresstring matchingfractional cascadingordinal rankingsegment trees

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Data structures (68P05)

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

This page was built for publication: Efficient algorithms for local ranking