I agree that this site is using cookies. You can find further informations here.
X
Jambulapati, Arun
47  results:
Search for persons X
?
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

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

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

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

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..
 
?
8

Improved iteration complexities for overconstrained p-norm ..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Jambulapati, Arun ; Liu, Yang P. ; Sidford, Aaron - p. 529-542 , 2022
Link: https://dl.acm.org/doi/1..
 
?
9

Ultrasparse ultrasparsifiers and faster laplacian system so..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Jambulapati, Arun ; Sidford, Aaron - p. 540-559 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Ultrasparse Ultrasparsifiers and Faster Laplacian System So..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Jambulapati, Arun ; Sidford, Aaron - p. 540-559 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Positive semidefinite programming: mixed, parallel, and wid..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Jambulapati, Arun ; Lee, Yin Tat ; Li, Jerry.. - p. 789-802 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Perron-frobenius theory in nearly linear time : positive..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Ahmadinejad, AmirMahdi ; Jambulapati, Arun ; Saberi, Amin. - p. 1387-1404 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

Parallel Reachability in Almost Linear Work and Square Root..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Liu, Yang P. ; Jambulapati, Arun ; Sidford, Aaron - p. 1664-1686 , 2019
Link: https://doi.org/10.1109/..
 
?
14

Efficient Õ(n/∊) Spectral Sketches for the Laplacian and it..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Jambulapati, Arun ; Sidford, Aaron - p. 2487-2503 , 2018
Link: https://doi.org/10.1137/..
 
?
15

Efficient Õ(n/ϵ) spectral sketches for the laplacian and it..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Jambulapati, Arun ; Sidford, Aaron - p. 2487-2503 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15