Seuraa
Billy Jin
Billy Jin
Vahvistettu sähköpostiosoite verkkotunnuksessa cornell.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Online nash social welfare maximization with predictions
S Banerjee, V Gkatzelis, A Gorokh, B Jin
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
412022
High probability complexity bounds for line search based on stochastic oracles
B Jin, K Scheinberg, M Xie
Advances in Neural Information Processing Systems 34, 9193-9203, 2021
222021
Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model
B Jin, W Ma
Advances in Neural Information Processing Systems 35, 14555-14567, 2022
172022
Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
B Jin, DP Williamson
International Conference on Web and Internet Economics, 207-225, 2021
112021
Proportionally fair online allocation of public goods with predictions
S Banerjee, V Gkatzelis, S Hossain, B Jin, E Micha, N Shah
arXiv preprint arXiv:2209.15305, 2022
82022
Fluid approximations for revenue management under high-variance demand
Y Bai, O El Housni, B Jin, P Rusmevichientong, H Topaloglu, ...
Management Science 69 (7), 4016-4026, 2023
72023
Improved analysis of ranking for online vertex-weighted bipartite matching
B Jin, DP Williamson
arXiv preprint arXiv:2007.12823, 2020
72020
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles
B Jin, K Scheinberg, M Xie
arXiv preprint arXiv:2303.06838, 2023
42023
High probability complexity bounds for adaptive step search based on stochastic oracles
B Jin, K Scheinberg, M Xie
arXiv preprint arXiv:2106.06454, 2021
42021
The Two-Stripe Symmetric Circulant TSP is in P
SC Gutekunst, B Jin, DP Williamson
International Conference on Integer Programming and Combinatorial …, 2022
22022
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows
M Henzinger, B Jin, R Peng, DP Williamson
arXiv preprint arXiv:2109.00653, 2021
22021
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
M Henzinger, B Jin, R Peng, DP Williamson
Algorithmica 85 (12), 3680-3716, 2023
12023
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
B Jin, N Klein, DP Williamson
International Conference on Integer Programming and Combinatorial …, 2023
12023
Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization
D Hathcock, B Jin, K Patton, S Sarkar, M Zlatin
arXiv preprint arXiv:2401.06981, 2024
2024
A Lower Bound for the Max Entropy Algorithm for TSP
B Jin, N Klein, DP Williamson
arXiv preprint arXiv:2311.01950, 2023
2023
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Systems
M Henzinger, B Jin, R Peng, DP Williamson
Leibniz international proceedings in informatics 251, 2023
2023
Online Nash Social Welfare Maximization with Predictions
A Gorokh, S Banerjee, B Jin, V Gkatzelis
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms, 2022
2022
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems.
M Henzinger, B Jin, DP Williamson
CoRR, 2020
2020
High Probability Step Size Lower Bound for Adaptive Stochastic Optimization
B Jin, K Scheinberg, M Xie
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–19