default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitali Bafna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i20]Mitali Bafna, Dor Minzer:
Constant Degree Networks for Almost-Everywhere Reliable Transmission. CoRR abs/2501.00337 (2025)- 2024
- [c14]Mitali Bafna, Dor Minzer:
Solving Unique Games over Globally Hypercontractive Graphs. CCC 2024: 3:1-3:15 - [c13]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. FOCS 2024: 862-869 - [c12]Mitali Bafna
, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. STOC 2024: 1978-1989 - [i19]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. CoRR abs/2402.00850 (2024) - [i18]Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari:
Rounding Large Independent Sets on Expanders. CoRR abs/2405.10238 (2024) - [i17]Mitali Bafna, Dor Minzer, Nikhil Vyas:
Quasi-Linear Size PCPs with Small Soundness from HDX. CoRR abs/2407.12762 (2024) - [i16]Prashanti Anderson, Mitali Bafna, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer:
Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures. CoRR abs/2411.12438 (2024) - [i15]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i14]Mitali Bafna, Dor Minzer:
Solving Unique Games over Globally Hypercontractive Graphs. CoRR abs/2304.07284 (2023) - [i13]Mitali Bafna, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. CoRR abs/2308.09668 (2023) - [i12]Mitali Bafna, Dor Minzer:
Characterizing Direct Product Testing via Coboundary Expansion. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c11]Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu:
Polynomial-Time Power-Sum Decomposition of Polynomials. FOCS 2022: 956-967 - [c10]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. SODA 2022: 1069-1128 - [c9]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on high dimensional expanders. STOC 2022: 185-194 - [i11]Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu:
Polynomial-Time Power-Sum Decomposition of Polynomials. CoRR abs/2208.00122 (2022) - 2021
- [c8]Mitali Bafna, Nikhil Vyas:
Optimal Fine-Grained Hardness of Approximation of Linear Equations. ICALP 2021: 20:1-20:19 - [c7]Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer:
Playing unique games on certified small-set expanders. STOC 2021: 1629-1642 - [i10]Mitali Bafna, Nikhil Vyas:
Optimal Fine-grained Hardness of Approximation of Linear Equations. CoRR abs/2106.13210 (2021) - [i9]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. CoRR abs/2111.09444 (2021) - [i8]Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]Mitali Bafna, Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. Random Struct. Algorithms 57(3): 658-694 (2020) - [c6]Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan:
Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering. ISNCC 2020: 1-6 - [i7]Mitali Bafna, Boaz Barak, Pravesh Kothari, Tselil Schramm, David Steurer:
Playing Unique Games on Certified Small-Set Expanders. CoRR abs/2006.09969 (2020)
2010 – 2019
- 2019
- [c5]Mitali Bafna, Nikhil Vyas:
Imperfect Gaps in Gap-ETH and PCPs. CCC 2019: 32:1-32:19 - [c4]Madhu Sudan, Badih Ghazi, Noah Golowich, Mitali Bafna:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. SODA 2019: 1861-1871 - [i6]Mitali Bafna, Nikhil Vyas:
Imperfect Gaps in Gap-ETH and PCPs. CoRR abs/1907.08185 (2019) - 2018
- [c3]Mitali Bafna, Jack Murtagh, Nikhil Vyas:
Thwarting Adversarial Examples: An L_0-Robust Sparse Fourier Transform. NeurIPS 2018: 10096-10106 - [i5]Mitali Bafna, Badih Ghazi, Noah Golowich, Madhu Sudan:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. CoRR abs/1808.08907 (2018) - [i4]Mitali Bafna, Jack Murtagh, Nikhil Vyas:
Thwarting Adversarial Examples: An L0-RobustSparse Fourier Transform. CoRR abs/1812.05013 (2018) - [i3]Mitali Bafna, Badih Ghazi, Noah Golowich, Madhu Sudan:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Mitali Bafna, Jonathan R. Ullman:
The Price of Selection in Differential Privacy. COLT 2017: 151-168 - [i2]Mitali Bafna, Jonathan R. Ullman:
The Price of Selection in Differential Privacy. CoRR abs/1702.02970 (2017) - 2016
- [c1]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. MFCS 2016: 16:1-16:14 - [i1]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 01:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
