Skip to main content
Log in

A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In this paper we propose an optimal solution to the Temporal Precedence problem—i.e., the problem of managing the dynamic insertion of elements in a collection and the ability to determine, given two elements, which one has been inserted first. The problem is studied on pure pointer machines, i.e., pointer machines with no arithmetic capabilities. We provide an optimal solution (i.e., O(lg lg n) worst case time per operation, if n is the number of insertions) for this problem that is considerably simpler than the solutions previously presented in the literature. We also show how the solution can be improved to allow worst case O(1) insertions and linear space complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Enrico Pontelli or Desh Ranjan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pontelli, E., Ranjan, D. A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines. Theory Comput Systems 38, 115–130 (2005). https://doi.org/10.1007/s00224-004-1118-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1118-x

Keywords

Navigation