scientific article; zbMATH DE number 1947389

zbMath1019.68527MaRDI QIDQ4411355

Jack Zito, Erik D. Demaine, Martín Farach-Colton, Michael A. Bender, Richard John Cole

Publication date: 8 July 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Short Transitive Signatures for Directed Trees, Canonical density control, Tight Lower Bounds for the Online Labeling Problem, Faster Lightweight Lempel-Ziv Parsing, Unnamed Item, Recognizing weakly simple polygons, A dynamic topological sort algorithm for directed acyclic graphs, Computing runs on a general alphabet, Time-Optimal Top-$k$ Document Retrieval, Fully persistent B-trees, 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, New bounds for the controller problem, Edge-orders, A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering, Dynamic Trees with Almost-Optimal Access Cost, On suffix extensions in suffix trees, Faster and enhanced inclusion-minimal cograph completion, A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs, Orthogonal range searching in linear and almost-linear space, Dynamic Dominators and Low-High Orders in DAGs, Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees, Some Results for Elementary Operations, Mondshein Sequences (a.k.a. (2,1)-Orders), The Online House Numbering Problem: Min-Max Online List Labeling, Unnamed Item, Compressing dictionary matching index via sparsification technique