E-LIB Suche - Ergebnisse für: Liu, Yang P.

1

Sparsifying Generalized Linear Models:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Jambulapati, Arun ; Lee, James R. ; Liu, Yang P.. - p. 1665-1675 , 2024

Link: https://dl.acm.org/doi/1..

2

Almost-Linear Time Algorithms for Incremental Graphs: Cycle..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Chen, Li ; Kyng, Rasmus ; Liu, Yang P... - p. 1165-1173 , 2024

Link: https://dl.acm.org/doi/1..

3

Discrepancy Minimization via a Self-Balancing Walk:

Alweiss, Ryan ; Liu, Yang P. ; Sawhney, Mehtaab S.
SIAM Journal on Computing. , 2024

Link: https://doi.org/10.1137/..

4

Online Edge Coloring via Tree Recurrences and Correlation D..:

Kulkarni, Janardhan ; Liu, Yang P. ; Sah, Ashwin..
SIAM Journal on Computing. 53 (2024) 1 - p. 87-110 , 2024

Link: https://doi.org/10.1137/..

5

Sparsifying Sums of Norms:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Jambulapati, Arun ; Lee, James R. ; Liu, Yang P.. - p. 1953-1962 , 2023

Link: https://doi.org/10.1109/..

6

Minor Sparsifiers and the Distributed Laplacian Paradigm:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Forster, Sebastian ; Goranci, Gramoz ; Liu, Yang P.... - p. 989-999 , 2022

Link: https://doi.org/10.1109/..

7

Optimal Sublinear Sampling of Spanning Trees and Determinan..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Anari, Nima ; Liu, Yang P. ; Vuong, Thuy-Duong - p. 123-134 , 2022

Link: https://doi.org/10.1109/..

8

An Exponential Separation Between MA and AM Proofs of Proxi..:

Gur, Tom ; Liu, Yang P. ; Rothblum, Ron D.
computational complexity. 30 (2021) 2 - p. , 2021

Link: https://doi.org/10.1007/..

9

Vertex sparsification for edge connectivity:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Chalermsook, Parinya ; Das, Syamantak ; Kook, Yunbum... - p. 1206-1225 , 2021

Link: https://dl.acm.org/doi/1..

10

Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),

Kathuria, Tarun ; Liu, Yang P. ; Sidford, Aaron - p. 119-130 , 2020

Link: https://doi.org/10.1109/..

11

Reproducibility and pseudo-determinism in log-space:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,

Grossman, Ofer ; Liu, Yang P. - p. 606-620 , 2019

Link: https://dl.acm.org/doi/1..

12

Optimal Sublinear Sampling of Spanning Trees and Determinan..:

Anari, Nima ; Liu, Yang P ; Vuong, Thuy-Duong
http://arxiv.org/abs/2204.02570. , 2022

Link: http://arxiv.org/abs/220..

13

A Gaussian Fixed Point Random Walk:

Liu, Yang P ; Sah, Ashwin ; Sawhney, Mehtaab
doi:10.4230/LIPIcs.ITCS.2022.101. , 2022

Link: https://doi.org/10.4230/..

14

Improved Iteration Complexities for Overconstrained $p$-Nor..:

Jambulapati, Arun ; Liu, Yang P ; Sidford, Aaron
http://arxiv.org/abs/2111.01848. , 2021

Link: http://arxiv.org/abs/211..

15

Arithmetic Progressions in Sumsets of Sparse Sets:

Alon, Noga ; Alweiss, Ryan ; Liu, Yang P..
http://hdl.handle.net/20.500.11850/524605. , 2021

Link: https://hdl.handle.net/2..