Design and Analysis of a Data Structure for Representing Sorted Lists

DOI10.1137/0209045zbMath0446.68047OpenAlexW2015553450MaRDI QIDQ3891775

Mark R. Brown, Robert Endre Tarjan

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/50f4b86e497b5a0d4f2b576238babf99a5c0f661

zbMATH Keywords

analysis of algorithms2-3 treesdata structure for representing sorted lists

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

A constant update time finger search tree, Visibility between two edges of a simple polygon, Cost-optimal parallel algorithms for constructing B-trees, Multidimensional heaps and complementary range searching, A unified access bound on comparison-based dynamic dictionaries, Amortized Computational Complexity, Making data structures persistent, Proximate point searching, On \(k\)-convex polygons, A new data structure for representing sorted lists, Optimal two-dimensional compressed matching, Local properties of geometric graphs, Algorithms for extracting motifs from biological weighted sequences, Computing inversion pair cardinality through partition-based sorting, Adaptive sorting: an information theoretic perspective, Unnamed Item, Multi-Finger Binary Search Trees, Some Results for Elementary Operations, Optimal layout of edge-weighted forests, Counting inversions adaptively