See How Your Research Aligns
Create a free account to analyze your research alignment,
identify potential research gaps, and generate personalized
application documents for this professor.
Create Free Account
Kent Quanrud
Approximation Algorithms
Randomized Algorithms
Combinatorial Optimization
Continuous Optimization
Online Learning
About
My research is about the design and analysis of algorithms in theoretical computer science. I have worked on approximation algorithms, randomized algorithms, combinatorial optimization, continuous optimization, online learning, and discrete geometry. I am particularly interested in highly scalable algorithms for fundamental problems in optimization.
Research Performance Summary
2015-2026
Active Research Span
First Recorded Paper
Online learning with adversarial delays
Year:
2015
Citations:
141
Venue:
Advances in neural information processing systems 28
Latest Recorded Paper
Faster negative length shortest paths by bootstrapping hop reducers
Year:
2026
Citations:
5
Venue:
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.
Publication Venues and Collaboration
Journal, Conference, and Book Publication Breakdown
Top Coauthors
Quanrud
Chekuri
Har-Peled
Research Impact by Period
Papers
4
Citations
21
Avg. Citations / Paper
5.2
H-Index
2
Papers
59
Citations
399
Avg. Citations / Paper
6.8
H-Index
11
Papers
21
Citations
831
Avg. Citations / Paper
39.6
H-Index
14
Contact and Professional Links
Detected Research Keywords
Submodular Function Maximization
Approximation Algorithms Polynomial
Algorithms Polynomial Expansion
Polynomial Expansion Density
Expansion Density Graphs
Nearly Linear Time
Isolating Cuts Bi
Cuts Bi Submodularity
Bi Submodularity Faster
Submodularity Faster Algorithms