Gorav Jindal

activity

20122026

most citedAn Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials

2 citations · 4 across the 11 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.SC2017

Efficiently Computing Real Roots of Sparse Polynomials

Gorav Jindal, Michael Sagraloff

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f \in R [x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily…

cs.DS2017

Density Independent Algorithms for Sparsifying $k$ -Step Random Walks

Gorav Jindal, Pavel Kolev, Richard Peng +1

We give faster algorithms for producing sparse approximations of the transition matrices of $k$ -step random walks on undirected, weighted graphs. These transition matrices also for…

Efficiently Computing Real Roots of Sparse Polynomials

Density Independent Algorithms for Sparsifying k-Step Random Walks

Density Independent Algorithms for Sparsifying $k$ -Step Random Walks