The temporal precedence problem

DOI10.1007/S004530010036zbMATH Open0960.68043OpenAlexW1980333585MaRDI QIDQ1587780FDOQ1587780

Authors: Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré 

Publication date: 3 December 2000

Published in: Algorithmica (Search for Journal in Brave)

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

Recommendations

• Optimal solutions for the temporal precedence problem
• Efficient algorithms for the temporal precedence problem
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• An algorithm for finding predecessors in integer sets
• A note on predecessor searching in the pointer machine model

zbMATH Keywords

temporal precedence problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (6)

• Some Results for Elementary Operations
• A simple optimal solution for the temporal precedence problem on pure pointer machines
• Efficient algorithms for the temporal precedence problem
• Optimal solutions for the temporal precedence problem
• Sequential and parallel algorithms for the NCA problem on pure pointer machines
• An optimal data structure to handle dynamic environments in non-deterministic computations

This page was built for publication: The temporal precedence problem

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