Time-space trade-offs in a pebble game

W. J. Paul, R. E. Tarjan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

A certain pebble game on graphs has been studied in various contexts as a model for time and space requirements of computations [1,2,3,7]. In this note it is shown that there exists a family of directed acyclic graphs Gn and constants c1,c2,c3 such that1)Gn has n nodes and each node in Gn has indegree at most 2.2)Each graph Gn can be pebbled with C1√n pebbles in n moves.3)Each graph Gn can also be pebbled with C2√n pebbles, c2 < c1, but every strategy which achieves this has at least 2C3√n moves.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 4th Colloquium
EditorsArto Salomaa, Magnus Steinby
PublisherSpringer Verlag
Pages365-369
Number of pages5
ISBN (Print)9783540083429
DOIs
StatePublished - Jan 1 1977
Externally publishedYes
Event4th International Colloquium on Automata, Languages and Programming, ICALP 1977 - Turku, Finland
Duration: Jul 18 1977Jul 22 1977

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume52 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Colloquium on Automata, Languages and Programming, ICALP 1977
CountryFinland
CityTurku
Period7/18/777/22/77

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Time-space trade-offs in a pebble game'. Together they form a unique fingerprint.

  • Cite this

    Paul, W. J., & Tarjan, R. E. (1977). Time-space trade-offs in a pebble game. In A. Salomaa, & M. Steinby (Eds.), Automata, Languages and Programming - 4th Colloquium (pp. 365-369). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 52 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-08342-1_28