Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
188 | Arnold L. Rosenberg, Ivan Hal Sudborough |
Bandwidth and pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 31(2), pp. 115-139, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
graph pebbling, Bandwidth |
150 | Joost Engelfriet, Sebastian Maneth |
A comparison of pebble tree transducers with macro tree transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 39(9), pp. 613-698, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
121 | Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki |
Some Properties of One-Pebble Turing Machines with Sublogarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 635-644, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(3), pp. 223-245, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, Utah, USA, January 1984, pp. 148-157, 1984, ACM Press, 0-89791-125-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
93 | Kevin Iga, Randall Maddox |
Pebble Sets in Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(4), pp. 680-700, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
93 | Phokion G. Kolaitis, Jonathan Panttaja |
On the Complexity of Existential Pebble Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 314-329, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
88 | Andrzej Lingas |
A PSPACE Complete Problem Related to a Pebble Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings, pp. 300-321, 1978, Springer, 3-540-08860-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGOPS European Workshop ![In: Proceedings of the 9th ACM SIGOPS European Workshop, Kolding, Denmark, September 17-20, 2000, pp. 211-216, 2000, ACM. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
73 | Takumi Kasai, Akeo Adachi, Shigeki Iwata |
Classes of pebble games and complete problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (2) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume II, pp. 914-918, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 18(2), pp. 120-142, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
72 | Christian Scheideler |
How to spread adversarial nodes?: rotate! ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 704-713, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 63-72, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree transducer, XML, pebble |
64 | Tony Tan |
On Pebble Automata for Data Languages with Decidable Emptiness Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 712-723, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
64 | Wayne Luk, Steve McKeever |
Pebble: A Language for Parametrised and Reconfigurable Hardware Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm, 8th International Workshop, FPL'98, Tallinn, Estonia, August 31 - September 3, 1998, Proceedings, pp. 9-18, 1998, Springer, 3-540-64948-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
59 | Audrey Lee, Ileana Streinu, Louis Theran |
Analyzing rigidity with pebble games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 226-227, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
computational geometry, rigidity, sparse graph, pebble game |
58 | Tim Todman, Wayne Luk |
Combining Imperative and Declarative Hardware Descriptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 36th Hawaii International Conference on System Sciences (HICSS-36 2003), CD-ROM / Abstracts Proceedings, January 6-9, 2003, Big Island, HI, USA, pp. 280, 2003, IEEE Computer Society, 0-7695-1874-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
58 | Steve McKeever, Wayne Luk |
Towards Provably-Correct Hardware Compilation Tools Based on Pass Separation Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHARME ![In: Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001, Livingston, Scotland, UK, September 4-7, 2001, Proceedings, pp. 212-227, 2001, Springer, 3-540-42541-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Noa Globerman, David Harel |
Complexity Results for Multi-Pebble Automata and their Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 73-82, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
49 | Bala Kalyanasundaram, Georg Schnitger |
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, pp. 517-529, 1989, Springer, 3-540-50840-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
43 | Anvesh Komuravelli, Matús Mihalák |
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 458-471, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Steve McKeever, Wayne Luk, Arran Derbyshire |
Towards Verifying Parametrised Hardware Libraries with Relative Placement Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 36th Hawaii International Conference on System Sciences (HICSS-36 2003), CD-ROM / Abstracts Proceedings, January 6-9, 2003, Big Island, HI, USA, pp. 279, 2003, IEEE Computer Society, 0-7695-1874-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Joost Engelfriet, Sebastian Maneth |
Two-Way Finite State Transducers with Nested Pebbles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 234-244, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Rahul Santhanam |
On Separators, Segregators and Time versus Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 286-294, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Ali Sattari Javid, Lars Doyle, David Mould |
Irregular Pebble Mosaics with Sub-Pebble Detail. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expressive ![In: 8th ACM/Eurographics Expressive Symposium, Expressive 2019, Genoa, Italy, May 5-6, 2019, Proceedings, pp. 133-141, 2019, Eurographics Association, 978-3-03868-078-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
41 | Erik D. Demaine, Quanquan C. Liu |
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.06343, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
41 | Erik D. Demaine, Quanquan C. Liu |
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings, pp. 313-324, 2017, Springer, 978-3-319-62126-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
41 | Lorand Muzamel |
Pebble macro tree transducers with strong pebble handling ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2011 |
RDF |
|
41 | Zoltán Fülöp 0001, Lorand Muzamel |
Pebble Macro Tree Transducers with Strong Pebble Handling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 89(2-3), pp. 207-257, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
38 | Volker Weber |
On the Complexity of Branching-Time Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 530-545, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 281-311, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 13(3-5), pp. 386-402, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pillars of Computer Science ![In: Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, pp. 589-595, 2008, Springer, 978-3-540-78126-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
Expressive Power of Pebble Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 157-168, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Grzegorz Malewicz, Arnold L. Rosenberg |
A Pebble Game for Internet-Based Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Essays in Memory of Shimon Even ![In: Theoretical Computer Science, Essays in Memory of Shimon Even, pp. 291-312, 2006, Springer, 3-540-32880-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Hubie Chen, Víctor Dalmau |
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings, pp. 232-247, 2005, Springer, 3-540-28231-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 259-270, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
35 | V. S. Lakshmanan 0001, Alberto O. Mendelzon |
Inductive Pebble Games and the Expressive Power of Datalog. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA, pp. 301-310, 1989, ACM Press, 0-89791-308-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
Datalog |
35 | Friedhelm Meyer auf der Heide |
A Comparison Between Two Variations of a Pebble Game on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 411-421, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
35 | Wolfgang J. Paul, Robert Endre Tarjan |
Time-Space Trade-Offs in a Pebble Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, Fourth Colloquium, University of Turku, Finland, July 18-22, 1977, Proceedings, pp. 365-369, 1977, Springer, 3-540-08342-1. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
29 | Alon Shalita, Uri Zwick |
Efficient algorithms for the 2-gathering problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 96-105, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Albert Atserias, Mark Weyer |
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 102-116, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Viliam Geffert, Dana Pardubská |
Factoring and Testing Primes in Small Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pp. 291-302, 2009, Springer, 978-3-540-95890-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, pp. 227-241, 2008, Springer, 978-3-540-87778-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: 14th International Conference on Image Analysis and Processing (ICIAP 2007), 10-14 September 2007, Modena, Italy, pp. 763-768, 2007, IEEE Computer Society, 0-7695-2877-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Evan Goris, Maarten Marx |
Looping Caterpillars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 51-60, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Albert Atserias |
Unsatisfiable Random Formulas Are Hard to Certify. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pp. 325-334, 2002, IEEE Computer Society, 0-7695-1483-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Richard Královic |
Time and Space Complexity of Reversible Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings, pp. 292-303, 2001, Springer, 3-540-42912-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Tova Milo, Dan Suciu, Victor Vianu |
Typechecking for XML Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-17, 2000, Dallas, Texas, USA, pp. 11-22, 2000, ACM, 1-58113-214-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Peter Damaschke |
A Chip Search Problem on Binary Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings, pp. 11-22, 1998, Springer, 3-540-64275-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Ming Li 0001, Paul M. B. Vitányi |
Reversible Simulation of Irreversible Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 301-306, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 671-681, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Maria M. Klawe |
A Tight Bound for Black and White Pebbles on the Pyramid ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(1), pp. 218-228, January 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
24 | Jakob Nordström |
On the Relative Strength of Pebbling and Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 151-162, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(3), pp. 30:1-30:30, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MoMM ![In: MoMM'2009 - The 7th International Conference on Advances in Mobile Computing and Multimedia, 14-16 December 2009, Kuala Lumpur, Malaysia, pp. 510-513, 2009, ACM, 978-1-60558-659-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
P2P, blog, Pebble |
24 | Jakob Nordström |
Narrow proofs may be spacious: separating space and width in resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 507-516, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 32(6), pp. 585-589, 1983. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 79, pp. 483-514, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Lisa Jaser, Jacobo Torán |
Pebble Games and Algebraic Proof Systems Meet Again. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-042, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
20 | Roshan Kenia, Jihane Mendil, Ahmed Jasim, Muthanna Al-Dahhan, Zhaozheng Yin |
Robust TRISO-fueled Pebble Identification by Digit Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WACV ![In: IEEE/CVF Winter Conference on Applications of Computer Vision, WACV 2024, Waikoloa, HI, USA, January 3-8, 2024, pp. 8142-8150, 2024, IEEE, 979-8-3503-1892-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.12770, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal 0001 |
Pebble guided Treasure Hunt in Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.06067, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.19104, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Arend-Jan Quist, Alfons Laarman |
Optimizing Quantum Space Using Spooky Pebble Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RC ![In: Reversible Computation - 15th International Conference, RC 2023, Giessen, Germany, July 18-19, 2023, Proceedings, pp. 134-149, 2023, Springer, 978-3-031-38099-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble minimization: the last theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings, pp. 436-455, 2023, Springer, 978-3-031-30828-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal 0001 |
Pebble Guided Treasure Hunt in Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NETYS ![In: Networked Systems - 11th International Conference, NETYS 2023, Benguerir, Morocco, May 22-24, 2023, Proceedings, pp. 141-156, 2023, Springer, 978-3-031-37764-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit |
Pebble guided optimal treasure hunt in anonymous graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 922, pp. 61-80, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(5), pp. 154, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Max Lind, Eugene Fiorini, Andrew Woldar |
On Properties of Pebble Assignment Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(2), pp. 45, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 10(1), pp. 1, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble minimization: the last theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.02426, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2022, Kyoto, Japan, October 23-27, 2022, pp. 9987-9994, 2022, IEEE, 978-1-6654-7927-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Yoàv Montacute, Nihil Shah |
The Pebble-Relation Comonad in Finite Model Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pp. 13:1-13:11, 2022, ACM, 978-1-4503-9351-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Niels Gleinig, Torsten Hoefler |
The Red-Blue Pebble Game on Trees and DAGs with Large Input. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27-29, 2022, Proceedings, pp. 135-153, 2022, Springer, 978-3-031-09992-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 30(1), pp. 7, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma |
Pebble exchange group of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 95, pp. 103325, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit |
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.05933, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.05091, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Niels Kornerup, Jonathan Sadun, David Soloveichik |
The Spooky Pebble Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.08973, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Yoàv Montacute, Nihil Shah |
The Pebble-Relation Comonad in Finite Model Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.08196, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble transducers with unary output. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.14019, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Gaëtan Douéneau-Tabot |
Pebble Transducers with Unary Output. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia., pp. 40:1-40:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-201-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Maxime Le Chapelain |
@I am a Pebble. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH Computer Animation Festival ![In: SIGGRAPH 2021: Special Interest Group on Computer Graphics and Interactive Techniques Conference, Computer Animation Festival, Virtual Event, USA, August 9-13, 2021., pp. 9:1, 2021, ACM, 978-1-4503-8324-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit |
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings, pp. 222-239, 2021, Springer, 978-3-030-79526-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 6152-6163, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Remote. Sens. ![In: Remote. Sens. 12(21), pp. 3659, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.10107, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Pál András Papp, Roger Wattenhofer |
On the Hardness of Red-Blue Pebble Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.08609, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Toby Walsh |
A Pebble in the AI Race. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.13861, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | |
Pebble Minimization of Polyregular Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.16645, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Liam Jordon, Philippe Moser |
Pebble-Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.12225, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Bogdan Pavel Deac, Adrian Colesa |
Following the Pebble Trail: Extending Return-Oriented Programming to RISC-V. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCSW ![In: CCSW'20, Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop, Virtual Event, USA, November 9, 2020, pp. 161, 2020, ACM, 978-1-4503-8084-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Nathan Lhote |
Pebble Minimization of Polyregular Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 703-712, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Nadia Labai, Tomer Kotek, Magdalena Ortiz 0001, Helmut Veith |
Pebble-Intervals Automata and FO2 with Two Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings, pp. 208-221, 2020, Springer, 978-3-030-40607-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Xinxin Fan, Qi Chai, Zhefeng Li, Tian Pan 0002 |
Decentralized IoT Data Authorization with Pebble Tracker. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WF-IoT ![In: 6th IEEE World Forum on Internet of Things, WF-IoT 2020, New Orleans, LA, USA, June 2-16, 2020, pp. 1-2, 2020, IEEE, 978-1-7281-5503-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 60:1-60:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Pál András Papp, Roger Wattenhofer |
On the Hardness of Red-Blue Pebble Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pp. 419-429, 2020, ACM, 978-1-4503-6935-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 625-640, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Lars Doyle, Forest Anderson, Ehren Choy, David Mould |
Automated pebble mosaic stylization of images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Vis. Media ![In: Comput. Vis. Media 5(1), pp. 33-44, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|