Published in: LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
Gianfranco Bilardi and Lorenzo De Stefani. The DAG Visit Approach for Pebbling and I/O Lower Bounds. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 7:1-7:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilardi_et_al:LIPIcs.FSTTCS.2022.7, author = {Bilardi, Gianfranco and De Stefani, Lorenzo}, title = {{The DAG Visit Approach for Pebbling and I/O Lower Bounds}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {7:1--7:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.7}, URN = {urn:nbn:de:0030-drops-173999}, doi = {10.4230/LIPIcs.FSTTCS.2022.7}, annote = {Keywords: Pebbling, Directed Acyclic Graph, Pebbling number, I/O complexity} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Lorenzo De Stefani. The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 33:1-33:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{destefani:LIPIcs.ISAAC.2019.33, author = {De Stefani, Lorenzo}, title = {{The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.33}, URN = {urn:nbn:de:0030-drops-115299}, doi = {10.4230/LIPIcs.ISAAC.2019.33}, annote = {Keywords: I/O complexity, Hybrid Algorithm, Matrix Multiplication, Recomputation} }
Feedback for Dagstuhl Publishing