Competitive data-structure dynamization

DOI10.1145/3672614MaRDI QIDQ7023536zbMATH OpenFDO

Authors Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi

Publication date 21 February 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://escholarship.org/uc/item/12d079zf

zbMATH Keywords

online algorithmscompetitive analysiscompactionlog-structured merge-treedata-structure dynamization

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 3722116 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2079384 (Why is no real title available?)
• scientific article; zbMATH DE number 1754589 (Why is no real title available?)
• scientific article; zbMATH DE number 1792106 (Why is no real title available?)
• scientific article; zbMATH DE number 1445291 (Why is no real title available?)
• A new path from Splay to dynamic optimality
• Algorithms and data structures for external memory
• Application-Controlled Paging for a Shared Cache
• Approximating extent measures of points.
• Automata, Languages and Programming
• Cache-adaptive algorithms
• Competitive analysis via regularization
• Competitive data-structure dynamization
• Decomposable searching problems
• Decomposable searching problems I. Static-to-dynamic transformation
• Deterministic sampling and range counting in geometric data streams
• Dynamic TCP acknowledgment and other stories about e/(e-1)
• Dynamic indexability and the optimality of B-trees
• I/O-efficient dynamic planar point location
• Lower bounds on the efficiency of transforming static data structures into dynamic structures
• On coresets for k-means and k-median clustering
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• The log-structured merge-tree (LSM-tree)
• Towards in-place geometric algorithms and data structures
• Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering

This page was built for publication: Competitive data-structure dynamization

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