![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
C. J. Argue
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]C. J. Argue
, Anupam Gupta, Marco Molinaro:
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. 70(3): 773-789 (2023) - [j3]C. J. Argue
, Fatma Kilinç-Karzan
, Alex L. Wang
:
Necessary and Sufficient Conditions for Rank-One-Generated Cones. Math. Oper. Res. 48(1): 100-126 (2023) - 2022
- [c6]C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler:
Learning from a Sample in Online Algorithms. NeurIPS 2022 - [c5]C. J. Argue, Anupam Gupta
, Marco Molinaro, Sahil Singla
:
Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA 2022: 1273-1297 - 2021
- [j2]C. J. Argue, Anupam Gupta, Ziye Tang, Guru Guruganesh:
Chasing Convex Bodies with Linear Competitive Ratio. J. ACM 68(5): 32:1-32:10 (2021) - [c4]C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang:
Chasing convex bodies with linear competitive ratio (invited paper). STOC 2021: 5 - [i5]C. J. Argue, Anupam Gupta, Marco Molinaro:
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR abs/2104.07487 (2021) - [i4]C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla:
Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR abs/2112.12920 (2021) - 2020
- [c3]C. J. Argue, Anupam Gupta, Guru Guruganesh:
Dimension-Free Bounds for Chasing Convex Functions. COLT 2020: 219-241 - [c2]C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang:
Chasing Convex Bodies with Linear Competitive Ratio. SODA 2020: 1519-1524 - [i3]C. J. Argue, Anupam Gupta, Guru Guruganesh:
Dimension-Free Bounds on Chasing Convex Functions. CoRR abs/2005.14058 (2020)
2010 – 2019
- 2019
- [c1]C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee:
A Nearly-Linear Bound for Chasing Nested Convex Bodies. SODA 2019: 117-122 - [i2]C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang:
Chasing Convex Bodies with Linear Competitive Ratio. CoRR abs/1905.11877 (2019) - 2018
- [i1]C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee:
A Nearly-Linear Bound for Chasing Nested Convex Bodies. CoRR abs/1806.08865 (2018) - 2016
- [j1]Ron Aharoni, C. J. Argue:
Covers in partitioned intersecting hypergraphs. Eur. J. Comb. 51: 222-226 (2016)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint