default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSurya Mathialagan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Adaptively Sound Zero-Knowledge SNARKs for UP. CRYPTO (10) 2024: 38-71- [c4]Mina Dalirrooyfard
, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. STOC 2024: 923-934 - [i7]Yael Kirkpatrick, Surya Mathialagan:
A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms. CoRR abs/2407.08562 (2024) - [i6]Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Adaptively Sound Zero-Knowledge SNARKs for UP. IACR Cryptol. ePrint Arch. 2024: 227 (2024) - [i5]Pedro Branco, Nico Döttling, Abhishek Jain, Giulio Malavolta, Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Pseudorandom Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2024: 1742 (2024) - 2023
- [j2]Surya Mathialagan, Adam Sheffer:
Distinct Distances on Non-Ruled Surfaces and Between Circles. Discret. Comput. Geom. 69(2): 422-452 (2023) - [c3]Surya Mathialagan, Neekon Vafa:
MacORAMa: Optimal Oblivious RAM with Integrity. CRYPTO (4) 2023: 95-127 - [c2]Surya Mathialagan:
Memory Checking for Parallel RAMs. TCC (2) 2023: 436-464 - [i4]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing Cliques from Smaller Cliques. CoRR abs/2307.15871 (2023) - [i3]Surya Mathialagan, Neekon Vafa:
MacORAMa: Optimal Oblivious RAM with Integrity. IACR Cryptol. ePrint Arch. 2023: 83 (2023) - [i2]Surya Mathialagan:
Memory Checking for Parallel RAMs. IACR Cryptol. ePrint Arch. 2023: 1703 (2023) - 2022
- [c1]Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. ICALP 2022: 94:1-94:20 - [i1]Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. CoRR abs/2204.10932 (2022) - 2021
- [j1]Surya Mathialagan:
On Bipartite Distinct Distances in the Plane. Electron. J. Comb. 28(4) (2021)
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-09 13:12 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:
