Surya Mathialagan

Orcid: 0000-0003-4904-3637

According to our database1, Surya Mathialagan authored at least 18 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Preprocessed 3SUM for Unknown Universes with Subquadratic Space.
CoRR, February, 2026

SNARGs for NP from Unprovability of Mathematical Theorems.
Electron. Colloquium Comput. Complex., 2026

SNARGs for NP from Unprovability of Mathematical Theorems (Or: How to Use the Simplicity of Cryptographic Reasoning).
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

SNARGs for NP and Non-signaling PCPs, Revisited.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
Universal SNARGs for NP from Proofs of Correctness.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

On Succinct Obfuscation via Propositional Proofs.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Simple and General Counterexamples for Private-Coin Evasive LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Incrementally Verifiable Computation for NP from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Pseudorandom Obfuscation and Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms.
CoRR, 2024

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Adaptively Sound Zero-Knowledge SNARKs for UP.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Distinct Distances on Non-Ruled Surfaces and Between Circles.
Discret. Comput. Geom., March, 2023

Listing Cliques from Smaller Cliques.
CoRR, 2023

Memory Checking for Parallel RAMs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

MacORAMa: Optimal Oblivious RAM with Integrity.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
On Bipartite Distinct Distances in the Plane.
Electron. J. Comb., 2021


  Loading...