Shashwat Garg

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 25

Top Topics

Improved Algorithm

Related Problems

Top Venues

SIAM J. Comput.

Publications

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Shashwat Garg
Verification under TSO with an infinite Data Domain. CoRR (2024)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Shashwat Garg
Verification under TSO with an infinite Data Domain. TACAS (3) (2024)
Abhigyan Khaund, Abhishek Mukesh Sharma, Abhishek Tiwari, Shashwat Garg, Sriram Kailasam
RD-FCA: A resilient distributed framework for formal concept analysis. J. Parallel Distributed Comput. 179 (2023)
Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. Theory Comput. 15 (2019)
Shashwat Garg, Janardhan Kulkarni, Shi Li
Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time. SODA (2019)
Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. Theory Comput. 15 (2019)
Nikhil Bansal, Daniel Dadush, Shashwat Garg
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. SIAM J. Comput. 48 (2) (2019)
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. SIAM J. Comput. 47 (5) (2018)
Shashwat Garg
Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. ICALP (2018)
Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
The gram-schmidt walk: a cure for the Banaszczyk blues. STOC (2018)
Nikhil Bansal, Shashwat Garg
Algorithmic discrepancy beyond partial coloring. STOC (2017)
Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. CoRR (2017)
Shashwat Garg
Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. CoRR (2017)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. 57 (3) (2017)
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
Faster space-efficient algorithms for subset sum and k-sum. STOC (2017)
Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. CoRR (2016)
Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. APPROX-RANDOM (2016)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Tighter estimates for ϵ-nets for disks. Comput. Geom. 53 (2016)
Nikhil Bansal, Shashwat Garg
Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems. CoRR (2016)
Nikhil Bansal, Shashwat Garg
Algorithmic Discrepancy Beyond Partial Coloring. CoRR (2016)
Nikhil Bansal, Daniel Dadush, Shashwat Garg
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. FOCS (2016)
Nikhil Bansal, Daniel Dadush, Shashwat Garg
An Algorithm for Komlós Conjecture Matching Banaszczyk's bound. CoRR (2016)
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR (2016)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Improved Local Search for Geometric Hitting Set. STACS (2015)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Tighter Estimates for epsilon-nets for Disks. CoRR (2015)
Shashwat Garg, Krishna Kishore Dhara, Venkatesh Krishnaswamy
Predicting relevant documents for enterprise communication contexts. ICUIMC (2014)