The Encoding Complexity of Two Dimensional Range Minimum Data Structures

DOI10.1007/978-3-642-40450-4_20MaRDI QIDQ2849313zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi

Publication date 17 September 2013

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

Full work available at URL https://pure.au.dk/ws/files/72053943/C271.pdf

Mathematics Subject Classification ID

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

Recommendations

• On space efficient two dimensional range minimum data structures
• On space efficient two dimensional range minimum data structures
• Two-Dimensional Range Minimum Queries
• The space complexity of 2-dimensional approximate range counting
• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• Two dimensional range minimum queries and Fibonacci lattices
• Encoding two-dimensional range top-\(k\) queries
• Encoding two-dimensional range top-\(k\) queries

Cited in

(8)

• Encoding two-dimensional range top-\(k\) queries
• The effective entropy of next/previous larger/smaller value queries
• Two Dimensional Range Minimum Queries and Fibonacci Lattices
• Encoding two-dimensional range top-\(k\) queries revisited
• On space efficient two dimensional range minimum data structures
• Space efficient data structures for nearest larger neighbor
• On space efficient two dimensional range minimum data structures
• scientific article; zbMATH DE number 5855012 (Why is no real title available?)

This page was built for publication: The Encoding Complexity of Two Dimensional Range Minimum Data Structures

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