( en | de | ru )

 

Disambiguation of "Gupta, Anupam"

Author of the publication

copydeleteadd this publication to your clipboard
An elementary proof of a theorem of Johnson and Lindenstrauss

, and . Random Structures & Algorithms, 22 (1): 60--65 (2003)
DOI: 10.1002/rsa.10073

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. You can also use the button next to the name to display some publications already assigned to the person.

Anupam Chattopadhyay

Anupam Singh

Anupam Karmakar

Anupam Sengupta

Ashutosh Kumar Gupta

 

Other publications of authors with the same name

Configuration Balancing for Stochastic Requests., , , , and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 127-141. Springer, (2023)Probing to Minimize., , and . ITCS, volume 215 of LIPIcs, page 120:1-120:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Matroid-Based TSP Rounding for Half-Integral Solutions., , , , , and . IPCO, volume 13265 of Lecture Notes in Computer Science, page 305-318. Springer, (2022)k-Servers with a Smile: Online Algorithms via Projections., , , and . SODA, page 98-116. SIAM, (2019)Approximate clustering without the approximation., , and . SODA, page 1068-1077. SIAM, (2009)Fully-Dynamic Submodular Cover with Bounded Recourse., and . FOCS, page 1147-1157. IEEE, (2020)Approximation Algorithms for Minimizing Average Distortion., , and . Theory Comput. Syst., 39 (1): 93-111 (2006)Stochastic Load Balancing on Unrelated Machines., , , and . CoRR, (2019)Minimizing Completion Times for Stochastic Jobs via Batched Free Times., , and . CoRR, (2022)Online Steiner Tree with Deletions., and . CoRR, (2013)