Efficient algorithms for the temporal precedence problem

DOI10.1016/S0020-0190(98)00141-0zbMath1339.68123OpenAlexW1988747038MaRDI QIDQ293412

Desh Ranjan, Enrico Pontelli, Gopal Gupta

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001410?np=y

zbMATH Keywords

complexitydynamic data structurespointer machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Efficient algorithms for the temporal precedence problem

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the temporal precedence problem
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Dynamic fractional cascading
• Maintaining order in a generalized linked list
• The temporal precedence problem
• Lower bounds for the union-find and the split-find problem on pointer machines
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• Storage Modification Machines
• Design and implementation of an efficient priority queue
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching