The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for pebbling with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1979-1990 (16) 1991-2001 (17) 2002-2005 (19) 2006-2008 (18) 2009-2011 (20) 2012-2013 (21) 2014-2016 (19) 2017-2018 (20) 2019 (15) 2020-2022 (16) 2023-2024 (9)
Publication types (Num. hits)
article(141) inproceedings(48) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 34 occurrences of 18 keywords

Results
Found 190 publication records. Showing 190 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
122Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton On the Complexity of Join Predicates. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
102Kurt Mehlhorn Pebbling Moutain Ranges and its Application of DCFL-Recognition. Search on Bibsonomy ICALP The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
82Eli Ben-Sasson, Jakob Nordström Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
62Philipp Hertel, Toniann Pitassi Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
47Jakob Nordström On the Relative Strength of Pebbling and Resolution. Search on Bibsonomy CCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF pebbling formula, resolution, space, trade-off, proof complexity, pebble games
47Arnold L. Rosenberg, Ivan Hal Sudborough Bandwidth and pebbling. Search on Bibsonomy Computing The full citation details ... 1983 DBLP  DOI  BibTeX  RDF graph pebbling, Bandwidth
47Jakob Nordström, Johan Håstad Towards an optimal separation of space and length in resolution. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF length, lower bound, resolution, space, separation, pebbling, proof complexity
47Michael Furman, Yossi Matias, Ely Porat LTS: The List-Traversal Synopses System. Search on Bibsonomy NGITS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF program rollback, list traversal, pebbling, hash chain, synopsis
47Michael Szydlo Merkle Tree Traversal in Log Space and Time. Search on Bibsonomy EUROCRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF authentication path, tail zipping, fractal traversal, binary tree, pebbling, Merkle tree, amortization
47Mark H. Nodine, Daniel P. Lopresti, Jeffrey Scott Vitter I/O Overhead and Parallel VLSI Architectures for Lattice Computations. Search on Bibsonomy ICCI The full citation details ... 1990 DBLP  DOI  BibTeX  RDF Input/output complexity, lattice computations, cellular automata, VLSI architectures, pebbling
42Arockiam Lourdusamy, I. Dhivviyanandam, S. Kither Iammal Monophonic pebbling number and t-pebbling number of some graphs. Search on Bibsonomy AKCE Int. J. Graphs Comb. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
42Charles A. Cusack, Airat Bekmetjev, Mark Powers Two-pebbling and odd-two-pebbling are not equivalent. Search on Bibsonomy Discret. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
42Zhiping Wang, Xu Han The t-Pebbling Number And 2t-Pebbling Property On The Graph Dn, C2m. Search on Bibsonomy Ars Comb. The full citation details ... 2015 DBLP  BibTeX  RDF
42Ze-Tu Gao, Jian-Hua Yin On the t-pebbling number and the 2t-pebbling property of graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
42Andrzej Czygrinow, Glenn H. Hurlbert On the pebbling threshold of paths and the pebbling threshold spectrum. Search on Bibsonomy Discret. Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West Pebbling and optimal pebbling in graphs. Search on Bibsonomy J. Graph Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Yossi Matias, Ely Porat Efficient Pebbling for List Traversal Synopses. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
41Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter A Note on Graph Pebbling. Search on Bibsonomy Graphs Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
41Yonatan Aumann, Judit Bar-Ilan, Uriel Feige On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
41Peter Ruzicka, Juraj Waczulík On Time-Space Trade-Offs in Dynamic Graph Pebbling. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
41Jean-Claude Raoult, Ravi Sethi The Global Storage Needs of a Subcomputation. Search on Bibsonomy POPL The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
26Jakob Nordström Narrow proofs may be spacious: separating space and width in resolution. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF pebbling contradiction, lower bound, resolution, space, separation, proof complexity, width, pebble game
26Jacobo Torán Lower Bounds for Space in Resolution. Search on Bibsonomy CSL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF lower bounds, Resolution, space, complexity measures, pebbling game
21Arockiam Lourdusamy, I. Dhivviyanandam, S. Kither Iammal Monophonic pebbling number of some families of cycles. Search on Bibsonomy Discret. Math. Algorithms Appl. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Blake Holman, Seunghoon Lee The Impact of Reversibility on Parallel Pebbling. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2024 DBLP  BibTeX  RDF
21Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki Pebbling in Kneser Graphs. Search on Bibsonomy LATIN (2) The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Oded Schwartz, Noa Vaknin Pebbling Game and Alternative Basis for High Performance Matrix Multiplication. Search on Bibsonomy SIAM J. Sci. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21László F. Papp Restricted optimal pebbling is NP-hard. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Joshua Forkin, Glenn Hurlbert Cops and robbers pebbling in graphs. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Dominic Flocco, Jonad Pulaj, Carl Yerger Automating Weight Function Generation in Graph Pebbling. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Liliana Alcón, Glenn Hurlbert Pebbling in powers of paths. Search on Bibsonomy Discret. Math. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Jan Petr, Julien Portier, Szymon Stolarczyk A new lower bound on the optimal pebbling number of the grid. Search on Bibsonomy Discret. Math. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Gianfranco Bilardi, Lorenzo De Stefani The DAG Visit approach for Pebbling and I/O Lower Bounds. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Blake Holman, Seunghoon Lee The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2022 DBLP  BibTeX  RDF
21Jeremiah Blocki, Blake Holman, Seunghoon Lee The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs. Search on Bibsonomy TCC (1) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Gianfranco Bilardi, Lorenzo De Stefani The DAG Visit Approach for Pebbling and I/O Lower Bounds. Search on Bibsonomy FSTTCS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Search on Bibsonomy Comput. Complex. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Seunghoon Lee Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Chin-Lin Shiue Distance restricted optimal pebbling in paths. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Garth Isaak, Matthew Prudente Two-player pebbling on diameter 2 graphs. Search on Bibsonomy Int. J. Game Theory The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Franklin Kenter, Daphne E. Skipper, Dan Wilson Computing bounds on product graph pebbling numbers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2020 DBLP  BibTeX  RDF
21Ervin Györi, Gyula Y. Katona, László F. Papp Optimal Pebbling Number of the Square Grid. Search on Bibsonomy Graphs Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Chin-Lin Shiue Distance restricted optimal pebbling in cycles. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Seunghoon Lee, Samson Zhou Approximating Cumulative Pebbling Cost Is Unique Games Hard. Search on Bibsonomy ITCS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Thomas Paine A Pebbling Comonad for Finite Rank and Variable Logic, and an Application to the Equirank-variable Homomorphism Preservation Theorem. Search on Bibsonomy MFPS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Andreas Fellner, Bruno Woltzenlogel Paleo Greedy pebbling for proof space compression. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Seunghoon Lee, Samson Zhou Approximating Cumulative Pebbling Cost is Unique Games Hard. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
21Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj S. Bjørner, Giovanni De Micheli Reversible Pebbling Game for Quantum Memory Management. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
21Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
21Charles A. Cusack, Aaron Green, Airat Bekmetjev, Mark Powers Graph pebbling algorithms and Lemke graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Ervin Györi, Gyula Y. Katona, László F. Papp Optimal pebbling and rubbling of graphs with given diameter. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp Optimal pebbling number of graphs with given minimum degree. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Chin-Lin Shiue Capacity restricted optimal pebbling in graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Nopparat Pleanmani Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph. Search on Bibsonomy Discret. Math. Algorithms Appl. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Sascha Fischer On the pebbling number of Cm×Cn in case of even parity. Search on Bibsonomy Discret. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins The optimal pebbling number of staircase graphs. Search on Bibsonomy Discret. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj S. Bjørner, Giovanni De Micheli Reversible Pebbling Game for Quantum Memory Management. Search on Bibsonomy DATE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Grzegorz Kwasniewski, Marko Kabic, Maciej Besta, Joost VandeVondele, Raffaele Solcà, Torsten Hoefler Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication. Search on Bibsonomy SC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Search on Bibsonomy CCC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Nicholas Korpelainen, Mathew Stubley An Inescapable Region for the Chessboard Pebbling Problem on Four Quadrants. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani Pebbling meets coloring: Reversible pebble game on trees. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Thaddeus Dryja, Quanquan C. Liu, Sunoo Park Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Berry Schoenmakers Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Arockiam Lourdusamy, T. Mathivanan The Domination Cover Pebbling Number For Some Cyclic Graphs And Path Graphs. Search on Bibsonomy Ars Comb. The full citation details ... 2018 DBLP  BibTeX  RDF
21Thaddeus Dryja, Quanquan C. Liu, Sunoo Park Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2018 DBLP  BibTeX  RDF
21Jeremiah Blocki, Samson Zhou On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. Search on Bibsonomy Financial Cryptography The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Franklin Kenter, Daphne E. Skipper Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs. Search on Bibsonomy COCOA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Ervin Györi, Gyula Y. Katona, László F. Papp Constructions for the Optimal Pebbling of Grids. Search on Bibsonomy Period. Polytech. Electr. Eng. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Samson Abramsky, Anuj Dawar, Pengming Wang 0001 The pebbling comonad in finite model theory. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
21Zheng-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 Ars Comb. The full citation details ... 2017 DBLP  BibTeX  RDF
21Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis Restricted optimal pebbling and domination in graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Samson Zhou On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2017 DBLP  BibTeX  RDF
21Ze-Tu Gao, Jian-Hua Yin Lemke graphs and Graham's pebbling conjecture. Search on Bibsonomy Discret. Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert Pebbling in semi-2-trees. Search on Bibsonomy Discret. Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger Modified linear programming and class 0 bounds for graph pebbling. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Glenn Hurlbert The Weight Function Lemma for graph pebbling. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals Cumulative Space in Black-White Pebbling and Resolution. Search on Bibsonomy ITCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Jeremiah Blocki, Samson Zhou On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. Search on Bibsonomy TCC (1) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Samson Abramsky, Anuj Dawar, Pengming Wang 0001 The pebbling comonad in Finite Model Theory. Search on Bibsonomy LICS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani Pebbling Meets Coloring : Reversible Pebble Game On Trees. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2016 DBLP  BibTeX  RDF
21Chenxiao Xue, Carl Yerger Optimal Pebbling on Grids. Search on Bibsonomy Graphs Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani Pebbling Meets Coloring: Reversible Pebble Game On Trees. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
21Jeremiah Blocki, Samson Zhou On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
21David S. Herscovici Using error-correcting codes to construct solvable pebbling distributions. Search on Bibsonomy Discret. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Zheng-Jiang Xia, Yong-Liang Pan, Jun-Ming Xu 0001 Pebbling numbers of the Cartesian product of cycles and graphs. Search on Bibsonomy Australas. J Comb. The full citation details ... 2016 DBLP  BibTeX  RDF
21Berry Schoenmakers Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal. Search on Bibsonomy Financial Cryptography The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. Search on Bibsonomy SPAA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert Pebbling in 2-Paths. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Balagopal Komarath, Jayalal Sarma Pebbling, Entropy, and Branching Program Size Lower Bounds. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Ervin Györi, Gyula Y. Katona, László F. Papp Optimal pebbling of grids. Search on Bibsonomy CTW The full citation details ... 2015 DBLP  BibTeX  RDF
21Liliana Alcón, Marisa Gutierrez, Glenn H. Hurlbert Pebbling in Split Graphs. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
21Yongsheng Ye, Fang Liu, Caixia Shi The 2-Pebbling Property of the Middle Graph of Fan Graphs. Search on Bibsonomy J. Appl. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
21Yongsheng Ye, Mei Liu, Jie Gao The optimal pebbling number of square of paths and cycles. Search on Bibsonomy Ars Comb. The full citation details ... 2014 DBLP  BibTeX  RDF
21Xu Han, Zhiping Wang, Xincui Wang Pebbling Number Of The Graph Dn, Cm. Search on Bibsonomy Ars Comb. The full citation details ... 2014 DBLP  BibTeX  RDF
21Timothy Lewis, Charles A. Cusack, Lisa Dion The complexity of pebbling reachability and solvability in planar and outerplanar graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
21Berry Schoenmakers Explicit Optimal Binary Pebbling for One-Way Hash Chain Reversal. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2014 DBLP  BibTeX  RDF
21Luke Postle Pebbling Graphs of Fixed Diameter. Search on Bibsonomy J. Graph Theory The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
21Balagopal Komarath, Jayalal Sarma Pebbling, Entropy and Branching Program Size Lower Bounds. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2013 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 190 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license