The red-blue pebble game on trees and DAGs with large input

DOI10.1007/978-3-031-09993-9_8OpenAlexW4285235912MaRDI QIDQ2097342FDOQ2097342

Authors: Niels Gleinig, T. Hoefler 

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09993-9_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Communication-optimal parallel and sequential QR and LU factorizations
• Title not available (Why is that?)
• Upper and lower I/O bounds for pebbling \(r\)-pyramids
• Inapproximability of treewidth, one-shot pebbling, and related layout problems
• I/O-efficient undirected shortest paths
• Communication-optimal parallel and sequential Cholesky decomposition
• Title not available (Why is that?)
• Inapproximability of the standard pebble game and hard to pebble graphs
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• Title not available (Why is that?)
• The I/O complexity of computing prime tables

This page was built for publication: The red-blue pebble game on trees and DAGs with large input

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097342)