Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,371,603 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.
2014
2014
A Unified Concept for the Graph Representation of Constraints in Mechanisms
A. Müller
,
O. Shai
2014
Corpus ID: 56469630
There are two established approaches to represent constraints: the body-bar (BB) and the bar-joint (BJ) graph that can be used in…
Expand
2013
2013
Just a Pebble Game
Siu Man Chan
IEEE Conference on Computational Complexity
2013
Corpus ID: 14965654
The two-player pebble game of Dymond-Tompa is identified as a barrier for existing techniques to save space or to speed up…
Expand
2007
2007
A DISTRIBUTED APPROACH TO N-PUZZLE SOLVING
A. Drogoul
,
C. Dubreuil
2007
Corpus ID: 13540564
We present in this paper a distributed approach for solving the N-puzzle. This approach is based on the decomposition of a…
Expand
Review
2006
Review
2006
A Pebble Game for Internet-Based Computing
G. Malewicz
,
A. Rosenberg
Essays in Memory of Shimon Even
2006
Corpus ID: 206595483
Advances in technology have rendered the Internet a viable medium for employing multiple independent computers collaboratively in…
Expand
2005
2005
The axiom of elementary sets on the edge of Peircean expressibility
A. Formisano
,
E. Omodeo
,
A. Policriti
Journal of Symbolic Logic (JSL)
2005
Corpus ID: 5912453
Abstract Being able to state the principles which lie deepest in the foundations of mathematics by sentences in three variables…
Expand
1998
1998
The Pebble Game
U. Schöning
,
R. Pruim
1998
Corpus ID: 115800284
The Pebble game is a model for successive execution of a computation with the use of an auxiliary storage devise. The game can be…
Expand
1986
1986
A new pebble game that characterizes parallel complexity classes
H. Venkateswaran
,
M. Tompa
27th Annual Symposium on Foundations of Computer…
1986
Corpus ID: 12896045
A new two-person pebble game that models parallel computations is defined. This game extends the two-person pebble game defined…
Expand
1984
1984
Some combinatorial game problems require Ω(nk) time
A. Adachi
,
S. Iwata
,
T. Kasai
JACM
1984
Corpus ID: 18634734
Dans cet article, on considere quelques problemes combinatoires et on etablit des problemes «naturels» dans P, pour la…
Expand
1983
1983
Bandwidth and pebbling
A. Rosenberg
,
I. H. Sudborough
Computing
1983
Corpus ID: 1457500
The main results of this paper establish relationships between the bandwidth of a graphG — which is the minimum over all layouts…
Expand
1981
1981
Pebbling with an Auxiliary Pushdown
N. Pippenger
Journal of computer and system sciences (Print)
1981
Corpus ID: 45378999
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