AbstractThe number of pebbles used in the black [black-white] pebble game corresponds to the storage requirement of the deterministic [non-deterministic] evaluation of a straight line program. Suppose a distinguished vertex of a directed acyclic graph can be pebbled with k pebbles in the black-white pebble game. Then it can be pebbled with k′≤1/2k(k−1)+1 pebbles in the black pebble game
We give a new, simplified and detailed account of the correspondence between levels of the Sherali–A...
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A p...
The red-blue pebble game was formulated in the 1980s [14] to model the I/O complexity of algorithms ...
AbstractThe number of pebbles used in the black [black-white] pebble game corresponds to the storage...
AbstractIt is proved that for infinitely many n there is a directed acyclic graph with vertex indegr...
Summary. A certain pebble game on graphs has been studied in various contexts as a model for the tim...
Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the gr...
Graph pebbling is a mathematical game in which pebbles are placed on the vertices of a graph. The ga...
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a pie...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
We study the connection between pebble games and complexity. First, we derive complexity results usi...
A pebble game on graphs is introduced which bears the same relationship to the ordinary pebble game ...
Abstract. We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling gam...
AbstractA pebble game on graphs is introduced which bears the same relationship to the ordinary pebb...
AbstractConsider a configuration of pebbles distributed on the vertices of a connected graph of orde...
We give a new, simplified and detailed account of the correspondence between levels of the Sherali–A...
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A p...
The red-blue pebble game was formulated in the 1980s [14] to model the I/O complexity of algorithms ...
AbstractThe number of pebbles used in the black [black-white] pebble game corresponds to the storage...
AbstractIt is proved that for infinitely many n there is a directed acyclic graph with vertex indegr...
Summary. A certain pebble game on graphs has been studied in various contexts as a model for the tim...
Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the gr...
Graph pebbling is a mathematical game in which pebbles are placed on the vertices of a graph. The ga...
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a pie...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
We study the connection between pebble games and complexity. First, we derive complexity results usi...
A pebble game on graphs is introduced which bears the same relationship to the ordinary pebble game ...
Abstract. We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling gam...
AbstractA pebble game on graphs is introduced which bears the same relationship to the ordinary pebb...
AbstractConsider a configuration of pebbles distributed on the vertices of a connected graph of orde...
We give a new, simplified and detailed account of the correspondence between levels of the Sherali–A...
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A p...
The red-blue pebble game was formulated in the 1980s [14] to model the I/O complexity of algorithms ...
DOI
Add to ORKG