E-LIB Suche - Ergebnisse für: Sidford, Aaron

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

Towards optimal running times for optimal transport:

Blanchet, Jose ; Jambulapati, Arun ; Kent, Carson.
Operations Research Letters. 52 (2024) - p. 107054 , 2024

Link: https://doi.org/10.1016/..

3

Ultrasparse Ultrasparsifiers and Faster Laplacian System So..:

Jambulapati, Arun ; Sidford, Aaron
ACM Transactions on Algorithms. , 2024

Link: https://doi.org/10.1145/..

4

Near-Optimal Dynamic Rounding of Fractional Matchings in Bi..:

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

Bhattacharya, Sayan ; Kiss, Peter ; Sidford, Aaron. - p. 59-70 , 2024

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

5

Dynamic Maxflow via Dynamic Interior Point Methods:

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

van den Brand, Jan ; Liu, Yang P. ; Sidford, Aaron - p. 1215-1228 , 2023

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

6

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/..

7

ReSQueing Parallel and Private Stochastic Convex Optimizati..:

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

Carmon, Yair ; Jambulapati, Arun ; Jin, Yujia... - p. 2031-2058 , 2023

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

8

A Deterministic Almost-Linear Time Algorithm for Minimum-Co..:

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

Brand, Jan Van Den ; Chen, Li ; Kyng, Rasmus... - p. 503-514 , 2023

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

9

Chaining, Group Leverage Score Overestimates, and Fast Spec..:

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

Jambulapati, Arun ; Liu, Yang P. ; Sidford, Aaron - p. 196-206 , 2023

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

10

Matrix Completion in Almost-Verification Time:

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

Kelner, Jonathan A. ; Li, Jerry ; Liu, Allen.. - p. 2102-2128 , 2023

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

11

Singular Value Approximation and Sparsifying Random Walks o..:

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

Ahmadinejad, AmirMahdi ; Peebles, John ; Pyne, Edward.. - p. 846-854 , 2023

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

12

Sparse Submodular Function Minimization:

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

Graur, Andrei ; Jiang, Haotian ; Sidford, Aaron - p. 2071-2080 , 2023

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

13

Improved Lower Bounds for Submodular Function Minimization:

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

Chakrabarty, Deeparnab ; Graur, Andrei ; Jiang, Haotian. - p. 245-254 , 2022

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

14

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

Kathuria, Tarun ; Liu, Yang P. ; Sidford, Aaron
SIAM Journal on Computing. , 2022

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

15

Faster maxflow via improved dynamic spectral vertex sparsif..:

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

van den Brand, Jan ; Gao, Yu ; Jambulapati, Arun... - p. 543-556 , 2022

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