The red-blue pebble game on trees and DAGs with large input
From MaRDI portal
Publication:2097342
DOI10.1007/978-3-031-09993-9_8OpenAlexW4285235912MaRDI QIDQ2097342
Publication date: 11 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09993-9_8
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inapproximability of the standard pebble game and hard to pebble graphs
- The I/O Complexity of Computing Prime Tables
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Upper and Lower I/O Bounds for Pebbling r-Pyramids
- Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- Communication-optimal Parallel and Sequential Cholesky Decomposition
- Algorithms - ESA 2003