Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
122 | Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton |
On the Complexity of Join Predicates. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA, 2001, ACM, 1-58113-361-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
102 | Kurt Mehlhorn |
Pebbling Moutain Ranges and its Application of DCFL-Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings, pp. 422-435, 1980, Springer, 3-540-10003-2. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
82 | Eli Ben-Sasson, Jakob Nordström |
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 709-718, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
62 | Philipp Hertel, Toniann Pitassi |
Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 137-149, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
47 | 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 |
47 | 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 |
47 | Jakob Nordström, Johan Håstad |
Towards an optimal separation of space and length in resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 701-710, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
length, lower bound, resolution, space, separation, pebbling, proof complexity |
47 | Michael Furman, Yossi Matias, Ely Porat |
LTS: The List-Traversal Synopses System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NGITS ![In: Next Generation Information Technologies and Systems, 6th International Workshop, NGITS 2006, Kibbutz Shefayim, Israel, July 4-6, 2006, Proceedings, pp. 353-354, 2006, Springer, 3-540-35472-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
program rollback, list traversal, pebbling, hash chain, synopsis |
47 | Michael Szydlo |
Merkle Tree Traversal in Log Space and Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pp. 541-554, 2004, Springer, 3-540-21935-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
authentication path, tail zipping, fractal traversal, binary tree, pebbling, Merkle tree, amortization |
47 | Mark H. Nodine, Daniel P. Lopresti, Jeffrey Scott Vitter |
I/O Overhead and Parallel VLSI Architectures for Lattice Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 497-506, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Input/output complexity, lattice computations, cellular automata, VLSI architectures, pebbling |
42 | Arockiam Lourdusamy, I. Dhivviyanandam, S. Kither Iammal |
Monophonic pebbling number and t-pebbling number of some graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 19(2), pp. 108-111, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
42 | Charles A. Cusack, Airat Bekmetjev, Mark Powers |
Two-pebbling and odd-two-pebbling are not equivalent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(3), pp. 777-783, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
42 | Zhiping Wang, Xu Han |
The t-Pebbling Number And 2t-Pebbling Property On The Graph Dn, C2m. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 119, pp. 225-234, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
42 | Ze-Tu Gao, Jian-Hua Yin |
On the t-pebbling number and the 2t-pebbling property of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 161(7-8), pp. 999-1005, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
42 | Andrzej Czygrinow, Glenn H. Hurlbert |
On the pebbling threshold of paths and the pebbling threshold spectrum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(15), pp. 3297-3307, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West |
Pebbling and optimal pebbling in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 57(3), pp. 215-238, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Yossi Matias, Ely Porat |
Efficient Pebbling for List Traversal Synopses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 918-928, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
41 | Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter |
A Note on Graph Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(2), pp. 219-225, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
41 | Yonatan Aumann, Judit Bar-Ilan, Uriel Feige |
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 47-58, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
41 | 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 |
|
41 | 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 |
|
26 | 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 |
26 | Jacobo Torán |
Lower Bounds for Space in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 362-373, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Resolution, space, complexity measures, pebbling game |
21 | Arockiam Lourdusamy, I. Dhivviyanandam, S. Kither Iammal |
Monophonic pebbling number of some families of cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 16(4), pp. 2350038:1-2350038:14, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Blake Holman, Seunghoon Lee |
The Impact of Reversibility on Parallel Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2024, pp. 334, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
21 | Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki |
Pebbling in Kneser Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN (2) ![In: LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II, pp. 46-60, 2024, Springer, 978-3-031-55600-5. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Oded Schwartz, Noa Vaknin |
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Sci. Comput. ![In: SIAM J. Sci. Comput. 45(6), pp. 277-303, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | László F. Papp |
Restricted optimal pebbling is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.09867, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Joshua Forkin, Glenn Hurlbert |
Cops and robbers pebbling in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.00434, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Dominic Flocco, Jonad Pulaj, Carl Yerger |
Automating Weight Function Generation in Graph Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.12618, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Liliana Alcón, Glenn Hurlbert |
Pebbling in powers of paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(5), pp. 113315, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Jan Petr, Julien Portier, Szymon Stolarczyk |
A new lower bound on the optimal pebbling number of the grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(1), pp. 113212, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Gianfranco Bilardi, Lorenzo De Stefani |
The DAG Visit approach for Pebbling and I/O Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.01897, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Blake Holman, Seunghoon Lee |
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1503, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Jeremiah Blocki, Blake Holman, Seunghoon Lee |
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (1) ![In: Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I, pp. 52-79, 2022, Springer, 978-3-031-22317-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Gianfranco Bilardi, Lorenzo De Stefani |
The DAG Visit Approach for Pebbling and I/O Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 7:1-7:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 30(1), pp. 4, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Seunghoon Lee |
Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.04191, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Chin-Lin Shiue |
Distance restricted optimal pebbling in paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 297, pp. 46-54, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Garth Isaak, Matthew Prudente |
Two-player pebbling on diameter 2 graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Game Theory ![In: Int. J. Game Theory 50(2), pp. 581-596, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Franklin Kenter, Daphne E. Skipper, Dan Wilson |
Computing bounds on product graph pebbling numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 803, pp. 160-177, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR20, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Ervin Györi, Gyula Y. Katona, László F. Papp |
Optimal Pebbling Number of the Square Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(3), pp. 803-829, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.02481, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Chin-Lin Shiue |
Distance restricted optimal pebbling in cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 279, pp. 125-133, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Seunghoon Lee, Samson Zhou |
Approximating Cumulative Pebbling Cost Is Unique Games Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA., pp. 13:1-13:27, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-134-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Paine |
A Pebbling Comonad for Finite Rank and Variable Logic, and an Application to the Equirank-variable Homomorphism Preservation Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFPS ![In: Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2020, Online, October 1, 2020, pp. 191-209, 2020, Elsevier. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Andreas Fellner, Bruno Woltzenlogel Paleo |
Greedy pebbling for proof space compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 21(1), pp. 71-86, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Seunghoon Lee, Samson Zhou |
Approximating Cumulative Pebbling Cost is Unique Games Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.08078, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj S. Bjørner, Giovanni De Micheli |
Reversible Pebbling Game for Quantum Memory Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.02121, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler |
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.09606, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Charles A. Cusack, Aaron Green, Airat Bekmetjev, Mark Powers |
Graph pebbling algorithms and Lemke graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 262, pp. 72-82, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ervin Györi, Gyula Y. Katona, László F. Papp |
Optimal pebbling and rubbling of graphs with given diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 266, pp. 340-345, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp |
Optimal pebbling number of graphs with given minimum degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 260, pp. 117-130, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Chin-Lin Shiue |
Capacity restricted optimal pebbling in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 260, pp. 284-288, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nopparat Pleanmani |
Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 11(6), pp. 1950068:1-1950068:7, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Sascha Fischer |
On the pebbling number of Cm×Cn in case of even parity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(2), pp. 292-313, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins |
The optimal pebbling number of staircase graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(7), pp. 2148-2157, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj S. Bjørner, Giovanni De Micheli |
Reversible Pebbling Game for Quantum Memory Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Design, Automation & Test in Europe Conference & Exhibition, DATE 2019, Florence, Italy, March 25-29, 2019, pp. 288-291, 2019, IEEE, 978-3-9819263-2-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler |
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2019, Denver, Colorado, USA, November 17-19, 2019., pp. 24:1-24:22, 2019, ACM, 978-1-4503-6229-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pp. 18:1-18:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-116-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nicholas Korpelainen, Mathew Stubley |
An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 70, pp. 55-58, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani |
Pebbling meets coloring: Reversible pebble game on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 91, pp. 33-41, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Thaddeus Dryja, Quanquan C. Liu, Sunoo Park |
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.07433, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Berry Schoenmakers |
Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.03748, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Arockiam Lourdusamy, T. Mathivanan |
The Domination Cover Pebbling Number For Some Cyclic Graphs And Path Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 138, pp. 51-61, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Thaddeus Dryja, Quanquan C. Liu, Sunoo Park |
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2018, pp. 205, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
21 | Jeremiah Blocki, Samson Zhou |
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Financial Cryptography ![In: Financial Cryptography and Data Security - 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 - March 2, 2018, Revised Selected Papers, pp. 329-346, 2018, Springer, 978-3-662-58386-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Franklin Kenter, Daphne E. Skipper |
Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings, pp. 681-695, 2018, Springer, 978-3-030-04650-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Ervin Györi, Gyula Y. Katona, László F. Papp |
Constructions for the Optimal Pebbling of Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Polytech. Electr. Eng. Comput. Sci. ![In: Period. Polytech. Electr. Eng. Comput. Sci. 61(2), pp. 217-223, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Samson Abramsky, Anuj Dawar, Pengming Wang 0001 |
The pebbling comonad in finite model theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.05124, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Zheng-Jiang Xia, Yong-Liang Pan, Jun-Ming Xu 0001, Xi-Ming Cheng |
Graham's pebbling conjecture on the middle graphs of even cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 132, pp. 285-294, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis |
Restricted optimal pebbling and domination in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 221, pp. 46-53, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Samson Zhou |
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2017, pp. 442, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Ze-Tu Gao, Jian-Hua Yin |
Lemke graphs and Graham's pebbling conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(9), pp. 2318-2332, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert |
Pebbling in semi-2-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(7), pp. 1467-1480, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger |
Modified linear programming and class 0 bounds for graph pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 34(1), pp. 114-132, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Glenn Hurlbert |
The Weight Function Lemma for graph pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 34(2), pp. 343-361, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals |
Cumulative Space in Black-White Pebbling and Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, pp. 38:1-38:21, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-029-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Jeremiah Blocki, Samson Zhou |
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC (1) ![In: Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, pp. 445-465, 2017, Springer, 978-3-319-70499-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Samson Abramsky, Anuj Dawar, Pengming Wang 0001 |
The pebbling comonad in Finite Model Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pp. 1-12, 2017, IEEE Computer Society, 978-1-5090-3018-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani |
Pebbling Meets Coloring : Reversible Pebble Game On Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR16, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Chenxiao Xue, Carl Yerger |
Optimal Pebbling on Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 32(3), pp. 1229-1247, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani |
Pebbling Meets Coloring: Reversible Pebble Game On Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.05510, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Jeremiah Blocki, Samson Zhou |
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1609.04449, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | David S. Herscovici |
Using error-correcting codes to construct solvable pebbling distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(1), pp. 318-326, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Zheng-Jiang Xia, Yong-Liang Pan, Jun-Ming Xu 0001 |
Pebbling numbers of the Cartesian product of cycles and graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 65, pp. 124-136, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Berry Schoenmakers |
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Financial Cryptography ![In: Financial Cryptography and Data Security - 20th International Conference, FC 2016, Christ Church, Barbados, February 22-26, 2016, Revised Selected Papers, pp. 299-320, 2016, Springer, 978-3-662-54969-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos |
Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, pp. 161-163, 2016, ACM, 978-1-4503-4210-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert |
Pebbling in 2-Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 50, pp. 145-150, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Balagopal Komarath, Jayalal Sarma |
Pebbling, Entropy, and Branching Program Size Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 7(2), pp. 8:1-8:21, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Ervin Györi, Gyula Y. Katona, László F. Papp |
Optimal pebbling of grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015., pp. 213-216, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
21 | Liliana Alcón, Marisa Gutierrez, Glenn H. Hurlbert |
Pebbling in Split Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 28(3), pp. 1449-1466, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Yongsheng Ye, Fang Liu, Caixia Shi |
The 2-Pebbling Property of the Middle Graph of Fan Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. ![In: J. Appl. Math. 2014, pp. 304514:1-304514:5, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Yongsheng Ye, Mei Liu, Jie Gao |
The optimal pebbling number of square of paths and cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 114, pp. 363-371, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Xu Han, Zhiping Wang, Xincui Wang |
Pebbling Number Of The Graph Dn, Cm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 114, pp. 169-176, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Timothy Lewis, Charles A. Cusack, Lisa Dion |
The complexity of pebbling reachability and solvability in planar and outerplanar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 172, pp. 62-74, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Berry Schoenmakers |
Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2014, pp. 329, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
21 | Luke Postle |
Pebbling Graphs of Fixed Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 75(4), pp. 302-310, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Balagopal Komarath, Jayalal Sarma |
Pebbling, Entropy and Branching Program Size Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|