Computer Science - Data Structures and Algorithms

Spectral Sparsification of Random-Walk Matrix Polynomials
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial …
Cite DOI URL
Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models
Motivated by a sampling problem basic to computational statistical inference, we develop a nearly optimal algorithm for a fundamental …
Cite DOI URL