Efficient algorithms for the temporal precedence problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3146798 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Design and implementation of an efficient priority queue
- Dynamic fractional cascading
- Efficient algorithms for the temporal precedence problem
- Lower bounds for the union-find and the split-find problem on pointer machines
- Maintaining order in a generalized linked list
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
- Storage Modification Machines
- The temporal precedence problem
Cited in
(5)- The temporal precedence problem
- scientific article; zbMATH DE number 1226310 (Why is no real title available?)
- 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
This page was built for publication: Efficient algorithms for the temporal precedence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293412)