Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Alexandra Lezkan
Claudia Calabrese
Andreas Langeland Teigen
Maria Concetta Palumbo
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Alexander Pollok
Radu Timofte
Kuanrui Yin
Home
/
Author
/
ERIC BALKANSKI
Author Info
Open Visualization
Name
Affiliation
Papers
ERIC BALKANSKI
Harvard University, Cambridge, MA, USA
16
Collaborators
Citations
PageRank
13
38
6.13
Referers
Referees
References
63
260
162
Search Limit
100
260
Publications (16 rows)
Collaborators (13 rows)
Referers (63 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
0
0.34
2020
A lower bound for parallel submodular minimization
1
0.37
2020
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.
6
0.44
2019
Learning to Optimize Combinatorial Functions.
1
0.36
2018
An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model.
0
0.34
2018
Secretary Ranking with Minimal Inversions
0
0.34
2018
The adaptive complexity of maximizing a submodular function.
8
0.52
2018
Approximation Guarantees for Adaptive Sampling.
2
0.38
2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations.
3
0.40
2018
The Importance of Communities for Learning to Influence
2
0.35
2018
The Sample Complexity of Optimizing a Convex Function.
1
0.36
2017
Minimizing a Submodular Function from Samples.
0
0.34
2017
Statistical Cost Sharing.
0
0.34
2017
The Power of Optimization from Samples.
0
0.34
2016
Bayesian Budget Feasibility with Posted Pricing
7
0.48
2015
The Limitations of Optimization from Samples
7
0.44
2015
1