Anubhav Baweja

Orcid: 0000-0001-5563-0630

According to our database1, Anubhav Baweja authored at least 11 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Query-Optimal IOPPs for Linear-Time Encodable Codes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
FICS and FACS: Fast IOPPs and Accumulation via Code-Switching.
IACR Cryptol. ePrint Arch., 2025

Time-Space Trade-Offs for Sumcheck.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Average Distortion Sketching.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
Scribe: Low-memory SNARKs via Read-Write Streaming.
IACR Cryptol. ePrint Arch., 2024

2022
An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
ForestDSH: a universal hash design for discrete probability distributions.
Data Min. Knowl. Discov., 2021

An Efficient Semi-Streaming PTAS for Tournament Feedback ArcSet with Few Passes.
CoRR, 2021

Efficient Parallel Self-Adjusting Computation.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2019
Tree-wise Distribution Sensitive hashing: Efficient Maximum likelihood Classification by joint dimensionality reduction in known probabilistic settings.
CoRR, 2019

2016
A Constant Optimization of the Binary Indexed Tree Query Operation.
CoRR, 2016


  Loading...