Pavel Kolev

activity

20152026

most citedTwo Results on Slime Mold Computations

12 citations · 42 across the 21 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.DS2017

Approximation Algorithms for $ℓ_{0}$ -Low Rank Approximation

Karl Bringmann, Pavel Kolev, David P. Woodruff

We study the $ℓ_{0}$ -Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$ , to output a rank- $k$ matrix $A^{'}$ for which $∥ A^{'} - A ∥_{0}$ is minimized. Her…

cs.DS2017★ 12 cited

Two Results on Slime Mold Computations

Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer +2

We present two results on slime mold computations. In wet-lab experiments (Nature'00) by Nakagaki et al. the slime mold Physarum polycephalum demonstrated its ability to solve shor…

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…

Approximation Algorithms for ℓ0​-Low Rank Approximation

Two Results on Slime Mold Computations

Density Independent Algorithms for Sparsifying k-Step Random Walks

Approximation Algorithms for $ℓ_{0}$ -Low Rank Approximation

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