Search results for "pebbling"

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)	PODS	2001	DBLP DOI BibTeX RDF
102	Kurt Mehlhorn	Pebbling Moutain Ranges and its Application of DCFL-Recognition.	ICALP	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.	FOCS	2008	DBLP DOI BibTeX RDF
62	Philipp Hertel, Toniann Pitassi	Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling.	FOCS	2007	DBLP DOI BibTeX RDF
47	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
47	Arnold L. Rosenberg, Ivan Hal Sudborough	Bandwidth and pebbling.	Computing	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.	STOC	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.	NGITS	2006	DBLP DOI BibTeX RDF	program rollback, list traversal, pebbling, hash chain, synopsis
47	Michael Szydlo	Merkle Tree Traversal in Log Space and Time.	EUROCRYPT	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.	ICCI	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.	AKCE Int. J. Graphs Comb.	2022	DBLP DOI BibTeX RDF
42	Charles A. Cusack, Airat Bekmetjev, Mark Powers	Two-pebbling and odd-two-pebbling are not equivalent.	Discret. Math.	2019	DBLP DOI BibTeX RDF
42	Zhiping Wang, Xu Han	The t-Pebbling Number And 2t-Pebbling Property On The Graph Dn, C2m.	Ars Comb.	2015	DBLP BibTeX RDF
42	Ze-Tu Gao, Jian-Hua Yin	On the t-pebbling number and the 2t-pebbling property of graphs.	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
42	Andrzej Czygrinow, Glenn H. Hurlbert	On the pebbling threshold of paths and the pebbling threshold spectrum.	Discret. Math.	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.	J. Graph Theory	2008	DBLP DOI BibTeX RDF
41	Yossi Matias, Ely Porat	Efficient Pebbling for List Traversal Synopses.	ICALP	2003	DBLP DOI BibTeX RDF
41	Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter	A Note on Graph Pebbling.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
41	Yonatan Aumann, Judit Bar-Ilan, Uriel Feige	On the Cost of Recomputing: Tight Bounds on Pebbling with Faults.	ICALP	1994	DBLP DOI BibTeX RDF
41	Peter Ruzicka, Juraj Waczulík	On Time-Space Trade-Offs in Dynamic Graph Pebbling.	MFCS	1993	DBLP DOI BibTeX RDF
41	Jean-Claude Raoult, Ravi Sethi	The Global Storage Needs of a Subcomputation.	POPL	1984	DBLP DOI BibTeX RDF
26	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
26	Jacobo Torán	Lower Bounds for Space in Resolution.	CSL	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.	Discret. Math. Algorithms Appl.	2024	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Blake Holman, Seunghoon Lee	The Impact of Reversibility on Parallel Pebbling.	IACR Cryptol. ePrint Arch.	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.	LATIN (2)	2024	DBLP DOI BibTeX RDF
21	Oded Schwartz, Noa Vaknin	Pebbling Game and Alternative Basis for High Performance Matrix Multiplication.	SIAM J. Sci. Comput.	2023	DBLP DOI BibTeX RDF
21	László F. Papp	Restricted optimal pebbling is NP-hard.	CoRR	2023	DBLP DOI BibTeX RDF
21	Joshua Forkin, Glenn Hurlbert	Cops and robbers pebbling in graphs.	CoRR	2023	DBLP DOI BibTeX RDF
21	Dominic Flocco, Jonad Pulaj, Carl Yerger	Automating Weight Function Generation in Graph Pebbling.	CoRR	2023	DBLP DOI BibTeX RDF
21	Liliana Alcón, Glenn Hurlbert	Pebbling in powers of paths.	Discret. Math.	2023	DBLP DOI BibTeX RDF
21	Jan Petr, Julien Portier, Szymon Stolarczyk	A new lower bound on the optimal pebbling number of the grid.	Discret. Math.	2023	DBLP DOI BibTeX RDF
21	Gianfranco Bilardi, Lorenzo De Stefani	The DAG Visit approach for Pebbling and I/O Lower Bounds.	CoRR	2022	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Blake Holman, Seunghoon Lee	The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Jeremiah Blocki, Blake Holman, Seunghoon Lee	The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs.	TCC (1)	2022	DBLP DOI BibTeX RDF
21	Gianfranco Bilardi, Lorenzo De Stefani	The DAG Visit Approach for Pebbling and I/O Lower Bounds.	FSTTCS	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.	Comput. Complex.	2021	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Seunghoon Lee	Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs.	CoRR	2021	DBLP BibTeX RDF
21	Chin-Lin Shiue	Distance restricted optimal pebbling in paths.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
21	Garth Isaak, Matthew Prudente	Two-player pebbling on diameter 2 graphs.	Int. J. Game Theory	2021	DBLP DOI BibTeX RDF
21	Franklin Kenter, Daphne E. Skipper, Dan Wilson	Computing bounds on product graph pebbling numbers.	Theor. Comput. Sci.	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.	Electron. Colloquium Comput. Complex.	2020	DBLP BibTeX RDF
21	Ervin Györi, Gyula Y. Katona, László F. Papp	Optimal Pebbling Number of the Square Grid.	Graphs Comb.	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.	CoRR	2020	DBLP BibTeX RDF
21	Chin-Lin Shiue	Distance restricted optimal pebbling in cycles.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Seunghoon Lee, Samson Zhou	Approximating Cumulative Pebbling Cost Is Unique Games Hard.	ITCS	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.	MFPS	2020	DBLP DOI BibTeX RDF
21	Andreas Fellner, Bruno Woltzenlogel Paleo	Greedy pebbling for proof space compression.	Int. J. Softw. Tools Technol. Transf.	2019	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Seunghoon Lee, Samson Zhou	Approximating Cumulative Pebbling Cost is Unique Games Hard.	CoRR	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.	CoRR	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.	CoRR	2019	DBLP BibTeX RDF
21	Charles A. Cusack, Aaron Green, Airat Bekmetjev, Mark Powers	Graph pebbling algorithms and Lemke graphs.	Discret. Appl. Math.	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.	Discret. Appl. Math.	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.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
21	Chin-Lin Shiue	Capacity restricted optimal pebbling in graphs.	Discret. Appl. Math.	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.	Discret. Math. Algorithms Appl.	2019	DBLP DOI BibTeX RDF
21	Sascha Fischer	On the pebbling number of Cm×Cn in case of even parity.	Discret. Math.	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.	Discret. Math.	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.	DATE	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.	SC	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.	CCC	2019	DBLP DOI BibTeX RDF
21	Nicholas Korpelainen, Mathew Stubley	An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants.	Electron. Notes Discret. Math.	2018	DBLP DOI BibTeX RDF
21	Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani	Pebbling meets coloring: Reversible pebble game on trees.	J. Comput. Syst. Sci.	2018	DBLP DOI BibTeX RDF
21	Thaddeus Dryja, Quanquan C. Liu, Sunoo Park	Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling.	CoRR	2018	DBLP BibTeX RDF
21	Berry Schoenmakers	Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains.	CoRR	2018	DBLP BibTeX RDF
21	Arockiam Lourdusamy, T. Mathivanan	The Domination Cover Pebbling Number For Some Cyclic Graphs And Path Graphs.	Ars Comb.	2018	DBLP BibTeX RDF
21	Thaddeus Dryja, Quanquan C. Liu, Sunoo Park	Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling.	IACR Cryptol. ePrint Arch.	2018	DBLP BibTeX RDF
21	Jeremiah Blocki, Samson Zhou	On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling.	Financial Cryptography	2018	DBLP DOI BibTeX RDF
21	Franklin Kenter, Daphne E. Skipper	Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs.	COCOA	2018	DBLP DOI BibTeX RDF
21	Ervin Györi, Gyula Y. Katona, László F. Papp	Constructions for the Optimal Pebbling of Grids.	Period. Polytech. Electr. Eng. Comput. Sci.	2017	DBLP DOI BibTeX RDF
21	Samson Abramsky, Anuj Dawar, Pengming Wang 0001	The pebbling comonad in finite model theory.	CoRR	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.	Ars Comb.	2017	DBLP BibTeX RDF
21	Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis	Restricted optimal pebbling and domination in graphs.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Samson Zhou	On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i.	IACR Cryptol. ePrint Arch.	2017	DBLP BibTeX RDF
21	Ze-Tu Gao, Jian-Hua Yin	Lemke graphs and Graham's pebbling conjecture.	Discret. Math.	2017	DBLP DOI BibTeX RDF
21	Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert	Pebbling in semi-2-trees.	Discret. Math.	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.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
21	Glenn Hurlbert	The Weight Function Lemma for graph pebbling.	J. Comb. Optim.	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.	ITCS	2017	DBLP DOI BibTeX RDF
21	Jeremiah Blocki, Samson Zhou	On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i.	TCC (1)	2017	DBLP DOI BibTeX RDF
21	Samson Abramsky, Anuj Dawar, Pengming Wang 0001	The pebbling comonad in Finite Model Theory.	LICS	2017	DBLP DOI BibTeX RDF
21	Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani	Pebbling Meets Coloring : Reversible Pebble Game On Trees.	Electron. Colloquium Comput. Complex.	2016	DBLP BibTeX RDF
21	Chenxiao Xue, Carl Yerger	Optimal Pebbling on Grids.	Graphs Comb.	2016	DBLP DOI BibTeX RDF
21	Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani	Pebbling Meets Coloring: Reversible Pebble Game On Trees.	CoRR	2016	DBLP BibTeX RDF
21	Jeremiah Blocki, Samson Zhou	On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling.	CoRR	2016	DBLP BibTeX RDF
21	David S. Herscovici	Using error-correcting codes to construct solvable pebbling distributions.	Discret. Math.	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.	Australas. J Comb.	2016	DBLP BibTeX RDF
21	Berry Schoenmakers	Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal.	Financial Cryptography	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.	SPAA	2016	DBLP DOI BibTeX RDF
21	Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert	Pebbling in 2-Paths.	Electron. Notes Discret. Math.	2015	DBLP DOI BibTeX RDF
21	Balagopal Komarath, Jayalal Sarma	Pebbling, Entropy, and Branching Program Size Lower Bounds.	ACM Trans. Comput. Theory	2015	DBLP DOI BibTeX RDF
21	Ervin Györi, Gyula Y. Katona, László F. Papp	Optimal pebbling of grids.	CTW	2015	DBLP BibTeX RDF
21	Liliana Alcón, Marisa Gutierrez, Glenn H. Hurlbert	Pebbling in Split Graphs.	SIAM J. Discret. Math.	2014	DBLP DOI BibTeX RDF
21	Yongsheng Ye, Fang Liu, Caixia Shi	The 2-Pebbling Property of the Middle Graph of Fan Graphs.	J. Appl. Math.	2014	DBLP DOI BibTeX RDF
21	Yongsheng Ye, Mei Liu, Jie Gao	The optimal pebbling number of square of paths and cycles.	Ars Comb.	2014	DBLP BibTeX RDF
21	Xu Han, Zhiping Wang, Xincui Wang	Pebbling Number Of The Graph Dn, Cm.	Ars Comb.	2014	DBLP BibTeX RDF
21	Timothy Lewis, Charles A. Cusack, Lisa Dion	The complexity of pebbling reachability and solvability in planar and outerplanar graphs.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
21	Berry Schoenmakers	Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal.	IACR Cryptol. ePrint Arch.	2014	DBLP BibTeX RDF
21	Luke Postle	Pebbling Graphs of Fixed Diameter.	J. Graph Theory	2014	DBLP DOI BibTeX RDF
21	Balagopal Komarath, Jayalal Sarma	Pebbling, Entropy and Branching Program Size Lower Bounds.	Electron. Colloquium Comput. Complex.	2013	DBLP BibTeX RDF