Nathaniel Lahn
4 papers · 2019–2025 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
🐝 Cross-Pollinator (15) 🏃 Academic Marathon (6) 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (2) 🧭 Keyword Pioneer
🐣
Hot Topic Early Bird
🏆
Keyword Champion
(2)
Conferences
NIPS (3)
ICML (1)
Top co-authors
Keywords
optimal transport
(3)
graph algorithm
(2)
additive approximation
(2)
parallel computing
(1)
combinatorial algorithm
(1)
euclidean distance
(1)
gpu computing
(1)
approximation algorithm
(1)
computational geometry
(1)
additive error
(1)
maximum cardinality matching
(1)
hopcroft-karp algorithm
(1)
delta-disc graph
(1)
massive parallel computation
(1)
dijkstra algorithm
(1)
combinatorial optimization
(1)
bottleneck matching
(1)
bipartite matching
(1)
distributed computing
(1)
Papers
Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants
ICML 2025
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