Sharath Raghvendra
9 papers · 2019–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Conference Polyglot (3) π Academic Marathon (6) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (12) π§ Keyword Pioneer
π£
Hot Topic Early Bird
π
Cross-Pollinator
(15)
Conferences
NIPS (5)
ICLR (2)
ICML (2)
Top co-authors
Keywords
optimal transport
(4)
combinatorial optimization
(2)
bipartite matching
(2)
combinatorial algorithm
(2)
approximation algorithm
(2)
graph algorithm
(2)
additive approximation
(2)
parallel computing
(1)
discrete optimization
(1)
dijkstra algorithm
(1)
euclidean distance
(1)
gpu computing
(1)
semi-discrete transport
(1)
weighted nearest neighbor
(1)
computational geometry
(1)
additive error
(1)
maximum cardinality matching
(1)
hopcroft-karp algorithm
(1)
delta-disc graph
(1)
divide and conquer algorithm
(1)
Papers
Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants
ICML 2025
A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem
NIPS 2024
A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions
ICML 2024
A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem
NIPS 2023
Computing all Optimal Partial Transports
ICLR 2023
A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance
ICLR 2023
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings
NIPS 2023
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning
NIPS 2021
A Graph Theoretic Additive Approximation of Optimal Transport
NIPS 2019