Pavel Kolev

Ph.D

Max-Planck-Institut für Informatik

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

Research Interests
Machine Learning
Low Rank Approximation
Physarum Dynamics
Randomized Linear Algebra
Spectral Graph Theory

Papers20 papers

Sort

By YearBy Citation

Secretary and Online Matching Problems with Machine Learned Advice

Antoniadis Antonios,Gouleakis Themis,Kleer Pieter,Kolev Pavel

NIPS 2020, (2020)

EIBibtex

Physarum Multi-Commodity Flow Dynamics

Vincenzo Bonifaci, Enrico Facca, Frederic Folz,Andreas Karrenbauer,Pavel Kolev,Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande

Bibtex

Convergence of the Non-Uniform Directed Physarum Model

Enrico Facca,Andreas Karrenbauer,Pavel Kolev,Kurt Mehlhorn

Theoretical Computer Science, (2020): 184-194

EIBibtex

Convergence of the non-uniform Physarum dynamics

Andreas Karrenbauer,Pavel Kolev,Kurt Mehlhorn

Theoretical Computer Science, (2020): 260-269

Cited by2EIBibtex

Two Results on Slime Mold Computations

Ruben Becker,Vincenzo Bonifaci,Andreas Karrenbauer,Pavel Kolev,Kurt Mehlhorn

Theor. Comput. Sci., (2019)

Cited by7EIBibtex

Convergence of the Non-Uniform Directed Physarum Model

Enrico Facca,Andreas Karrenbauer,Pavel Kolev,Kurt Mehlhorn

CoRR, (2019)

Cited by1EIBibtex

A PTAS for ℓp-Low Rank Approximation

Frank Ban, Vijay Bhattiprolu,Karl Bringmann,Pavel Kolev,Euiwoong Lee,David P. Woodruff

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp.747-766, (2019)

Cited by20EIBibtex

Convergence of the Non-Uniform Physarum Dynamics

Andreas Karrenbauer,Pavel Kolev,Kurt Mehlhorn

arXiv: Data Structures and Algorithms, (2019)

Cited by3EIBibtex

A PTAS for l_p-Low Rank Approximation

Frank Ban,Vijay Bhattiprolu,Karl Bringmann,Pavel Kolev,Euiwoong Lee,David P. Woodruff

symposium on discrete algorithms, pp.747-766, (2019)

Bibtex

Approximation Algorithms for l_0-Low Rank Approximation

Karl Bringmann,Pavel Kolev,David Woodruff

neural information processing systems, pp.6648-6659, (2018)

Bibtex

A PTAS for $\ell_p$-Low Rank Approximation

Frank Ban,Vijay Bhattiprolu,Karl Bringmann,Pavel Kolev,Euiwoong Lee,David P. Woodruff

arXiv: Data Structures and Algorithms, (2018)

Bibtex

Algorithmic Results for Clustering and Refined Physarum Analysis

Pavel Kolev

(2018)

Bibtex

Approximation Algorithms for l 0 -Low Rank Approximation

Karl Bringmann,Pavel Kolev,David P. Woodruff

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), (2017): 6651-6662

Bibtex

Density Independent Algorithms for Sparsifying k-Step Random Walks

Gorav Jindal,Pavel Kolev,Richard Peng,Saurabh Sawlani

APPROX-RANDOM, (2017)

Cited by14EIBibtex

Approximation Algorithms for l0-Low Rank Approximation

Karl Bringmann,Pavel Kolev,David P. Woodruff

NIPS, pp.6651-6662, (2017)

Cited by13EIBibtex

Approximation Algorithms for $\ell_0$-Low Rank Approximation

Karl Bringmann,Pavel Kolev,David P. Woodruff

neural information processing systems, pp.6648-6659, (2017)

Bibtex

A Note On Spectral Clustering

Pavel Kolev,Kurt Mehlhorn

ESA, (2016)

Cited by4EIBibtex

Approximate Spectral Clustering: Efficiency and Guarantees

Pavel Kolev,Kurt Mehlhorn

arXiv: Discrete Mathematics, (2015)

Cited by12Bibtex

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

Gorav Jindal,Pavel Kolev

(2015)

Cited by7Bibtex

Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs

Pavel Kolev,He Sun

ALGORITHMS AND COMPUTATION, ISAAC 2014, (2014): 621-632

Cited by2EIBibtex

View All

Base Info Papers Patents Projects