18 citations · 24 across the 10 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2025
Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking
Tianyu Liang, Chao Chen, Yotam Yaniv +6
Incomplete Cholesky (IC) preconditioners are the standard black-box, memory-efficient first resort for large graph Laplacian systems, but classical IC can break down on irregular g…
cs.DC2024
Exploring the Landscape of Distributed Graph Sketching
David Tench, Evan T. West, Kenny Zhang +6
Recent work has initiated the study of dense graph processing using graph sketching methods, which drastically reduce space costs by lossily compressing information about the input…