The following pages link to Eric Balkanski (Q2164673):
Displayed 11 items.
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- On the state complexity of partial word DFAs (Q2344741) (← links)
- The limitations of optimization from samples (Q4978042) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- On the Construction of Substitutes (Q5108266) (← links)
- A lower bound for parallel submodular minimization (Q5144903) (← links)
- An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model (Q5212748) (← links)
- The adaptive complexity of maximizing a submodular function (Q5230369) (← links)
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation (Q5236200) (← links)
- Partial Word DFAs (Q5327481) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)