Pavel Kolev

Cited by

	All	Since 2017
Citations	165	160
h-index	7	7
i10-index	6	6

201520162017201820192020202120222 1 7 13 31 32 54 21

Public access

View all

7 articles

1 article

available

not available

Based on funding mandates

Co-authors

Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Andreas KarrenbauerSenior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, SaarbruckenVerified email at mpi-inf.mpg.de
Karl BringmannProfessor in Computer Science, Saarland UniversityVerified email at cs.uni-saarland.de
David WoodruffCarnegie Mellon UniversityVerified email at cs.cmu.edu
Vincenzo BonifaciAssociate Professor, Università Roma TreVerified email at uniroma3.it
Euiwoong LeeUniversity of MichiganVerified email at umich.edu
Gorav JindalMax Planck Institute for Informatics Verified email at mpi-inf.mpg.de
Richard PengUniversity of WaterlooVerified email at uwaterloo.ca
Saurabh SawlaniSoundHound Inc.Verified email at soundhound.com
Ruben BeckerGran Sasso Science InstituteVerified email at gssi.it

Pavel Kolev

Ph.D. Student, Max-Planck-Institut für Informatik

Verified email at mpi-inf.mpg.de - Homepage

Randomized Numerical Linear Algebra Spectral Graph Theory Machine Learning


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A PTAS for ℓ_p-Low Rank Approximation F Ban, V Bhattiprolu, K Bringmann, P Kolev, E Lee, DP Woodruff Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	42	2019
Secretary and online matching problems with machine learned advice A Antoniadis, T Gouleakis, P Kleer, P Kolev Advances in Neural Information Processing Systems 33, 7933-7944, 2020	39	2020
Density Independent Algorithms for Sparsifying -Step Random Walks G Jindal, P Kolev, R Peng, S Sawlani arXiv preprint arXiv:1702.06110, 2017	16	2017
Approximation Algorithms for -Low Rank Approximation K Bringmann, P Kolev, D Woodruff Advances in neural information processing systems 30, 2017	16	2017
Approximate Spectral Clustering: Efficiency and Guarantees P Kolev, K Mehlhorn arXiv preprint arXiv:1509.09188, 2015	15	2015
Two results on slime mold computations R Becker, V Bonifaci, A Karrenbauer, P Kolev, K Mehlhorn Theoretical Computer Science 773, 79-106, 2019	10	2019
An efficient parallel algorithm for spectral sparsification of laplacian and sddm matrix polynomials G Jindal, P Kolev arXiv preprint arXiv:1507.07497, 2015	8*	2015
Convergence of the non-uniform Physarum dynamics A Karrenbauer, P Kolev, K Mehlhorn Theoretical Computer Science 816, 260-269, 2020	7	2020
Physarum Multi-Commodity Flow Dynamics V Bonifaci, E Facca, F Folz, A Karrenbauer, P Kolev, K Mehlhorn, G Morigi, ... arXiv preprint arXiv:2009.01498, 2020	4	2020
Convergence of the non-uniform directed Physarum model E Facca, A Karrenbauer, P Kolev, K Mehlhorn Theoretical Computer Science 816, 184-194, 2020	4	2020
Physarum-inspired multi-commodity flow dynamics V Bonifaci, E Facca, F Folz, A Karrenbauer, P Kolev, K Mehlhorn, G Morigi, ... Theoretical Computer Science, 2022	2	2022
Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs P Kolev, H Sun International Symposium on Algorithms and Computation, 621-632, 2014	2	2014
Algorithmic Results for Clustering and Refined Physarum Analysis P Kolev Saarländische Universitäts-und Landesbibliothek, 2018		2018
Two Results on Slime Mold Computations P Kolev

The system can't perform the operation now. Try again later.

Articles 1–14

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors