default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSurendra Ghentiyala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c3]Surendra Ghentiyala, Venkatesan Guruswami:
New Constructions of Pseudorandom Codes. APPROX/RANDOM 2025: 54:1-54:22- [c2]Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz:
The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions. ITCS 2025: 14:1-14:22 - [i12]Karthik Gajulapalli, Surendra Ghentiyala, Zeyong Li, Sidhant Saraogi:
Downward self-reducibility in the total function polynomial hierarchy. CoRR abs/2507.19108 (2025) - [i11]Surendra Ghentiyala, Zeyong Li:
Hierarchies within TFNP: building blocks and collapses. CoRR abs/2507.21550 (2025) - [i10]James Cook, Surendra Ghentiyala, Ian Mertz, Edward Pyne, Nathan S. Sheffield:
The Structure of In-Place Space-Bounded Computation. CoRR abs/2510.12005 (2025) - [i9]Surendra Ghentiyala:
Efficient derandomization of differentially private counting queries. CoRR abs/2510.16959 (2025) - [i8]James Cook, Surendra Ghentiyala, Ian Mertz, Edward Pyne, Nathan S. Sheffield:
The Structure of In-Place Space-Bounded Computation. Electron. Colloquium Comput. Complex. TR25 (2025) - [i7]Karthik Gajulapalli, Surendra Ghentiyala, Zeyong Li, Sidhant Saraogi:
Downward self-reducibility in the total function polynomial hierarchy. Electron. Colloquium Comput. Complex. TR25 (2025) - [i6]Surendra Ghentiyala, Zeyong Li:
Hierarchies within TFNP: building blocks and collapses. Electron. Colloquium Comput. Complex. TR25 (2025) - [i5]Surendra Ghentiyala, Zeyong Li, Noah Stephens-Davidowitz:
Range avoidance, Arthur-Merlin, and TFNP. Electron. Colloquium Comput. Complex. TR25 (2025) - 2024
- [c1]Surendra Ghentiyala, Noah Stephens-Davidowitz:
More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More. APPROX/RANDOM 2024: 19:1-19:22 - [i4]Surendra Ghentiyala, Noah Stephens-Davidowitz:
More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more. CoRR abs/2408.08507 (2024) - [i3]Surendra Ghentiyala, Venkatesan Guruswami:
New constructions of pseudorandom codes. CoRR abs/2409.07580 (2024) - [i2]Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz:
The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. Electron. Colloquium Comput. Complex. TR24 (2024) - [i1]Surendra Ghentiyala, Venkatesan Guruswami:
New constructions of pseudorandom codes. IACR Cryptol. ePrint Arch. 2024: 1425 (2024) - 2023
- [j1]Seemanta Saha
, Surendra Ghentiyala, Shihua Lu, Lucas Bang, Tevfik Bultan:
Obtaining Information Leakage Bounds via Approximate Model Counting. Proc. ACM Program. Lang. 7(PLDI): 1488-1509 (2023)
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 2026-01-29 23: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:
