Billy Jin

Orcid: 0000-0002-6362-2048

According to our database1, Billy Jin authored at least 19 papers between 2020 and 2025.

Collaborative distances:

Timeline

2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
1
2
2
1
3
3
2
3
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles.
Math. Program., January, 2025

2024
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles.
SIAM J. Optim., 2024

Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization.
CoRR, 2024

Sample Complexity of Posted Pricing for a Single Item.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

A Lower Bound for the Max Entropy Algorithm for TSP.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

The Online Submodular Assignment Problem.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.
Algorithmica, December, 2023

Fluid Approximations for Revenue Management Under High-Variance Demand.
Manag. Sci., July, 2023

A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Proportionally Fair Online Allocation of Public Goods with Predictions.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Online Nash Social Welfare Maximization with Predictions.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The Two-Stripe Symmetric Circulant TSP is in P.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows.
CoRR, 2021

Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

High Probability Complexity Bounds for Line Search Based on Stochastic Oracles.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems.
CoRR, 2020

Online Nash Social Welfare via Promised Utilities.
CoRR, 2020

Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching.
CoRR, 2020


  Loading...