Shashwat Garg

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