Raghu Meka - RankMe

173 papers A* 56A 8Journal 100Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Discrepancy Beyond Additive Functions with Applications to Fair Division (Extended Abstract). ITCS Alexandros Hollender, Pasin Manurangsi, Raghu Meka, Warut Suksompong
2026	A*	`conf`	Sparsifying Sums of Positive Semidefinite Matrices. SODA Arpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka
2026	—	`conf`	Tight Lower Bound for Multicolor Discrepancy. SOSA Pasin Manurangsi, Raghu Meka
2025	A	`ed.`	16th Innovations in Theoretical Computer Science Conference, ITCS 2025, Columbia University, New York, NY, USA, January 7-10, 2025 ITCS Raghu Meka
2025	J	`jnl`	Discrepancy Beyond Additive Functions with Applications to Fair Division. CoRR Alexandros Hollender, Pasin Manurangsi, Raghu Meka, Warut Suksompong
2025	J	`jnl`	Smoothed Agnostic Learning of Halfspaces over the Hypercube. CoRR Yiwen Kou, Raghu Meka
2025	J	`jnl`	Sparse Linear Regression is Easy on Random Supports. CoRR Gautam Chandrasekaran, Raghu Meka, Konstantinos Stavropoulos
2025	J	`jnl`	Sparsifying Sums of Positive Semidefinite Matrices. CoRR Arpon Basu, Pravesh K. Kothari, Yang P. Liu, Raghu Meka
2025	J	`jnl`	The communication complexity of distributed estimation. CoRR Parikshit Gopalan, Raghu Meka, Prasad Raghavendra, Mihir Singhal, Avi Wigderson
2025	J	`jnl`	Tight Lower Bound for Multicolor Discrepancy. CoRR Pasin Manurangsi, Raghu Meka
2024	A*	`conf`	Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication. STOC Zander Kelley, Shachar Lovett, Raghu Meka
2024	A*	`conf`	Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps. COLT Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2024	J	`jnl`	Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps. CoRR Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2024	A*	`conf`	Learning Neural Networks with Sparse Activations. COLT Pranjal Awasthi, Nishanth Dikkala, Pritish Kamath, Raghu Meka
2024	J	`jnl`	Learning Neural Networks with Sparse Activations. CoRR Pranjal Awasthi, Nishanth Dikkala, Pritish Kamath, Raghu Meka
2024	A*	`conf`	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. STOC Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2024	A*	`conf`	On Convex Optimization with Semi-Sensitive Features. COLT Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Raghu Meka, Chiyuan Zhang
2024	J	`jnl`	On Convex Optimization with Semi-Sensitive Features. CoRR Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Raghu Meka, Chiyuan Zhang
2024	A*	`conf`	Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension. COLT Gautam Chandrasekaran, Adam R. Klivans, Vasilis Kontonis, Raghu Meka, Konstantinos Stavropoulos
2024	J	`jnl`	Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension. CoRR Gautam Chandrasekaran, Adam R. Klivans, Vasilis Kontonis, Raghu Meka, Konstantinos Stavropoulos
2023	A*	`conf`	Efficient resilient functions. SODA Peter Ivanov, Raghu Meka, Emanuele Viola
2023	J	`jnl`	Explicit separations between randomized and deterministic Number-on-Forehead communication. CoRR Zander Kelley, Shachar Lovett, Raghu Meka
2023	J	`jnl`	Explicit separations between randomized and deterministic Number-on-Forehead communication. Electron. Colloquium Comput. Complex. Zander Kelley, Shachar Lovett, Raghu Meka
2023	A*	`conf`	Feature Adaptation for Sparse Linear Regression. NeurIPS Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2023	J	`jnl`	Feature Adaptation for Sparse Linear Regression. CoRR Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2023	A*	`conf`	Learning Narrow One-Hidden-Layer ReLU Networks. COLT Sitan Chen, Zehao Dou, Surbhi Goel, Adam R. Klivans, Raghu Meka
2023	J	`jnl`	Learning Narrow One-Hidden-Layer ReLU Networks. CoRR Sitan Chen, Zehao Dou, Surbhi Goel, Adam R. Klivans, Raghu Meka
2023	J	`jnl`	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. CoRR Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2023	J	`jnl`	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. Electron. Colloquium Comput. Complex. Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2023	A*	`conf`	On User-Level Private Convex Optimization. ICML Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Raghu Meka, Chiyuan Zhang
2023	J	`jnl`	On User-Level Private Convex Optimization. CoRR Badih Ghazi, Pritish Kamath, Ravi Kumar, Raghu Meka, Pasin Manurangsi, Chiyuan Zhang
2023	A*	`conf`	On the Benefits of Learning to Route in Mixture-of-Experts Models. EMNLP Nishanth Dikkala, Nikhil Ghosh, Raghu Meka, Rina Panigrahy, Nikhil Vyas, Xin Wang
2023	A*	`conf`	Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. STOC Nikhil Bansal, Haotian Jiang, Raghu Meka
2023	J	`jnl`	Simple Mechanisms for Representing, Indexing and Manipulating Concepts. CoRR Yuanzhi Li, Raghu Meka, Rina Panigrahy, Kulin Shah
2023	J	`jnl`	Special Issue: APPROX-RANDOM 2020: Guest Editor's Foreword. Theory Comput. Jaroslaw Byrka, Raghu Meka
2023	A*	`conf`	Strong Bounds for 3-Progressions. FOCS Zander Kelley, Raghu Meka
2023	A*	`conf`	User-Level Differential Privacy With Few Examples Per User. NeurIPS Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Raghu Meka, Chiyuan Zhang
2023	J	`jnl`	User-Level Differential Privacy With Few Examples Per User. CoRR Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi, Raghu Meka, Chiyuan Zhang
2022	J	`jnl`	Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs. SIAM J. Comput. Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra
2022	J	`jnl`	Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs. CoRR Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2022	J	`jnl`	Efficient resilient functions. Electron. Colloquium Comput. Complex. Peter Ivanov, Raghu Meka, Emanuele Viola
2022	A*	`conf`	Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks. NeurIPS Sitan Chen, Aravind Gollakota, Adam R. Klivans, Raghu Meka
2022	J	`jnl`	Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks. CoRR Sitan Chen, Aravind Gollakota, Adam R. Klivans, Raghu Meka
2022	A	`conf`	Lifting with Sunflowers. ITCS Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang
2022	A*	`conf`	Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs. NeurIPS Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2022	A*	`conf`	Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs. ICLR Sitan Chen, Jerry Li, Yuanzhi Li, Raghu Meka
2022	J	`jnl`	Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs. CoRR Sitan Chen, Jerry Li, Yuanzhi Li, Raghu Meka
2022	A	`conf`	Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ITCS Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2022	A	`conf`	Random Restrictions and PRGs for PTFs in Gaussian Space. CCC Zander Kelley, Raghu Meka
2022	J	`jnl`	Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka
2022	A*	`conf`	Sketching based Representations for Robust Image Classification with Provable Guarantees. NeurIPS Nishanth Dikkala, Sankeerth Rao Karingula, Raghu Meka, Jelani Nelson, Rina Panigrahy, Xin Wang
2022	A*	`conf`	Smoothed Analysis of the Komlós Conjecture. ICALP Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2022	J	`jnl`	Smoothed Analysis of the Komlós Conjecture. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2021	J	`jnl`	Efficiently Learning Any One Hidden Layer ReLU Network From Queries. CoRR Sitan Chen, Adam R. Klivans, Raghu Meka
2021	A*	`conf`	Efficiently Learning One Hidden Layer ReLU Networks From Queries. NeurIPS Sitan Chen, Adam R. Klivans, Raghu Meka
2021	A*	`conf`	Learning Deep ReLU Networks Is Fixed-Parameter Tractable. FOCS Sitan Chen, Adam R. Klivans, Raghu Meka
2021	J	`jnl`	Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021	A*	`conf`	On the Power of Preconditioning in Sparse Linear Regression. FOCS Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2021	J	`jnl`	On the Power of Preconditioning in Sparse Linear Regression. CoRR Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi
2021	A*	`conf`	Online Discrepancy Minimization for Stochastic Arrivals. SODA Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2021	J	`jnl`	Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2021	—	`conf`	Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021	J	`jnl`	Random restrictions and PRGs for PTFs in Gaussian Space. CoRR Zander Kelley, Raghu Meka
2021	J	`jnl`	Random restrictions and PRGs for PTFs in Gaussian Space. Electron. Colloquium Comput. Complex. Zander Kelley, Raghu Meka
2020	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, Virtual Conference, August 17-19, 2020 APPROX-RANDOM Jaroslaw Byrka, Raghu Meka
2020	A*	`conf`	Balancing Gaussian vectors in high dimension. COLT Paxton Turner, Raghu Meka, Philippe Rigollet
2020	J	`jnl`	Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. Electron. Colloquium Comput. Complex. Ashutosh Kumar, Raghu Meka, David Zuckerman
2020	J	`jnl`	Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. Ashutosh Kumar, Raghu Meka, David Zuckerman
2020	A*	`conf`	Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman
2020	J	`jnl`	Improved lifting theorems via robust sunflowers. Electron. Colloquium Comput. Complex. Shachar Lovett, Raghu Meka, Jiapeng Zhang
2020	J	`jnl`	Learning Deep ReLU Networks Is Fixed-Parameter Tractable. CoRR Sitan Chen, Adam R. Klivans, Raghu Meka
2020	A*	`conf`	Learning Polynomials in Few Relevant Dimensions. COLT Sitan Chen, Raghu Meka
2020	J	`jnl`	Learning Polynomials of Few Relevant Dimensions. CoRR Sitan Chen, Raghu Meka
2020	A*	`conf`	Learning Some Popular Gaussian Graphical Models without Condition Number Bounds. NeurIPS Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra
2020	J	`jnl`	On the discrepancy of random low degree set systems. Random Struct. Algorithms Nikhil Bansal, Raghu Meka
2020	J	`jnl`	Online Discrepancy Minimization for Stochastic Arrivals. CoRR Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha
2019	J	`jnl`	Average Bias and Polynomial Sources. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Philips George John, Suprovat Ghoshal, Raghu Meka
2019	J	`jnl`	Balancing Gaussian vectors in high dimension. CoRR Raghu Meka, Philippe Rigollet, Paxton Turner
2019	A*	`conf`	Leakage-Resilient Secret Sharing Against Colluding Parties. FOCS Ashutosh Kumar, Raghu Meka, Amit Sahai
2019	J	`jnl`	Learning Some Popular Gaussian Graphical Models without Condition Number Bounds. CoRR Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra
2019	A*	`conf`	On the discrepancy of random low degree set systems. SODA Nikhil Bansal, Raghu Meka
2019	A*	`conf`	Pseudorandom generators for width-3 branching programs. STOC Raghu Meka, Omer Reingold, Avishay Tal
2019	J	`jnl`	Pseudorandomness from Shrinkage. J. ACM Russell Impagliazzo, Raghu Meka, David Zuckerman
2018	A*	`conf`	Efficient Algorithms for Outlier-Robust Regression. COLT Adam R. Klivans, Pravesh K. Kothari, Raghu Meka
2018	J	`jnl`	Efficient Algorithms for Outlier-Robust Regression. CoRR Adam R. Klivans, Pravesh K. Kothari, Raghu Meka
2018	J	`jnl`	Leakage-Resilient Secret Sharing. Electron. Colloquium Comput. Complex. Ashutosh Kumar, Raghu Meka, Amit Sahai
2018	J	`jnl`	Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. Ashutosh Kumar, Raghu Meka, Amit Sahai
2018	A*	`conf`	Learning One Convolutional Layer with Overlapping Patches. ICML Surbhi Goel, Adam R. Klivans, Raghu Meka
2018	J	`jnl`	Learning One Convolutional Layer with Overlapping Patches. CoRR Surbhi Goel, Adam R. Klivans, Raghu Meka
2018	J	`jnl`	On the discrepancy of random low degree set systems. CoRR Nikhil Bansal, Raghu Meka
2018	J	`jnl`	Pseudorandom Generators for Width-3 Branching Programs. CoRR Raghu Meka, Omer Reingold, Avishay Tal
2018	J	`jnl`	Pseudorandom Generators for Width-3 Branching Programs. Electron. Colloquium Comput. Complex. Raghu Meka, Omer Reingold, Avishay Tal
2018	J	`jnl`	Pseudorandomness via the Discrete Fourier Transform. SIAM J. Comput. Parikshit Gopalan, Daniel M. Kane, Raghu Meka
2017	A*	`conf`	Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. STOC Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra
2017	J	`jnl`	Communication With Imperfectly Shared Randomness. IEEE Trans. Inf. Theory Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2017	A*	`conf`	Explicit Resilient Functions Matching Ajtai-Linial. SODA Raghu Meka
2017	A*	`conf`	Learning Graphical Models Using Multiplicative Weights. FOCS Adam R. Klivans, Raghu Meka
2017	J	`jnl`	Learning Graphical Models Using Multiplicative Weights. CoRR Adam R. Klivans, Raghu Meka
2016	J	`jnl`	Anti-concentration for Polynomials of Independent Random Variables. Theory Comput. Raghu Meka, Oanh Nguyen, Van Vu
2016	J	`jnl`	Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs. CoRR Pravesh Kothari, Raghu Meka, Prasad Raghavendra
2016	J	`jnl`	Rectangles Are Nonnegative Juntas. SIAM J. Comput. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2016	J	`jnl`	Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). SIAM J. Comput. Moritz Hardt, Yuval Ishai, Raghu Meka, Virginia Vassilevska Williams
2015	A*	`conf`	Almost Optimal Pseudorandom Generators for Spherical Caps: Extended Abstract. STOC Pravesh K. Kothari, Raghu Meka
2015	A	`conf`	Communication with Imperfectly Shared Randomness. ITCS Clément Louis Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2015	J	`jnl`	Constructive Discrepancy Minimization by Walking on the Edges. SIAM J. Comput. Shachar Lovett, Raghu Meka
2015	J	`jnl`	Explicit resilient functions matching Ajtai-Linial. CoRR Raghu Meka
2015	J	`jnl`	Explicit resilient functions matching Ajtai-Linial. Electron. Colloquium Comput. Complex. Raghu Meka
2015	J	`jnl`	Making the Long Code Shorter. SIAM J. Comput. Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
2015	A*	`conf`	Pseudorandomness via the Discrete Fourier Transform. FOCS Parikshit Gopalan, Daniel M. Kane, Raghu Meka
2015	J	`jnl`	Pseudorandomness via the discrete Fourier transform. CoRR Parikshit Gopalan, Daniel M. Kane, Raghu Meka
2015	A*	`conf`	Rectangles Are Nonnegative Juntas. STOC Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2015	A*	`conf`	Sum-of-squares Lower Bounds for Planted Clique. STOC Raghu Meka, Aaron Potechin, Avi Wigderson
2015	J	`jnl`	Sum-of-squares lower bounds for planted clique. CoRR Raghu Meka, Aaron Potechin, Avi Wigderson
2014	J	`jnl`	Almost Optimal Pseudorandom Generators for Spherical Caps. CoRR Pravesh Kothari, Raghu Meka
2014	J	`jnl`	Bounding the Sensitivity of Polynomial Threshold Functions. Theory Comput. Prahladh Harsha, Adam R. Klivans, Raghu Meka
2014	J	`jnl`	Communication with Imperfectly Shared Randomness. CoRR Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2014	J	`jnl`	Communication with Imperfectly Shared Randomness. Electron. Colloquium Comput. Complex. Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2014	A*	`conf`	Computational Limits for Matrix Completion. COLT Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz
2014	J	`jnl`	Computational Limits for Matrix Completion. CoRR Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz
2014	—	`conf`	Deterministic Coupon Collection and Better Strong Dispersers. APPROX-RANDOM Raghu Meka, Omer Reingold, Yuan Zhou
2014	—	`conf`	Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2014	J	`jnl`	Pseudorandomness for concentration bounds and signed majorities. CoRR Parikshit Gopalan, Daniel M. Kane, Raghu Meka
2014	J	`jnl`	Rectangles Are Nonnegative Juntas. Electron. Colloquium Comput. Complex. Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman
2014	A*	`conf`	Volumetric Spanners: an Efficient Exploration Basis for Learning. COLT Elad Hazan, Zohar Shay Karnin, Raghu Meka
2013	A*	`conf`	A PRG for lipschitz functions of polynomials with applications to sparsest cut. STOC Daniel M. Kane, Raghu Meka
2013	J	`jnl`	Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique. Electron. Colloquium Comput. Complex. Raghu Meka, Avi Wigderson
2013	J	`jnl`	DNF sparsification and a faster deterministic counting algorithm. Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold
2013	A*	`conf`	Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching. COLT Daniel M. Kane, Adam R. Klivans, Raghu Meka
2013	J	`jnl`	Moment-Matching Polynomials CoRR Adam R. Klivans, Raghu Meka
2013	J	`jnl`	Moment-Matching Polynomials. Electron. Colloquium Comput. Complex. Adam R. Klivans, Raghu Meka
2013	J	`jnl`	Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2013	J	`jnl`	Pseudorandom Generators for Polynomial Threshold Functions. SIAM J. Comput. Raghu Meka, David Zuckerman
2013	J	`jnl`	Volumetric Spanners and their Applications to Machine Learning. CoRR Elad Hazan, Zohar Shay Karnin, Raghu Meka
2012	J	`jnl`	A PRG for Lipschitz Functions of Polynomials with Applications to Sparsest Cut CoRR Daniel M. Kane, Raghu Meka
2012	J	`jnl`	A PTAS for Computing the Supremum of Gaussian Processes CoRR Raghu Meka
2012	A*	`conf`	A PTAS for Computing the Supremum of Gaussian Processes. FOCS Raghu Meka
2012	J	`jnl`	An invariance principle for polytopes. J. ACM Prahladh Harsha, Adam R. Klivans, Raghu Meka
2012	J	`jnl`	Better Pseudorandom Generators from Milder Pseudorandom Restrictions CoRR Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	A*	`conf`	Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	J	`jnl`	Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	J	`jnl`	Constructive Discrepancy Minimization by Walking on The Edges CoRR Shachar Lovett, Raghu Meka
2012	A*	`conf`	Constructive Discrepancy Minimization by Walking on the Edges. FOCS Shachar Lovett, Raghu Meka
2012	J	`jnl`	DNF Sparsification and a Faster Deterministic Counting Algorithm CoRR Parikshit Gopalan, Raghu Meka, Omer Reingold
2012	A	`conf`	DNF Sparsification and a Faster Deterministic Counting Algorithm. CCC Parikshit Gopalan, Raghu Meka, Omer Reingold
2012	J	`jnl`	DNF Sparsification and a Faster Deterministic Counting. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold
2012	A*	`conf`	Learning Functions of Halfspaces using Prefix Covers. COLT Parikshit Gopalan, Adam R. Klivans, Raghu Meka
2012	A*	`conf`	Making the Long Code Shorter. FOCS Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
2012	A*	`conf`	Pseudorandomness from Shrinkage. FOCS Russell Impagliazzo, Raghu Meka, David Zuckerman
2012	J	`jnl`	Pseudorandomness from Shrinkage. Electron. Colloquium Comput. Complex. Russell Impagliazzo, Raghu Meka, David Zuckerman
2011	—	`conf`	Almost Optimal Explicit Johnson-Lindenstrauss Families. APPROX-RANDOM Daniel Kane, Raghu Meka, Jelani Nelson
2011	A*	`conf`	An FPTAS for #Knapsack and Related Counting Problems. FOCS Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2011	J	`jnl`	Making the long code shorter, with applications to the Unique Games Conjecture CoRR Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
2011	J	`jnl`	Making the long code shorter, with applications to the Unique Games Conjecture. Electron. Colloquium Comput. Complex. Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
2011	A*	`conf`	Pseudorandom generators for combinatorial shapes. STOC Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2010	J	`jnl`	Almost Optimal Explicit Johnson-Lindenstrauss Transformations CoRR Raghu Meka
2010	J	`jnl`	Almost Optimal Explicit Johnson-Lindenstrauss Transformations. Electron. Colloquium Comput. Complex. Daniel Kane, Raghu Meka, Jelani Nelson
2010	A*	`conf`	An invariance principle for polytopes. STOC Prahladh Harsha, Adam R. Klivans, Raghu Meka
2010	A*	`conf`	Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan
2010	—	`conf`	Guaranteed Rank Minimization via Singular Value Projection. NIPS Prateek Jain, Raghu Meka, Inderjit S. Dhillon
2010	J	`jnl`	Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs CoRR Parikshit Gopalan, Adam R. Klivans, Raghu Meka
2010	J	`jnl`	Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Adam R. Klivans, Raghu Meka
2010	J	`jnl`	Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2010	A*	`conf`	Pseudorandom generators for polynomial threshold functions. STOC Raghu Meka, David Zuckerman
2009	J	`jnl`	An Invariance Principle for Polytopes CoRR Prahladh Harsha, Adam R. Klivans, Raghu Meka
2009	J	`jnl`	An Invariance Principle for Polytopes. Electron. Colloquium Comput. Complex. Prahladh Harsha, Adam R. Klivans, Raghu Meka
2009	J	`jnl`	Bounding the Sensitivity of Polynomial Threshold Functions CoRR Prahladh Harsha, Adam R. Klivans, Raghu Meka
2009	J	`jnl`	Guaranteed Rank Minimization via Singular Value Projection CoRR Raghu Meka, Prateek Jain, Inderjit S. Dhillon
2009	—	`conf`	Matrix Completion from Power-Law Distributed Samples. NIPS Raghu Meka, Prateek Jain, Inderjit S. Dhillon
2009	J	`jnl`	Pseudorandom Generators for Polynomial Threshold Functions CoRR Raghu Meka, David Zuckerman
2009	—	`conf`	Small-Bias Spaces for Group Products. APPROX-RANDOM Raghu Meka, David Zuckerman
2008	A*	`conf`	Rank minimization via online learning. ICML Raghu Meka, Prateek Jain, Constantine Caramanis, Inderjit S. Dhillon
2008	A	`conf`	Simultaneous Unsupervised Learning of Disparate Clusterings. SDM Prateek Jain, Raghu Meka, Inderjit S. Dhillon
2008	J	`jnl`	Simultaneous Unsupervised Learning of Disparate Clusterings. Stat. Anal. Data Min. Prateek Jain, Raghu Meka, Inderjit S. Dhillon