| Approximating the distance to monotonicity of boolean functions RKS Pallavoor, S Raskhodnikova, E Waingarten Random Structures & Algorithms 60 (2), 233-260, 2022 | 35 | 2022 |
| Parameterized property testing of functions RKS Pallavoor, S Raskhodnikova, N Varma ACM Transactions on Computation Theory (TOCT) 9 (4), 1-19, 2017 | 29 | 2017 |
| Optimal unateness testers for real-valued functions: Adaptivity helps R Baleshzar, D Chakrabarty, RKS Pallavoor, S Raskhodnikova, ... Theory of Computing 16 (3), 1-36, 2020 | 24 | 2020 |
| Testing unateness of real-valued functions R Baleshzar, M Murzabulatov, RKS Pallavoor, S Raskhodnikova arXiv preprint arXiv:1608.07652, 2016 | 15 | 2016 |
| Erasure-resilient sublinear-time graph algorithms A Levi, RKS Pallavoor, S Raskhodnikova, N Varma ACM Transactions on Computation Theory (TOCT) 14 (1), 1-22, 2021 | 8 | 2021 |
| A lower bound for nonadaptive, one-sided error testing of unateness of Boolean functions over the hypercube R Baleshzar, D Chakrabarty, RKS Pallavoor, S Raskhodnikova, ... arXiv preprint arXiv:1706.00053, 2017 | 7 | 2017 |
| Improved algorithms and new models in property testing RK Pallavoor Suresh Boston University, 2020 | 4 | 2020 |
| 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 2 | 2017 |
| 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 I Chatzigiannakis, C Kaklamanis, D Marx, D Sannella Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018 | | 2018 |
Sofya RaskhodnikovaBoston UniversityVerified email at bu.edu
