( en | de | ru )

 

Disambiguation of "Garg, Shashwat"

Author of the publication

copydeleteadd this publication to your clipboard
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound.

, , and . SIAM J. Comput., 48 (2): 534-553 (2019)

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.

Neil Garg

Animesh Garg

Dineshkumar Garg

Priya Garg

Martin Garg

 

Other publications of authors with the same name

Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time., , and . SODA, page 1570-1584. SIAM, (2019)Quasi-PTAS for Scheduling with Precedences using LP Hierarchies.. CoRR, (2017)An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound., , and . SIAM J. Comput., 48 (2): 534-553 (2019)Predicting relevant documents for enterprise communication contexts., , and . ICUIMC, page 41:1-41:8. ACM, (2014)The gram-schmidt walk: a cure for the Banaszczyk blues., , , and . STOC, page 587-597. ACM, (2018)Verification under TSO with an infinite Data Domain., , , and . TACAS (3), volume 14572 of Lecture Notes in Computer Science, page 276-295. Springer, (2024)The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues., , , and . CoRR, (2017)Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem., , , and . APPROX-RANDOM, volume 60 of LIPIcs, page 28:1-28:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Algorithmic discrepancy beyond partial coloring., and . STOC, page 914-926. ACM, (2017)Quasi-PTAS for Scheduling with Precedences using LP Hierarchies.. ICALP, volume 107 of LIPIcs, page 59:1-59:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)