Maxim Sviridenko

Computer Science · Physical Sciences

38h-index6.0kcitations173works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Optimization and Search Problems(76), Complexity and Algorithms in Graphs(58), Optimization and Packing Problems(50), Scheduling and Optimization Algorithms(40), Computational Geometry and Mesh Generation(31)

Publications173 total

Gradient Descent Converges Linearly for Logistic Regression on Separable Data
arXiv (Cornell University)·2023Open Access
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime
arXiv (Cornell University)·2022Open Access
TSI
2021· 5 citedOpen Access
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search
2021· 3 citedOpen Access
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search
arXiv (Cornell University)·2021· 1 citedOpen Access
Local Search Algorithms for Rank-Constrained Convex Optimization
arXiv (Cornell University)·2021Open Access
Local Search Algorithms for Rank-Constrained Convex Optimization
arXiv (Cornell University)·2021Open Access
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding
arXiv (Cornell University)·2020Open Access
On the computational complexity of the probabilistic label tree algorithms
arXiv (Cornell University)·2019· 3 citedOpen Access
Submodular Optimization with Contention Resolution Extensions
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019Open Access
Solving Optimization Problems with Diseconomies of Scale via Decoupling
Journal of the ACM·2018· 11 cited
Matching Auctions for Search and Native Ads
2018· 8 cited
Integrated Supply Chain Management via Randomized Rounding
INFORMS journal on computing·2017
Maximizing Polynomials Subject to Assignment Constraints
ACM Transactions on Algorithms·2017
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
Mathematics of Operations Research·2017· 175 citedOpen Access
Sponsored Search Auctions with Rich Ads
2017· 13 citedOpen Access
Sponsored Search Auctions with Rich Ads
arXiv (Cornell University)·2017· 1 citedOpen Access
Greedy Minimization of Weakly Supermodular Set Functions
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017· 4 citedOpen Access
Determining Tournament Payout Structures for Daily Fantasy Sports
2017Open Access
Energy-efficient scheduling and routing via randomized rounding
Journal of Scheduling·2016· 36 citedOpen Access
page 1 of 9Next →

Frequent Co-authors

Nikhil Bansal(7), Jon Lee(6), Alexander Ageev(5), Vahab Mirrokni(5), Baruch Schieber(4), Justin Ward(3), Lisa Fleischer(3), Retsef Levi(3), Marc Uetz(3), Tracy Kimbrel(3), Refael Hassin(3), Viswanath Nagarajan(2), Moshe Lewenstein(2), Jan Vondrák(2), J. Vondrák(2), Alexander Kesselman(2), Zvi Lotker(2), Boaz Patt-Shamir(2), Michel X. Goemans(2), Don Coppersmith(2)