Joshua R. Wang

Emmanouil-Vasileios Vlatakis-Gkaragkounis

Proceedings of the ACM on Web Conference 2024, 2024

Contracting with a Learning Agent.

[BibT_eX]

[DOI]

S. Matthew Weinberg

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

New Tools for Peak Memory Scheduling.

[BibT_eX]

[DOI]

CoRR, 2023

The Power of Menus in Contract Design.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Optimal No-Regret Learning for One-Sided Lipschitz Functions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Efficient Caching with Reserves via Marking.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Scheduling with Communication Delay in Near-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Caching with Reserves.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization.

[BibT_eX]

[DOI]

Ashwinkumar Badanidiyuru

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Contracts under Moral Hazard and Adverse Selection.

[BibT_eX]

[DOI]

Guru Guruganesh

Jon Schneider

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Margin-Independent Online Multiclass Learning via Convex Geometry.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2019

Efficient Rematerialization for Deep Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Recursive Sketches for Modular Deep Learning.

[BibT_eX]

[DOI]

Badih Ghazi

Rina Panigrahy

Proceedings of the 36th International Conference on Machine Learning, 2019

On the Computational Power of Online Gradient Descent.

[BibT_eX]

[DOI]

Vaggos Chatziafratis

Proceedings of the Conference on Learning Theory, 2019

2018

Theoretical models for practical problems: dynamic data structures, hierarchical clustering, and modern parallel computing.

[BibT_eX]

[DOI]

PhD thesis, 2018

An Optimal Algorithm for Online Unconstrained Submodular Maximization.

[BibT_eX]

[DOI]

CoRR, 2018

Cell-probe lower bounds from online communication complexity.

[BibT_eX]

[DOI]

Josh Alman

Huacheng Yu

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.

[BibT_eX]

[DOI]

Rad Niazadeh

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

2017

Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search.

[BibT_eX]

[DOI]

Benjamin Moseley

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016

Exact Algorithms and Strong Exponential Time Hypothesis.

[BibT_eX]

[DOI]

Richard Ryan Williams

Encyclopedia of Algorithms, 2016

Deterministic Time-Space Tradeoffs for k-SUM.

[BibT_eX]

[DOI]

Andrea Lincoln

R. Ryan Williams

CoRR, 2016

Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation).

[BibT_eX]

[DOI]

Sergei Vassilvitskii

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.

[BibT_eX]

[DOI]

Amir Abboud

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Minimizing Regret with Multiple Reserves.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Deterministic Time-Space Trade-Offs for k-SUM.

[BibT_eX]

[DOI]

Andrea Lincoln

R. Ryan Williams

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Complexity of the k-means Method.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter.

[BibT_eX]

[DOI]

Amir Abboud

CoRR, 2015

Finding Four-Node Subgraphs in Triangle Time.

[BibT_eX]

[DOI]

Richard Ryan Williams

Huacheng Yu

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Space-Efficient Randomized Algorithms for K-SUM.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Space-Efficient Las Vegas Algorithms for K-SUM

[BibT_eX]

[DOI]