C. J. Argue

According to our database, C. J. Argue authored at least 9 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing.

C. J. Argue, Anupam Gupta, Marco Molinaro

Discret. Comput. Geom., October, 2023

Necessary and Sufficient Conditions for Rank-One-Generated Cones.

C. J. Argue, Fatma Kilinç-Karzan, Alex L. Wang

Math. Oper. Res., February, 2023

2022

Robust Secretary and Prophet Algorithms for Packing Integer Programs.

C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Learning from a Sample in Online Algorithms.

C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Chasing convex bodies with linear competitive ratio (invited paper).

C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Chasing Convex Bodies with Linear Competitive Ratio.

C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Dimension-Free Bounds for Chasing Convex Functions.

C. J. Argue, Anupam Gupta, Guru Guruganesh

Proceedings of the Conference on Learning Theory, 2020

2019

A Nearly-Linear Bound for Chasing Nested Convex Bodies.

C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2016

Covers in partitioned intersecting hypergraphs.

Ron Aharoni, C. J. Argue

Eur. J. Comb., 2016