default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShashwat Garg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Parosh Aziz Abdulla, Mohamed Faouzi Atig
, Florian Furbach, Shashwat Garg:
Verification under TSO with an infinite Data Domain. TACAS (3) 2024: 276-295- [i9]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Shashwat Garg:
Verification under TSO with an infinite Data Domain. CoRR abs/2401.10423 (2024) - 2023
- [j7]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: 104710 (2023)
2010 – 2019
- 2019
- [j6]Nikhil Bansal, Daniel Dadush, Shashwat Garg:
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. SIAM J. Comput. 48(2): 534-553 (2019) - [j5]Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. Theory Comput. 15: 1-27 (2019) - [j4]Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. Theory Comput. 15: 1-58 (2019) - [c9]Shashwat Garg, Janardhan Kulkarni, Shi Li:
Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time. SODA 2019: 1570-1584 - 2018
- [j3]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): 1755-1777 (2018) - [c8]Shashwat Garg:
Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. ICALP 2018: 59:1-59:13 - [c7]Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The gram-schmidt walk: a cure for the Banaszczyk blues. STOC 2018: 587-597 - 2017
- [j2]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. 57(3): 607-624 (2017) - [c6]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster space-efficient algorithms for subset sum and k-sum. STOC 2017: 198-209 - [c5]Nikhil Bansal, Shashwat Garg:
Algorithmic discrepancy beyond partial coloring. STOC 2017: 914-926 - [i8]Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett:
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. CoRR abs/1708.01079 (2017) - [i7]Shashwat Garg:
Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. CoRR abs/1708.04369 (2017) - 2016
- [j1]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Tighter estimates for ϵ-nets for disks. Comput. Geom. 53: 27-35 (2016) - [c4]Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. APPROX-RANDOM 2016: 28:1-28:12 - [c3]Nikhil Bansal, Daniel Dadush, Shashwat Garg:
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. FOCS 2016: 788-799 - [i6]Nikhil Bansal, Shashwat Garg:
Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems. CoRR abs/1601.03311 (2016) - [i5]Nikhil Bansal, Daniel Dadush, Shashwat Garg:
An Algorithm for Komlós Conjecture Matching Banaszczyk's bound. CoRR abs/1605.02882 (2016) - [i4]Nikhil Bansal, Shashwat Garg:
Algorithmic Discrepancy Beyond Partial Coloring. CoRR abs/1611.01805 (2016) - [i3]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR abs/1612.02788 (2016) - [i2]Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. CoRR abs/1612.04304 (2016) - 2015
- [c2]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Improved Local Search for Geometric Hitting Set. STACS 2015: 184-196 - [i1]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Tighter Estimates for epsilon-nets for Disks. CoRR abs/1501.03246 (2015) - 2014
- [c1]Shashwat Garg, Krishna Kishore Dhara, Venkatesh Krishnaswamy:
Predicting relevant documents for enterprise communication contexts. ICUIMC 2014: 41:1-41:8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
