Pebble Games
Pebble Games is a formal logical game in descriptive complexity theory that serves as a method for comparing the expressive power of logical languages by modeling the interaction between two players who place and move pebbles to represent variables in finite structures, distinguished by its use of a bounded number of pebbles to capture resource-constrained definability.
85
Publications
4.7K
Citations
137
Authors
77
Institutions
Publications per year
2017–2026
15
Parents
85
Jiawei Hong, H. T. Kung · 1981 · 450 citations
Pebble game algorithms and sparse graphs
Audrey Lee, Ileana Streinu · Discrete Mathematics · 2007 · 223 citations
1–5 of 85
137
7
h-index
6
h-index
5
h-index
University of North Carolina at Charlotte, United States
4 publications · 701 citations
4
h-index
University of California, Santa Cruz, United States
4 publications · 359 citations
4
h-index
1–5 of 137
77

University of Massachusetts Amherst
Amherst Center, United States
7 h-index
11 publications
544 citations
Stanford University
Stanford, United States
6 h-index
10 publications
743 citations

Smith College
Northampton, United States
5 h-index
5 publications
333 citations
University of California, Santa Cruz
Santa Cruz, United States
4 h-index
4 publications
359 citations
University of Cambridge
Cambridge, United Kingdom
3 h-index
5 publications
105 citations
Bielefeld University
Bielefeld, Germany
3 h-index
3 publications
93 citations

KTH Royal Institute of Technology
Stockholm, Sweden
3 h-index
7 publications
134 citations

University of Toronto
Toronto, Canada
3 h-index
5 publications
191 citations
1–8 of 77
Repository · 4 publications · 71 citations
4
h-index
JACM · 3 publications · 239 citations
3
h-index
Repository · 3 publications · 57 citations
3
h-index
3 publications · 150 citations
3
h-index
3 publications · 95 citations
3
h-index
1–5