Optimal Algorithms for Running Max and Min Filters on Random Inputs

DOI10.1007/978-3-319-21398-9_40zbMath1466.68083OpenAlexW1197659520MaRDI QIDQ3196410

Hao Yuan, Hongyu Liang, Shengxin Liu

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_40

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Algorithms for Finding Nearest Common Ancestors
• A unifying look at data structures
• Mathematical Complexity of Running Filters on Semi-Groups and Related Problems

This page was built for publication: Optimal Algorithms for Running Max and Min Filters on Random Inputs