## Stem pebbl$ (all stems)

### 36 papers:

- DLT-J-2013-KutribMW14a #automaton #finite #multi
- Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.
- OSDI-2014-SpahnBLBGK #abstraction #data transformation #fine-grained #named #operating system
- Pebbles: Fine-Grained Data Management Abstractions for Modern Operating Systems (RS, JB, ML, SB, RG, GEK), pp. 113–129.
- LICS-CSL-2014-BolligGMZ #automaton #logic
- Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.
- DLT-2013-KutribMW #automaton #finite #multi
- One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
- CIAA-2012-GastinM #automaton
- Adding Pebbles to Weighted Automata (PG, BM), pp. 28–51.
- ICALP-v2-2012-DawarH #algebra #game studies
- Pebble Games with Algebraic Rules (AD, BH), pp. 251–262.
- CSL-2012-GroheO #equation #game studies #linear
- Pebble Games and Linear Equations (MG, MO), pp. 289–304.
- LICS-2012-Berkholz #bound #game studies #testing
- Lower Bounds for Existential Pebble Games and k-Consistency Tests (CB), pp. 25–34.
- PPoPP-2011-WillcockHEL #data-driven #fine-grained #parallel #programming
- Active pebbles: a programming model for highly parallel fine-grained data-driven computations (JW, TH, NGE, AL), pp. 305–306.
- ICALP-v2-2010-BolligGMZ #automaton #logic #transitive
- Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
- LICS-2009-Tan #automaton #graph #infinity #reachability
- Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.
- PODS-2007-EngelfrietHS #transducer #xml
- XML transformation by tree-walking transducers with invisible pebbles (JE, HJH, BS), pp. 63–72.
- ICALP-v1-2006-BojanczykSSS #automaton #power of
- Expressive Power of Pebble Automata (MB, MS, TS, LS), pp. 157–168.
- CSL-2005-ChenD #algorithm #consistency #constraints #game studies #quantifier
- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction (HC, VD), pp. 232–247.
- SAT-2005-GalesiT #game studies
- Resolution and Pebbling Games (NG, NT), pp. 76–90.
- ICALP-2003-MatiasP #performance #traversal
- Efficient Pebbling for List Traversal Synopses (YM, EP), pp. 918–928.
- CSL-2003-KolaitisP #complexity #game studies #on the
- On the Complexity of Existential Pebble Games (PGK, JP), pp. 314–329.
- CSL-2003-Krzeszczakowski #game studies
- Pebble Games on Trees (LK), pp. 359–371.
- STOC-1998-BenderFRSV #graph #power of
- The Power of a Pebble: Exploring and Mapping Directed Graphs (MAB, AF, DR, AS, SPV), pp. 269–278.
- HCI-SEC-1997-WilliamsFSTE #education #learning #named #student
- PEBBLES: Providing Education by Bringing Learning Environments to Students (LAW, DIF, GS, JT, RE), pp. 115–118.
- ICALP-1994-AumannBF #bound #cost analysis #fault #on the
- On the Cost of Recomputing: Tight Bounds on Pebbling with Faults (YA, JBI, UF), pp. 47–58.
- ICALP-1994-GlobermanH #automaton #complexity #logic #multi
- Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.
- LICS-1992-VaananenK #finite #game studies #quantifier
- Generalized Quantifiers and Pebble Games on Finite Structures (PGK, JAV), pp. 348–359.
- PODS-1989-LakshmananM #datalog #game studies #induction #power of
- Inductive Pebble Games and the Expressive Power of Datalog (VSL, AOM), pp. 301–310.
- STOC-1988-KalyanasundaramS #on the #power of
- On the Power of White Pebbles (Extended Abstract) (BK, GS), pp. 258–266.
- STOC-1985-Wilber
- White Pebbles Help (REW), pp. 103–112.
- STOC-1984-Kozen #equation #logic
- Pebblings, Edgings, and Equational Logic (DK), pp. 428–435.
- ICALP-1982-Pippenger #roadmap
- Advances in Pebbling (Preliminary Version) (NP), pp. 407–417.
- STOC-1981-HongK #complexity #game studies
- I/O Complexity: The Red-Blue Pebble Game (JWH, HTK), pp. 326–333.
- STOC-1980-CarlsonS #graph
- Graph Pebbling with Many Free Pebbles can be Difficult (DAC, JES), pp. 326–332.
- STOC-1980-Pippenger #comparative
- Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) (NP), pp. 351–356.
- ICALP-1980-Mehlhorn
- Pebbling Mountain Ranges and its Application of DCFL-Recognition (KM), pp. 422–435.
- STOC-1979-GilbertLT #polynomial #problem
- The Pebbling Problem is Complete in Polynomial Space (JRG, TL, RET), pp. 237–248.
- ICALP-1979-Heide #comparison #game studies #graph
- A Comparison Between Two Variations of a Pebble Game on Graphs (FMadH), pp. 411–421.
- ICALP-1978-Lingas #game studies #problem
- A PSPACE Complete Problem Related to a Pebble Game (AL), pp. 300–321.
- ICALP-1977-PaulT #game studies #trade-off
- Time-Space Trade-Offs in a Pebble Game (WJP, RET), pp. 365–369.