Parallel pointer machines

  title={Parallel pointer machines},
  author={Stephen A. Cook and Patrick W. Dymond},
  journal={computational complexity},
The parallel pointer machine is a synchronous collection of finite state transducers, each transducer receiving its inputs via pointers to the other transducers. Each transducer may change its input pointers dynamically by “pointer jumping”. These machines provide a simple example of a parallel model with a time-varying processor inter-connection structure, and are sufficiently powerful to simulate deterministic spaceS(n) within timeO(S(n)). 

From This Paper

Topics from this paper.
12 Citations
5 References
Similar Papers


Publications referenced by this paper.
Showing 1-5 of 5 references

Complexity theory of parallel time and hardware

  • S. A. COOK
  • Information and Computation
  • 1989

DYMOND , On nondeterminism in parallel coraputation

  • W. P.
  • SlAM journal on Computing
  • 1980

Ruzzo , Parallel random access machines with owned global memory and deterministic context - free language recognition , in Automata , Languages , and Programming : 13 th International Colloquium

  • 1979

GOLDSCItLAGER , A universal interconnection pattern for parallel computers

  • M. L.
  • Journal of the ACM

USPENSKII , On the definition of an algorithm , Translations of the A

  • . M . S .

Similar Papers

Loading similar papers…