The Encoding Complexity of Two Dimensional Range Minimum Data Structures

From MaRDI portal

Revision as of 19:22, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2849313

Jump to:navigation, search

DOI10.1007/978-3-642-40450-4_20zbMath1394.68168OpenAlexW157209844MaRDI QIDQ2849313

Andrej Brodnik, Pooya Davoodi, Gerth Stølting Brodal

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)

Related Items (4)

Space efficient data structures for nearest larger neighbor ⋮ Encoding two-dimensional range top-\(k\) queries ⋮ The effective entropy of next/previous larger/smaller value queries ⋮ Unnamed Item

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2849313&oldid=15785397"