Anubhav Baweja

According to our database, Anubhav Baweja authored at least 10 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

FICS and FACS: Fast IOPPs and Accumulation via Code-Switching.

Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Matan Shtepel

IACR Cryptol. ePrint Arch., 2025

Time-Space Trade-Offs for Sumcheck.

Anubhav Baweja, Alessandro Chiesa, Elisabetta Fedele, Giacomo Fenzi, Pratyush Mishra, Tushar Mopuri, Andrew Zitek-Estrada

IACR Cryptol. ePrint Arch., 2025

2024

Scribe: Low-memory SNARKs via Read-Write Streaming.

Anubhav Baweja, Pratyush Mishra, Tushar Mopuri, Karan Newatia, Steve Wang

IACR Cryptol. ePrint Arch., 2024

Average-Distortion Sketching.

Yiqiao Bao, Anubhav Baweja, Nicolas Menand, Erik Waingarten, Nathan White, Tian Zhang

CoRR, 2024

2022

An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes.

Anubhav Baweja, Justin Jia, David P. Woodruff

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

ForestDSH: a universal hash design for discrete probability distributions.

Arash Gholami Davoodi, Sean Chang, Hyun Gon Yoo, Anubhav Baweja, Mihir Mongia, Hosein Mohimani

Data Min. Knowl. Discov., 2021

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

Anubhav Baweja, Justin Jia, David P. Woodruff

CoRR, 2021

Efficient Parallel Self-Adjusting Computation.

Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar

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.

Arash Gholami Davoodi, Anubhav Baweja, Hosein Mohimani

CoRR, 2019

2016

A Constant Optimization of the Binary Indexed Tree Query Operation.

Anubhav Baweja

CoRR, 2016