( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.

. SODA, стр. 692-701. ACM/SIAM, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Aravind Sekhar

Aravind Pasula

Aravind Bedekar

Aravind Sundaresan

Aravind Kalaiah

 

Другие публикации лиц с тем же именем

Algorithms to Approximate Column-Sparse Packing Problems., , , и . CoRR, (2017)Online Resource Allocation with Matching Constraints., , , , , и . AAMAS, стр. 1681-1689. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks., , , и . INSS, стр. 93-96. IEEE, (2010)Efficient algorithms for location and sizing problems in network design., , , , и . GLOBECOM, стр. 2586-2590. IEEE, (2001)Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare., , , , , и . WINE, том 11920 из Lecture Notes in Computer Science, стр. 129-141. Springer, (2019)Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.. SODA, стр. 692-701. ACM/SIAM, (1997)Review of Visions of Infinity: The Great Mathematical Problems by Ian Stewart.. SIGACT News, 45 (4): 41-45 (2014)Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families., , , и . RANDOM-APPROX, том 1671 из Lecture Notes in Computer Science, стр. 11-15. Springer, (1999)Approximation Algorithms for Channel Allocation Problems in Broadcast Networks., , , и . RANDOM-APPROX, том 2764 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2003)Your friends have more friends than you do: identifying influential mobile users through random walks., и . MobiHoc, стр. 5-14. ACM, (2012)