18 citations · 24 across the 10 of their papers we have counts for
10 papers
Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
Quinten De Man, Gilvir Gill, Michael A. Bender +2
Dynamic connectivity is a fundamental dynamic graph problem, and recent algorithmic breakthroughs on dynamic graph sketching have reshaped what is theoretically possible: by encodi…
Fast and Compact Sketch-Based Dynamic Connectivity
Quinten De Man, Qamber Jafri, Daniel Delayo +3
We study the dynamic connectivity problem for massive, dense graphs. Our goal is to build a system for dense graphs that simultaneously answers connectivity queries quickly, mainta…
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…
The Case for External Graph Sketching
Michael A. Bender, Martín Farach-Colton, Riko Jacob +3
Algorithms in the data stream model use space to compute some property of an input of size , and many of these algorithms are implemented and used in practice. H…
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…
Adaptive Quotient Filters
Richard Wen, Hunter McCoy, David Tench +6
Adaptive filters, such as telescoping and adaptive cuckoo filters, update their representation upon detecting a false positive to avoid repeating the same error in the future. Adap…