Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,380,372 papers from all fields of science
Search
Sign In
Create Free Account
Pebble game
In mathematics and computer science, a pebble game is a type of mathematical game played by moving "pebbles" or "markers" on a directed graph. A…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Computational complexity theory
Computer science
DSPACE
DTIME
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Descriptive complexity of constraint problems
Pengming Wang
2018
Corpus ID: 51888819
Constraint problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph…
Expand
2016
2016
Proof of Space from Stacked Bipartite Graphs
Ling Ren
,
S. Devadas
IACR Cryptology ePrint Archive
2016
Corpus ID: 13353026
This report presents a proof of space protocol based on pebble games on stacked bipartite graphs.
2016
2016
Z-Equilibrium For a CSP Game
Kahina Bouchama
,
M. Radjef
,
L. Sais
International Symposium on Artificial…
2016
Corpus ID: 33433250
Constraint programming and game theory are two active research domains providing a powerful framework for modeling and solving…
Expand
2014
2014
Scheduling for Large-Scale Systems
A. Benoit
,
L. Marchal
,
Y. Robert
,
B. Uçar
,
F. Vivien
Computing Handbook, 3rd ed.
2014
Corpus ID: 6895847
In this chapter, scheduling is defined as the activity that consists in mapping a task graph onto a target platform. The task…
Expand
2010
2010
Pebble Games for Rank Logics
A. Dawar
,
Bjarki Holm
2010
Corpus ID: 27770500
We show that equivalence in finite-variable infinitary logic with rank operators can be characterised in terms of pebble games…
Expand
2008
2008
Finger Indexed Sets: New Approaches
S. Sioutas
arXiv.org
2008
Corpus ID: 5877356
In the particular case we have insertions/deletions at the tail of a given set S of $n$ one-dimensional elements, we present a…
Expand
2007
2007
Combinatorial and Algorithmic Volume Rigidity
I. Streinu
,
Louis Theran
2007
Corpus ID: 18864940
We study the generic rigidity properties of systems of volume constraints. We formally define, in an algebraic geometrical…
Expand
1992
1992
Narrowness, Path-width, and Their Application in Natural Language Processing
Andrr As Kornai
,
Z. Tuza
1992
Corpus ID: 2863901
In the syntactic theory of Tesni ere (1959) the structural description of sentences are given as graphs. We discuss how the graph…
Expand
1984
1984
An extension of the pebble game for lisp-like programs
Frank M. Hawrusik
1984
Corpus ID: 123269880
An extension of the pebble game is introduced as a model for analyzing the space and time requirements of LISP programs. The…
Expand
1979
1979
Upper and lower bounds on time-space tradeoffs in a pebble game
Thomas Lengauer
1979
Corpus ID: 116132285
Abstract : We derive asymptotically tight time-space tradeoffs for pebbling three different classes of directed acyclic graphs…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required