Optimal solutions for the temporal precedence problem

DOI10.1007/S00453-002-0935-ZMaRDI QIDQ1849750zbMATH OpenOpenAlexFDO

Authors Athanasios K. Tsakalidis, Christos Makris, Spyros Sioutas, Kostas Tsichlas, Gerth Stølting Brodal

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)

Recommendations

• The temporal precedence problem
• scientific article; zbMATH DE number 2086234
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• Efficient algorithms for the temporal precedence problem
• An algorithm for finding predecessors in integer sets

Cited in

(7)

• The temporal precedence problem
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• A history of distribution-sensitive data structures
• Efficient algorithms for the temporal precedence problem
• Some Results for Elementary Operations
• scientific article; zbMATH DE number 1226310 (Why is no real title available?)
• Sequential and parallel algorithms for the NCA problem on pure pointer machines

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

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