scientific article; zbMATH DE number 2079384

MaRDI QIDQ4471343zbMATH OpenFDO

Authors Gerth Stølting Brodal, Rolf Fagerberg

Publication date 28 July 2004

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The limits of buffering: a tight lower bound for dynamic membership in the external memory model
• The limits of buffering: a tight lower bound for dynamic membership in the external memory model
• scientific article; zbMATH DE number 6297800
• The batched predecessor problem in external memory
• Using hashing to solve the dictionary problem

Cited in

(14)

• Optimality in external memory hashing
• A tradeoff between search and update in dictionaries
• The limits of buffering: a tight lower bound for dynamic membership in the external memory model
• The limits of buffering: a tight lower bound for dynamic membership in the external memory model
• The batched predecessor problem in external memory
• Cross-referenced dictionaries and the limits of write optimization
• Optimal hashing in external memory
• On the I/O complexity of dynamic distinct counting
• Using hashing to solve the dictionary problem
• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
• Competitive data-structure dynamization
• Lazy B-trees
• B-treaps revised: write efficient randomized block search trees with high load
• Buffered partially-persistent external-memory search trees

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 Q4471343)