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

algorithmbasic data structuredeletionsdynamic tree structureinsertionslinked lists

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(16)

• Making data structures persistent
• Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
• An optimal data structure to handle dynamic environments in non-deterministic computations
• Fully persistent B-trees
• Towards a real time algorithm for parameterized longest common prefix computation
• Mondshein sequences (a.k.a. (2,1)-orders)
• Efficient algorithms for the temporal precedence problem
• Some Results for Elementary Operations
• 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)
• Fully persistent B-trees
• A simple dynamization of trapezoidal point location in planar subdivisions
• On suffix extensions in suffix trees
• Faster and simpler online computation of string net frequency
• Dynamic fractional cascading

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)