Ali Vakilian
Cited by
Cited by
Scalable Fair Clustering
A Backurs, P Indyk, K Onak, B Schieber, A Vakilian, T Wagner
arXiv preprint arXiv:1902.03519, 2019
Learning-based frequency estimation algorithms
CY Hsu, P Indyk, D Katabi, A Vakilian
International Conference on Learning Representations, 2019
On streaming and communication complexity of the set cover problem
ED Demaine, P Indyk, S Mahabadi, A Vakilian
International Symposium on Distributed Computing, 484-498, 2014
Towards tight bounds for the streaming set cover problem
S Har-Peled, P Indyk, S Mahabadi, A Vakilian
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016
Prize-Collecting Survivable Network Design in Node-Weighted Graphs
C Chekuri, A Ene, A Vakilian
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
Node-weighted network design in planar and minor-closed families of graphs
C Chekuri, A Ene, A Vakilian
International Colloquium on Automata, Languages, and Programming, 206-217, 2012
Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements
A Ene, A Vakilian
STOC '14 Proceedings of the 46th Annual ACM Symposium on Theory of Computing …, 2014
Node-weighted prize-collecting survivable network design problems
A Vakilian
University of Illinois at Urbana-Champaign, 2013
Fractional set cover in the streaming model
P Indyk, S Mahabadi, R Rubinfeld, J Ullman, A Vakilian, A Yodpinyanee
20th International Workshop on Approximation Algorithms for Combinatorial …, 2017
Learning-based low-rank approximations
P Indyk, A Vakilian, Y Yuan
Advances in Neural Information Processing Systems, 7402-7412, 2019
Sample-Optimal Low-Rank Approximation of Distance Matrices
P Indyk, A Vakilian, T Wagner, D Woodruff
arXiv preprint arXiv:1906.00339, 2019
Local Computation Algorithms for Spanners
M Parter, R Rubinfeld, A Vakilian, A Yodpinyanee
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
ED Demaine, TD Goodrich, K Kloster, B Lavallee, QC Liu, BD Sullivan, ...
arXiv preprint arXiv:1806.02771, 2018
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
A Aamand, P Indyk, A Vakilian
arXiv preprint arXiv:1908.05198, 2019
Which concepts are worth extracting?
A Termehchy, A Vakilian, Y Chodpathumwan, M Winslett
Proceedings of the 2014 ACM SIGMOD international conference on Management of …, 2014
Set Cover in Sub-linear Time
P Indyk, S Mahabadi, R Rubinfeld, A Vakilian, A Yodpinyanee
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Connected domatic packings in node-capacitated graphs
A Ene, N Korula, A Vakilian
arXiv preprint arXiv:1305.4308, 2013
Improved Local Computation Algorithm for Set Cover via Sparsification
C Grunau, S Mitrović, R Rubinfeld, A Vakilian
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model
P Indyk, A Vakilian
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2019
Cost-Effective Conceptual Design Over Taxonomies
A Vakilian, Y Chodpathumwan, A Termehchy, A Nayyeri
Proceedings of the 20th International Workshop on the Web and Databases, 35-40, 2017
The system can't perform the operation now. Try again later.
Articles 1–20