Surendra Ghentiyala

Orcid: 0009-0007-6968-4059

According to our database1, Surendra Ghentiyala authored at least 10 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Range Avoidance, Arthur-Merlin, and TFNP.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Efficient derandomization of differentially private counting queries.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

Downward self-reducibility in the total function polynomial hierarchy.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Hierarchies within TFNP: building blocks and collapses.
Electron. Colloquium Comput. Complex., 2025

The Structure of In-Place Space-Bounded Computation.
Electron. Colloquium Comput. Complex., 2025

The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

New Constructions of Pseudorandom Codes.
Proceedings of the Approximation, 2025

2024
The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices.
Electron. Colloquium Comput. Complex., 2024

More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More.
Proceedings of the Approximation, 2024

2023
Obtaining Information Leakage Bounds via Approximate Model Counting.
Proc. ACM Program. Lang., 2023


  Loading...