Mitali Bafna

Orcid: 0000-0002-3003-2017

According to our database1, Mitali Bafna authored at least 19 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Constant Degree Direct Product Testers with Small Soundness.
Electron. Colloquium Comput. Complex., 2024

Quasi-Linear Size PCPs with Small Soundness from HDX.
CoRR, 2024

Rounding Large Independent Sets on Expanders.
CoRR, 2024

Solving Unique Games over Globally Hypercontractive Graphs.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
Characterizing Direct Product Testing via Coboundary Expansion.
Electron. Colloquium Comput. Complex., 2023

2022
Hypercontractivity on high dimensional expanders.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Polynomial-Time Power-Sum Decomposition of Polynomials.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments.
Electron. Colloquium Comput. Complex., 2021

Playing unique games on certified small-set expanders.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Optimal Fine-Grained Hardness of Approximation of Linear Equations.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Local decoding and testing of polynomials over grids.
Random Struct. Algorithms, 2020

Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering.
Proceedings of the 2020 International Symposium on Networks, Computers and Communications, 2020

2019
Imperfect Gaps in Gap-ETH and PCPs.
Proceedings of the 34th Computational Complexity Conference, 2019

2018
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation.
Electron. Colloquium Comput. Complex., 2018

Thwarting Adversarial Examples: An L<sub>0</sub>-RobustSparse Fourier Transform.
CoRR, 2018

Thwarting Adversarial Examples: An L_0-Robust Sparse Fourier Transform.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
The Price of Selection in Differential Privacy.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
On the Sensitivity Conjecture for Read-k Formulas.
Electron. Colloquium Comput. Complex., 2016


  Loading...