I/O-efficient range minima queries

DOI10.1007/978-3-319-08404-6_1MaRDI QIDQ3188877zbMATH OpenOpenAlexFDO

Authors Peyman Afshani, Nodari Sitchinava

Publication date 2 September 2014

Published in Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08404-6_1

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On (dynamic) range minimum queries in external memory
• How to answer a small batch of RMQs or LCA queries in practice
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Cache oblivious algorithms for the RMQ and the RMSQ problems
• Efficient dynamic range minimum query

Cited in

(9)

• How to answer a small batch of RMQs or LCA queries in practice
• Range minimum queries in minimal space
• Improved range minimum queries
• On (dynamic) range minimum queries in external memory
• scientific article; zbMATH DE number 1515868 (Why is no real title available?)
• Permuting and batched geometric lower bounds in the I/O model
• Ordered and unordered top-\(K\) range reporting in large data sets
• Algorithms - ESA 2003
• Cache oblivious algorithms for the RMQ and the RMSQ problems

This page was built for publication: I/O-efficient range minima queries

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