default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBilly Jin
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Billy Jin
, Katya Scheinberg, Miaolan Xie:
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles. SIAM J. Optim. 34(3): 2411-2439 (2024)- [c9]Billy Jin, Nathan Klein, David P. Williamson:
A Lower Bound for the Max Entropy Algorithm for TSP. IPCO 2024: 238-251 - [i11]Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin:
Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization. CoRR abs/2401.06981 (2024) - [i10]Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla:
Sample Complexity of Posted Pricing for a Single Item. CoRR abs/2406.00819 (2024) - 2023
- [j2]Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson:
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. Algorithmica 85(12): 3680-3716 (2023) - [j1]Yicheng Bai, Omar El Housni, Billy Jin, Paat Rusmevichientong, Huseyin Topaloglu, David P. Williamson:
Fluid Approximations for Revenue Management Under High-Variance Demand. Manag. Sci. 69(7): 4016-4026 (2023) - [c8]Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain, Billy Jin, Evi Micha, Nisarg Shah:
Proportionally Fair Online Allocation of Public Goods with Predictions. IJCAI 2023: 20-28 - [c7]Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson:
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. ITCS 2023: 69:1-69:22 - [c6]Billy Jin, Nathan Klein, David P. Williamson:
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. IPCO 2023: 217-230 - [i9]Billy Jin, Nathan Klein, David P. Williamson:
A Lower Bound for the Max Entropy Algorithm for TSP. CoRR abs/2311.01950 (2023) - 2022
- [c5]Samuel C. Gutekunst, Billy Jin, David P. Williamson:
The Two-Stripe Symmetric Circulant TSP is in P. IPCO 2022: 319-332 - [c4]Billy Jin, Will Ma:
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. NeurIPS 2022 - [c3]Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh, Billy Jin:
Online Nash Social Welfare Maximization with Predictions. SODA 2022: 1-19 - [i8]Billy Jin, Will Ma:
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. CoRR abs/2206.11397 (2022) - [i7]Samuel C. Gutekunst, Billy Jin, David P. Williamson:
The Two-Stripe Symmetric Circulant TSP is in P. CoRR abs/2207.10254 (2022) - [i6]Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain, Billy Jin, Evi Micha, Nisarg Shah:
Proportionally Fair Online Allocation of Public Goods with Predictions. CoRR abs/2209.15305 (2022) - [i5]Billy Jin, Nathan Klein, David P. Williamson:
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. CoRR abs/2211.04639 (2022) - 2021
- [c2]Billy Jin, Katya Scheinberg, Miaolan Xie:
High Probability Complexity Bounds for Line Search Based on Stochastic Oracles. NeurIPS 2021: 9193-9203 - [c1]Billy Jin, David P. Williamson:
Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model. WINE 2021: 207-225 - [i4]Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson:
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. CoRR abs/2109.00653 (2021) - 2020
- [i3]Billy Jin, David P. Williamson:
Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching. CoRR abs/2007.12823 (2020) - [i2]Artur Gorokh, Siddhartha Banerjee, Billy Jin, Vasilis Gkatzelis:
Online Nash Social Welfare via Promised Utilities. CoRR abs/2008.03564 (2020) - [i1]Monika Henzinger, Billy Jin, David P. Williamson:
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. CoRR abs/2010.16316 (2020)
Coauthor Index
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-07-20 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
