Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Constraint problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph… 
2016
2016
This report presents a proof of space protocol based on pebble games on stacked bipartite graphs. 
2016
2016
Constraint programming and game theory are two active research domains providing a powerful framework for modeling and solving… 
2014
2014
In this chapter, scheduling is defined as the activity that consists in mapping a task graph onto a target platform. The task… 
2010
2010
We show that equivalence in finite-variable infinitary logic with rank operators can be characterised in terms of pebble games… 
2008
2008
In the particular case we have insertions/deletions at the tail of a given set S of $n$ one-dimensional elements, we present a… 
2007
2007
We study the generic rigidity properties of systems of volume constraints. We formally define, in an algebraic geometrical… 
1992
1992
In the syntactic theory of Tesni ere (1959) the structural description of sentences are given as graphs. We discuss how the graph… 
1984
1984
An extension of the pebble game is introduced as a model for analyzing the space and time requirements of LISP programs. The… 
1979
1979
Abstract : We derive asymptotically tight time-space tradeoffs for pebbling three different classes of directed acyclic graphs…