scientific article; zbMATH DE number 2185599

MaRDI QIDQ3024760zbMATH OpenFDO

Authors Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick

Publication date 4 July 2005

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1857505
• Fast dynamic arrays
• Bootstrapping one-sided flexible arrays
• scientific article; zbMATH DE number 1830754
• scientific article; zbMATH DE number 140460

Cited in

(15)

• Using time stamps for storing and addressing extendible arrays
• Revisiting priority queues for image analysis
• In-place initializable arrays
• Space efficient linear time algorithms for BFS, DFS and applications
• Decision procedures for extensions of the theory of arrays
• Succinct dynamic cardinal trees
• Improved space efficient algorithms for BFS, DFS and applications
• Succinct dynamic cardinal trees with constant time operations for small alphabet
• scientific article; zbMATH DE number 1857505 (Why is no real title available?)
• Fast dynamic arrays
• On-the-fly array initialization in less space
• Space-efficient construction of Lempel-Ziv compressed text indexes
• A practical alphabet-partitioning rank/select data structure
• Optimal resizable arrays
• Succinct data structures for searchable partial sums with optimal worst-case performance

This page was built for publication:

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