Prasad Raghavendra
Orcid: 0009-0009-7851-0653Affiliations:
- University of California at Berkeley, USA
- Georgia Institute of Technology, Atlanta, USA (former)
According to our database1,
Prasad Raghavendra
authored at least 78 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains.
CoRR, 2024
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold.
CoRR, 2024
CoRR, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023
2022
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs.
SIAM J. Comput., 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the Conference on Learning Theory, 2020
2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
2018
ACM Trans. Algorithms, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
2014
SIAM J. Comput., 2014
Proceedings of The 27th Conference on Learning Theory, 2014
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014
Proceedings of the Approximation, 2014
2013
Algorithmica, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
SIAM J. Comput., 2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
Proceedings of the Innovations in Computer Science, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
Electron. Colloquium Comput. Complex., 2010
Approximations for the isoperimetric and spectral profile of graphs and related parameters.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the Approximation, 2010
2009
Int. J. Appl. Cryptogr., 2009
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers.
Electron. Colloquium Comput. Complex., 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009
2008
Electron. Colloquium Comput. Complex., 2008
Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness.
Electron. Colloquium Comput. Complex., 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007