Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
188 | Arnold L. Rosenberg, Ivan Hal Sudborough |
Bandwidth and pebbling. |
Computing |
1983 |
DBLP DOI BibTeX RDF |
graph pebbling, Bandwidth |
150 | Joost Engelfriet, Sebastian Maneth |
A comparison of pebble tree transducers with macro tree transducers. |
Acta Informatica |
2003 |
DBLP DOI BibTeX RDF |
|
121 | Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki |
Some Properties of One-Pebble Turing Machines with Sublogarithmic Space. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
102 | Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano |
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Pebble motion, Tree, Permutations, Feasibility, Robot motion planning |
101 | Jean-Claude Raoult, Ravi Sethi |
The Global Storage Needs of a Subcomputation. |
POPL |
1984 |
DBLP DOI BibTeX RDF |
|
93 | Kevin Iga, Randall Maddox |
Pebble Sets in Convex Polygons. |
Discret. Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
93 | Phokion G. Kolaitis, Jonathan Panttaja |
On the Complexity of Existential Pebble Games. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
88 | Andrzej Lingas |
A PSPACE Complete Problem Related to a Pebble Game. |
ICALP |
1978 |
DBLP DOI BibTeX RDF |
dag, completeness in polynomial space, computational complexity, PSPACE, pebble game, AND/OR graph |
78 | Kostas Magoutis, José Carlos Brustoloni, Eran Gabber, Wee Teck Ng, Abraham Silberschatz |
Building appliances out of components using Pebble. |
ACM SIGOPS European Workshop |
2000 |
DBLP DOI BibTeX RDF |
|
73 | Takumi Kasai, Akeo Adachi, Shigeki Iwata |
Classes of pebble games and complete problems. |
ACM Annual Conference (2) |
1978 |
DBLP DOI BibTeX RDF |
Exponential time, Log-space, Two-person game, Winning strategy, Polynomial time, Turing machine, NP, Pebble game, Polynomial space |
72 | Steve McKeever, Wayne Luk |
Provably-correct hardware compilation tools based on pass separation techniques. |
Formal Aspects Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
72 | Christian Scheideler |
How to spread adversarial nodes?: rotate! |
STOC |
2005 |
DBLP DOI BibTeX RDF |
join-leave attacks, random mixing, proactive security |
67 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML transformation by tree-walking transducers with invisible pebbles. |
PODS |
2007 |
DBLP DOI BibTeX RDF |
tree transducer, XML, pebble |
64 | Tony Tan |
On Pebble Automata for Data Languages with Decidable Emptiness Problem. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
64 | Wayne Luk, Steve McKeever |
Pebble: A Language for Parametrised and Reconfigurable Hardware Design. |
FPL |
1998 |
DBLP DOI BibTeX RDF |
|
59 | Audrey Lee, Ileana Streinu, Louis Theran |
Analyzing rigidity with pebble games. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
computational geometry, rigidity, sparse graph, pebble game |
58 | Tim Todman, Wayne Luk |
Combining Imperative and Declarative Hardware Descriptions. |
HICSS |
2003 |
DBLP DOI BibTeX RDF |
|
58 | Steve McKeever, Wayne Luk |
Towards Provably-Correct Hardware Compilation Tools Based on Pass Separation Techniques. |
CHARME |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Noa Globerman, David Harel |
Complexity Results for Multi-Pebble Automata and their Logics. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
49 | Bala Kalyanasundaram, Georg Schnitger |
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
43 | Anvesh Komuravelli, Matús Mihalák |
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. |
SSS |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Steve McKeever, Wayne Luk, Arran Derbyshire |
Towards Verifying Parametrised Hardware Libraries with Relative Placement Information. |
HICSS |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Joost Engelfriet, Sebastian Maneth |
Two-Way Finite State Transducers with Nested Pebbles. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Rahul Santhanam |
On Separators, Segregators and Time versus Space. |
CCC |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Ali Sattari Javid, Lars Doyle, David Mould |
Irregular Pebble Mosaics with Sub-Pebble Detail. |
Expressive |
2019 |
DBLP DOI BibTeX RDF |
|
41 | Erik D. Demaine, Quanquan C. Liu |
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
41 | Erik D. Demaine, Quanquan C. Liu |
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. |
WADS |
2017 |
DBLP DOI BibTeX RDF |
|
41 | Lorand Muzamel |
Pebble macro tree transducers with strong pebble handling |
|
2011 |
RDF |
|
41 | Zoltán Fülöp 0001, Lorand Muzamel |
Pebble Macro Tree Transducers with Strong Pebble Handling. |
Fundam. Informaticae |
2008 |
DBLP BibTeX RDF |
|
38 | Volker Weber |
On the Complexity of Branching-Time Logics. |
CSL |
2009 |
DBLP DOI BibTeX RDF |
complexity of satisfiability, pebble automata, alternating tree automata, forgettable past, CTL, branching-time logic |
38 | Albert Atserias |
On sufficient conditions for unsatisfiability of random formulas. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
Random CNF formulas, propositional resolution, satisfiability, datalog, phase transitions, pebble games |
38 | Robert Pollack |
Dependently Typed Records in Type Theory. |
Formal Aspects Comput. |
2002 |
DBLP DOI BibTeX RDF |
Inductive-recursive, Manifest types, Signature, Module, Sharing, Dependent types, Pebble |
35 | Wolfgang Reisig |
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed. |
Pillars of Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
Expressive Power of Pebble Automata. |
ICALP (1) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Grzegorz Malewicz, Arnold L. Rosenberg |
A Pebble Game for Internet-Based Computing. |
Essays in Memory of Shimon Even |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Hubie Chen, Víctor Dalmau |
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano |
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
35 | V. S. Lakshmanan 0001, Alberto O. Mendelzon |
Inductive Pebble Games and the Expressive Power of Datalog. |
PODS |
1989 |
DBLP DOI BibTeX RDF |
Datalog |
35 | Friedhelm Meyer auf der Heide |
A Comparison Between Two Variations of a Pebble Game on Graphs. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
35 | Wolfgang J. Paul, Robert Endre Tarjan |
Time-Space Trade-Offs in a Pebble Game. |
ICALP |
1977 |
DBLP DOI BibTeX RDF |
|
29 | Alon Shalita, Uri Zwick |
Efficient algorithms for the 2-gathering problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Albert Atserias, Mark Weyer |
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. |
CSL |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Viliam Geffert, Dana Pardubská |
Factoring and Testing Primes in Small Space. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
sublogarithmic space, computational complexity, factoring, prime numbers |
29 | Paola Flocchini, David Ilcinkas, Nicola Santoro |
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
dangerous graphs, distributed computing, mobile agents, autonomous robots, graph exploration |
29 | Tristan Roussillon, Laure Tougne, Isabelle Sivignon |
Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. |
ICIAP |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Evan Goris, Maarten Marx |
Looping Caterpillars. |
LICS |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Albert Atserias |
Unsatisfiable Random Formulas Are Hard to Certify. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Richard Královic |
Time and Space Complexity of Reversible Pebbling. |
SOFSEM |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Tova Milo, Dan Suciu, Victor Vianu |
Typechecking for XML Transformers. |
PODS |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Peter Damaschke |
A Chip Search Problem on Binary Numbers. |
LATIN |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Ming Li 0001, Paul M. B. Vitányi |
Reversible Simulation of Irreversible Computation. |
CCC |
1996 |
DBLP DOI BibTeX RDF |
Irreversible computation, Computational energy dissipation, Reversible simulation, Storage space versus Energy Tradeoffs, Reversible computation |
29 | Peter Ruzicka, Juraj Waczulík |
On Time-Space Trade-Offs in Dynamic Graph Pebbling. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Maria M. Klawe |
A Tight Bound for Black and White Pebbles on the Pyramid |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Jakob Nordström |
On the Relative Strength of Pebbling and Resolution. |
CCC |
2010 |
DBLP DOI BibTeX RDF |
pebbling formula, resolution, space, trade-off, proof complexity, pebble games |
24 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam |
Minimizing movement. |
ACM Trans. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
pebble placement, graphs, Motion planning, Euclidean plane |
24 | Yung-Wei Kao, Ching-Tsorng Tsai, Wei-Hsiang Hung, Shyan-Ming Yuan, Hsin-Ta Chiao |
A cross-platform P2P based blog system. |
MoMM |
2009 |
DBLP DOI BibTeX RDF |
P2P, blog, Pebble |
24 | Jakob Nordström |
Narrow proofs may be spacious: separating space and width in resolution. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
pebbling contradiction, lower bound, resolution, space, separation, proof complexity, width, pebble game |
24 | David A. Carlson |
Time-Space Tradeoffs on Back-to-Back FFT Algorithms. |
IEEE Trans. Computers |
1983 |
DBLP DOI BibTeX RDF |
straight-line algorithm, time-space tradeoff, polynomial multiplication, Pebble game, permutation graph |
20 | Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli 0001, Bernhard Nebel |
An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees. |
J. Artif. Intell. Res. |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Lisa Jaser, Jacobo Torán |
Pebble Games and Algebraic Proof Systems Meet Again. |
Electron. Colloquium Comput. Complex. |
2024 |
DBLP BibTeX RDF |
|
20 | Roshan Kenia, Jihane Mendil, Ahmed Jasim, Muthanna Al-Dahhan, Zhaozheng Yin |
Robust TRISO-fueled Pebble Identification by Digit Recognition. |
WACV |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli 0001, Bernhard Nebel |
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal 0001 |
Pebble guided Treasure Hunt in Plane. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals |
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Arend-Jan Quist, Alfons Laarman |
Optimizing Quantum Space Using Spooky Pebble Games. |
RC |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble minimization: the last theorems. |
FoSSaCS |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal 0001 |
Pebble Guided Treasure Hunt in Plane. |
NETYS |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit |
Pebble guided optimal treasure hunt in anonymous graphs. |
Theor. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Eugene Fiorini, Griffin Johnston, Max Lind, Andrew Woldar, Tony W. H. Wong |
Cycles and Girth in Pebble Assignment Graphs. |
Graphs Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Max Lind, Eugene Fiorini, Andrew Woldar |
On Properties of Pebble Assignment Graphs. |
Graphs Comb. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Leisheng Chen, Jiahao Zhao, Yuejin Yuan, Jaeyoung Lee |
Numerical Study on the Thermal Field and Heat Transfer Characteristics of a Hexagonal-Close-Packed Pebble Bed. |
Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble minimization: the last theorems. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Liang He, Zherong Pan, Kiril Solovey, Biao Jia, Dinesh Manocha |
Multi-Robot Path Planning Using Medial-Axis-Based Pebble-Graph Embedding. |
IROS |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Yoàv Montacute, Nihil Shah |
The Pebble-Relation Comonad in Finite Model Theory. |
LICS |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Niels Gleinig, Torsten Hoefler |
The Red-Blue Pebble Game on Trees and DAGs with Large Input. |
SIROCCO |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jacobo Torán, Florian Wörz |
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. |
Comput. Complex. |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma |
Pebble exchange group of graphs. |
Eur. J. Comb. |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit |
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
20 | Kimin Lee, Laura M. Smith, Pieter Abbeel |
PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
20 | Niels Kornerup, Jonathan Sadun, David Soloveichik |
The Spooky Pebble Game. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
20 | Yoàv Montacute, Nihil Shah |
The Pebble-Relation Comonad in Finite Model Theory. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble transducers with unary output. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble Transducers with Unary Output. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Maxime Le Chapelain |
@I am a Pebble. |
SIGGRAPH Computer Animation Festival |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit |
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. |
SIROCCO |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Kimin Lee, Laura M. Smith, Pieter Abbeel |
PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training. |
ICML |
2021 |
DBLP BibTeX RDF |
|
20 | Antoine Soloy, Imen Turki, Matthieu Fournier, Stéphane Costa, Bastien Peuziat, Nicolas Lecoq |
A Deep Learning-Based Method for Quantifying and Mapping the Grain Size on Pebble Beaches. |
Remote. Sens. |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Miroslav Kulich, Tomás Novák, Libor Preucil |
Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
20 | Pál András Papp, Roger Wattenhofer |
On the Hardness of Red-Blue Pebble Games. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
20 | Toby Walsh |
A Pebble in the AI Race. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
20 | |
Pebble Minimization of Polyregular Functions. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
20 | Liam Jordon, Philippe Moser |
Pebble-Depth. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
20 | Bogdan Pavel Deac, Adrian Colesa |
Following the Pebble Trail: Extending Return-Oriented Programming to RISC-V. |
CCSW |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Nathan Lhote |
Pebble Minimization of Polyregular Functions. |
LICS |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Nadia Labai, Tomer Kotek, Magdalena Ortiz 0001, Helmut Veith |
Pebble-Intervals Automata and FO2 with Two Orders. |
LATA |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Xinxin Fan, Qi Chai, Zhefeng Li, Tian Pan 0002 |
Decentralized IoT Data Authorization with Pebble Tracker. |
WF-IoT |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Jacobo Torán, Florian Wörz |
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Pál András Papp, Roger Wattenhofer |
On the Hardness of Red-Blue Pebble Games. |
SPAA |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Haifeng Zhang, Zhaohui Jiang 0001, Zhipeng Chen, Weihua Gui 0001, Yongfang Xie, Chunhua Yang 0001 |
Two-Stage Control of Endpoint Temperature for Pebble Stove Combustion. |
IEEE Access |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Lars Doyle, Forest Anderson, Ehren Choy, David Mould |
Automated pebble mosaic stylization of images. |
Comput. Vis. Media |
2019 |
DBLP DOI BibTeX RDF |
|