Maintaining order in a generalized linked list

DOI10.1007/BF00289142MaRDI QIDQ1052093zbMATH OpenOpenAlexWikidataFDO

Authors 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

algorithmdeletionsinsertionsbasic data structuredynamic tree structurelinked lists

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3557221 (Why is no real title available?)
• A new data structure for representing sorted lists
• An Efficient Method for Storing Ancestor Information in Trees
• Binary Search Trees of Bounded Balance
• On the average number of rebalancing operations in weight-balanced trees

Cited in

(14)

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

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

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