Uniquely Represented Data Structures for Computational Geometry

DOI10.1007/978-3-540-69903-3_4zbMATH Open1155.68546OpenAlexW1572568862MaRDI QIDQ3512445FDOQ3512445

Authors: Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska Williams 

Publication date: 15 July 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_4

Recommendations

• Anti-persistence
• scientific article; zbMATH DE number 1979502
• B-Treaps: A Uniquely Represented Alternative to B-Trees
• Characterizing history independent data structures
• Lower and upper bounds on obtaining history independence

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• Near-optimal quantum algorithms for string problems
• Succinct and Implicit Data Structures for Computational Geometry

This page was built for publication: Uniquely Represented Data Structures for Computational Geometry

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