Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
It is a common wisdom that servers should better store the one-way hash of their clients’ passwords, rather than storing the… Expand
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $kn'-l$ edges, $0 ≤l < 2k$. $G… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 8
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • O. Kullmann
  • Electron. Colloquium Comput. Complex.
  • 1999
  • Corpus ID: 38047896
We investigate a hierarchy Gk (U; S) of classes of conjunctive normal forms, recognizable and SAT-decidable in polynomial time… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Many important macroscopic properties of materials depend upon the number of microscopic degrees of freedom. The task of counting… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Classes of machines using very limited amounts of nondeterminism are studied. The $P = ?NP$ question is related to questions… Expand
Is this relevant?
1992
1992
Generalized quantifiers in the realm of finite structures are studied and combined with an infinitary logic L/sub infinity omega… Expand
Is this relevant?
1989
1989
As an alternative to logic-based query languages for recursive queries, we are investigating a graphical query language called G… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Asymptotically Ught tune-space trade-offs for pebblmg three d~fferent classes of directed aeychc graphs are derived Let N be the… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1981
Highly Cited
1981
In this paper, the red-blue pebble game is proposed to model the input-output complexity of algorithms. Using the pebble game… Expand
  • figure 2-1
  • figure 5-2
  • figure 5-1
Is this relevant?
1978
1978
  • R. Reischuk
  • 19th Annual Symposium on Foundations of Computer…
  • 1978
  • Corpus ID: 8673404
Every family of graphs Gn with n nodes and bounded in-degree can be pebbled with o(n) pebbles in time o(n 1+c) for all c≫0. There… Expand
Is this relevant?