scientific article; zbMATH DE number 1947389

MaRDI QIDQ4411355zbMATH OpenFDO

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

Publication date 8 July 2003

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• On List Update with Locality of Reference
• Optimal Space Distributed Order-Preserving Lists
• scientific article; zbMATH DE number 1002203
• On list update and work function algorithms.
• On list update with locality of reference

Cited in

(32)

• Orthogonal range searching in linear and almost-linear space
• Recognizing weakly simple polygons
• A faster implementation of online RLBWT and its application to LZ77 parsing
• Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
• Edge-orders
• Fully persistent B-trees
• Compressing dictionary matching index via sparsification technique
• Canonical density control
• A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
• Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
• Mondshein sequences (a.k.a. (2,1)-orders)
• Short Transitive Signatures for Directed Trees
• Faster lightweight Lempel-Ziv parsing
• Time-optimal top-k document retrieval
• Tight lower bounds for the online labeling problem
• A dynamic topological sort algorithm for directed acyclic graphs
• A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
• Some Results for Elementary Operations
• Optimal Space Distributed Order-Preserving Lists
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• Dynamic Trees with Almost-Optimal Access Cost
• Dynamic Dominators and Low-High Orders in DAGs
• The online house numbering problem: min-max online list labeling
• Fully persistent B-trees
• New bounds for the controller problem
• Good \(r\)-divisions imply optimal amortized decremental biconnectivity
• Online list labeling: breaking the ^2n barrier
• On suffix extensions in suffix trees
• Faster and simpler online computation of string net frequency
• Online sorting and online TSP: Randomized, stochastic, and high-dimensional
• Fast and simple sorting using partial information
• Computing runs on a general alphabet

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