Maintaining order in a generalized linked list

DOI10.1007/BF00289142zbMath0515.68038OpenAlexW2788695972WikidataQ56451009 ScholiaQ56451009MaRDI QIDQ1052093

Athanasios K. Tsakalidis

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289142

zbMATH Keywords

algorithmlinked listsdeletionsinsertionsbasic data structuredynamic tree structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20)

Related Items (14)

Efficient algorithms for the temporal precedence problem ⋮ Lower bounds for monotonic list labeling ⋮ A tight lower bound for on-line monotonic list labeling ⋮ Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) ⋮ Making data structures persistent ⋮ Fully persistent B-trees ⋮ Dynamic fractional cascading ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions ⋮ On suffix extensions in suffix trees ⋮ Some Results for Elementary Operations ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Unnamed Item ⋮ An optimal data structure to handle dynamic environments in non-deterministic computations

Cites Work

• Unnamed Item
• On the average number of rebalancing operations in weight-balanced trees
• A new data structure for representing sorted lists
• An Efficient Method for Storing Ancestor Information in Trees
• Binary Search Trees of Bounded Balance

This page was built for publication: Maintaining order in a generalized linked list