default search action
Shubham Ugare
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Nandeeka Nayak
, Toluwanimi O. Odemuyiwa
TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators (Abstract). HOPC@SPAA 2024 - [c5]Tarun Suresh, Shubham Ugare, Gagandeep Singh
Is Watermarking LLM-Generated Code Robust? Tiny Papers @ ICLR 2024 - [c4]Shubham Ugare, Tarun Suresh, Debangshu Banerjee, Gagandeep Singh, Sasa Misailovic:
Incremental Randomized Smoothing Certification. ICLR 2024 - [i9]Shubham Ugare, Tarun Suresh, Hangoo Kang, Sasa Misailovic, Gagandeep Singh:
Improving LLM Code Generation with Grammar Augmentation. CoRR abs/2403.01632 (2024) - [i8]Tarun Suresh, Shubham Ugare, Gagandeep Singh, Sasa Misailovic:
Is Watermarking LLM-Generated Code Robust? CoRR abs/2403.17983 (2024) - [i7]Shubham Ugare, Rohan Gumaste, Tarun Suresh, Gagandeep Singh, Sasa Misailovic:
IterGen: Iterative Structured LLM Generation. CoRR abs/2410.07295 (2024) - [i6]Yuchen Yang, Shubham Ugare, Yifan Zhao, Gagandeep Singh, Sasa Misailovic:
ARQ: A Mixed-Precision Quantization Framework for Accurate and Certifiably Robust DNNs. CoRR abs/2410.24214 (2024) - 2023
- [j4]Shubham Ugare
Incremental Verification of Neural Networks. Proc. ACM Program. Lang. 7(PLDI): 1920-1945 (2023) - [c3]Nandeeka Nayak
TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators. MICRO 2023: 1255-1270 - [i5]Shubham Ugare, Debangshu Banerjee, Sasa Misailovic, Gagandeep Singh:
Incremental Verification of Neural Networks. CoRR abs/2304.01874 (2023) - [i4]Nandeeka Nayak, Toluwanimi O. Odemuyiwa, Shubham Ugare, Christopher W. Fletcher, Michael Pellauer, Joel S. Emer:
TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators. CoRR abs/2304.07931 (2023) - [i3]Shubham Ugare, Tarun Suresh, Debangshu Banerjee, Gagandeep Singh, Sasa Misailovic:
Incremental Randomized Smoothing Certification. CoRR abs/2305.19521 (2023) - 2022
- [j3]Shubham Ugare
Proof transfer for fast certification of multiple approximate neural networks. Proc. ACM Program. Lang. 6(OOPSLA1): 1-29 (2022) - [j2]Jacob Laurel
A general construction for abstract interpretation of higher-order automatic differentiation. Proc. ACM Program. Lang. 6(OOPSLA2): 1007-1035 (2022) - 2021
- [j1]Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti
Approximate query processing over static sets and sliding windows. Theor. Comput. Sci. 885: 1-14 (2021) - [c2]Jacob Laurel, Rem Yang
Statheros: Compiler for Efficient Low-Precision Probabilistic Programming. DAC 2021: 787-792 - 2020
- [i2]Javier Alvarez-Valle, Pratik Bhatu, Nishanth Chandran, Divya Gupta, Aditya V. Nori, Aseem Rastogi, Mayank Rathee, Rahul Sharma, Shubham Ugare:
Secure Medical Image Analysis with CrypTFlow. CoRR abs/2012.05064 (2020)
2010 – 2019
- 2018
- [c1]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti
Approximate Query Processing over Static Sets and Sliding Windows. ISAAC 2018: 54:1-54:12 - [i1]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. CoRR abs/1809.05419 (2018)
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 2024-12-03 20:31 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: