Optimal solutions for the temporal precedence problem

DOI10.1007/s00453-002-0935-zzbMath1051.68137OpenAlexW2136838521MaRDI QIDQ1849750

Athanasios K. Tsakalidis, G. S. Brodal, Kostas Tsichlas, Spyros Sioutas, Christos Makris

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0935-z

zbMATH Keywords

AlgorithmsComputational complexity.Dynamic data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (4)

Sequential and parallel algorithms for the NCA problem on pure pointer machines ⋮ Biased predecessor search ⋮ Some Results for Elementary Operations ⋮ A History of Distribution-Sensitive Data Structures

This page was built for publication: Optimal solutions for the temporal precedence problem