Scanning and traversing: Maintaining data for traversals in a memory hierarchy

DOI10.1007/3-540-45749-6_16MaRDI QIDQ4411353zbMATH OpenFDO

Authors Erik D. Demaine, Martin Farach-Colton, Michael A. Bender, Richard Cole

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610139.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 4211488
• Scanning multiple sequences via cache memory
• scientific article; zbMATH DE number 4051018
• Maintaining dictionaries in a hierarchical memory
• scientific article; zbMATH DE number 4033049
• scientific article; zbMATH DE number 1445387
• Memory management: An abstract formulation of incremental tracing
• Maintaining range trees in secondary memory. Part I: Partitions

Cited in

(6)

• Scanning multiple sequences via cache memory
• Finding longest increasing and common subsequences in streaming data
• Optimal hashing in external memory
• Packing a knapsack of unknown capacity
• Online list labeling: breaking the ^2n barrier
• Minimal on-line labelling

This page was built for publication: Scanning and traversing: Maintaining data for traversals in a memory hierarchy

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