C. J. Argue - RankMe

15 papers A* 6Journal 9

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. C. J. Argue, Anupam Gupta, Marco Molinaro
2023	J	`jnl`	Necessary and Sufficient Conditions for Rank-One-Generated Cones. Math. Oper. Res. C. J. Argue, Fatma Kilinç-Karzan, Alex L. Wang
2022	A*	`conf`	Learning from a Sample in Online Algorithms. NeurIPS C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler
2022	A*	`conf`	Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
2021	J	`jnl`	Chasing Convex Bodies with Linear Competitive Ratio. J. ACM C. J. Argue, Anupam Gupta, Ziye Tang, Guru Guruganesh
2021	A*	`conf`	Chasing convex bodies with linear competitive ratio (invited paper). STOC C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2021	J	`jnl`	Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR C. J. Argue, Anupam Gupta, Marco Molinaro
2021	J	`jnl`	Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
2020	A*	`conf`	Chasing Convex Bodies with Linear Competitive Ratio. SODA C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2020	A*	`conf`	Dimension-Free Bounds for Chasing Convex Functions. COLT C. J. Argue, Anupam Gupta, Guru Guruganesh
2020	J	`jnl`	Dimension-Free Bounds on Chasing Convex Functions. CoRR C. J. Argue, Anupam Gupta, Guru Guruganesh
2019	A*	`conf`	A Nearly-Linear Bound for Chasing Nested Convex Bodies. SODA C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee
2019	J	`jnl`	Chasing Convex Bodies with Linear Competitive Ratio. CoRR C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2018	J	`jnl`	A Nearly-Linear Bound for Chasing Nested Convex Bodies. CoRR C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee
2016	J	`jnl`	Covers in partitioned intersecting hypergraphs. Eur. J. Comb. Ron Aharoni, C. J. Argue