Nathaniel Lahn
4 papers · 2019–2025 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
๐
Conference Polyglot ยท Bronze
๐
Academic Marathon ยท Sprint
๐
Interdisciplinary Bridge ยท Silver
๐ฃ
Hot Topic Early Bird
Venues
Top co-authors
Research topics
Keywords
optimal transport
(3)
additive approximation
(2)
graph algorithm
(2)
distributed computing
(1)
parallel computing
(1)
primal-dual algorithm
(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)
bottleneck matching
(1)
hierarchically well-separated trees
(1)
noise-resistant variant
(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
NeurIPS 2023
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning
NeurIPS 2021
A Graph Theoretic Additive Approximation of Optimal Transport
NeurIPS 2019