On (Dynamic) Range Minimum Queries in External Memory
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 37-48
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Range Extremum Queries2012
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static ArraysSIAM Journal on Computing, 2011
- Parallel external memory graph algorithms2010
- Space Efficient String Mining under Frequency Constraints2008
- Fundamental parallel algorithms for private-cache chip multiprocessors2008
- Linear work suffix array constructionJournal of the ACM, 2006
- A General Technique for Managing Strings in Comparison-Driven Data StructuresLecture Notes in Computer Science, 2004
- The Buffer Tree: A Technique for Designing Batched External Data StructuresAlgorithmica, 2003
- I/O-efficient topological sorting of planar DAGs2003
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988