Alan Kuhnle
10 papers · 2018–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
π Interdisciplinary Bridge π§ Keyword Pioneer π Cross-Pollinator (9) πΊοΈ Taxonomy Completionist (10) π£ Hot Topic Early Bird
π
Conference Polyglot
(4)
π
Academic Marathon
(7)
πΊ
Lone Wolf
(3)
π
Keyword Champion
(2)
π
Century Club
(10)
Conferences
ICML (3)
NIPS (3)
AAAI (2)
AISTATS (2)
Top co-authors
Keywords
submodular maximization
(6)
cardinality constraint
(5)
approximation algorithm
(4)
query complexity
(3)
greedy algorithm
(3)
approximation ratio
(3)
adaptive complexity
(2)
combinatorial optimization
(2)
submodular optimization
(2)
non-submodular function
(1)
integer lattice
(1)
linear time
(1)
deterministic algorithm
(1)
value oracle
(1)
combinatorial algorithm
(1)
influence maximization
(1)
online algorithm
(1)
streaming algorithm
(1)
parallel algorithm
(1)
distributed algorithm
(1)
Papers
Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
ICML 2025
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
AISTATS 2025
Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization
NIPS 2024
DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization
AAAI 2023
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
AISTATS 2021
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
NIPS 2021
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization
AAAI 2021
Submodular Cost Submodular Cover with an Approximate Oracle
ICML 2019
Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time
NIPS 2019
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
ICML 2018