Unit-time predecessor queries on massive data sets

DOI10.1007/978-3-642-17517-6_14MaRDI QIDQ3060728zbMATH OpenOpenAlexFDO

Authors Andrej Brodnik, John Iacono

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_14

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Algorithms – ESA 2005
• Time-space trade-offs for predecessor search
• Predecessor queries in dynamic integer sets
• An algorithm for finding predecessors in integer sets

Cited in

(4)

• Range selection and predecessor queries in data aware space and time
• scientific article; zbMATH DE number 1848393 (Why is no real title available?)
• Predecessor queries in dynamic integer sets
• Algorithms – ESA 2005

This page was built for publication: Unit-time predecessor queries on massive data sets

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