Anindya De Fifth year Ph.D. student in Computer Science at University of California, Berkeley <myfirstname> at cs dot berkeley dot edu Areas of Interest: Complexity theory, Analysis of Boolean functions, Learning theory, Applied probability I am advised by Luca Trevisan. Previously, I had spent four wonderful years at IIT Kanpur where I incidentally also obtained my Bachelors in Computer Science. [CV] [Research statement] New: I also help organize TCS+, an online seminar series in theoretical computer science, accessible to the widest possible audience, and ensuring a carbon-free dissemination of ideas across the globe

Boolean function analysis and Learning theory

1. Anindya De, Ilias Diakonikolas and Rocco Servedio
   Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions
   Submitted

2. Anindya De, Elchanan Mossel and Joe Neeman
   Majority is Stablest : Discrete and SoS
   [arXiv] STOC 2013

3. Anindya De, Ilias Diakonikolas and Rocco Servedio
   Inverse problems in Approximate Uniform generation
   [arXiv] Submitted

4. Anindya De, Ilias Diakonikolas and Rocco Servedio
   Robust Khintchine-Kahane inequality and computing optimal
   constants in Fourier analysis and High-dimensional geometry
   [arXiv] ICALP 2013

5. Anindya De, Ilias Diakonikolas and Rocco Servedio
   The Inverse Shapley Value problem
   [Full version] ICALP 2012  

6. Anindya De, Ilias Diakonikolas, Vitaly Feldman and Rocco Servedio
   Nearly optimal solutions for the Chow parameters problem and low weight approximation of halfspaces
   [Arxiv] STOC 2012  

Pseudorandomness and Cryptography

7. Anindya De, Christopher Portmann, Thomas Vidick and Renato Renner
   Trevisan's extractor in the presence of quantum side information
   [Journal version] SIAM Journal on Computing, 2012  

8. Anindya De and Thomas Watson
   Extractors and lower bounds for locally samplable sources
   [ECCC version] APPROX-RANDOM 2011, ACM ToCT 2012  

9. Anindya De
   Pseudorandomness for permutation and regular branching programs
   [Proceedings version] [Full version] CCC 2011  

10. Anindya De and Thomas Vidick
    Near optimal extractors against quantum storage
    [ECCC report] Preliminary version in QIP 2010. Extended version in STOC 2010 

11. Anindya De, Omid Etesami, Luca Trevisan and Madhur Tulsiani
    Improved pseudorandom generators against depth 2 circuits
    [ECCC report] APPROX-RANDOM 2010  

12. Anindya De, Luca Trevisan and Madhur Tulsiani
    Non-uniform attacks against one-way functions and PRGs
    [ECCC report] CRYPTO 2010  

13. Anindya De and Luca Trevisan
    Extractors using hardness amplification
    [Conference Proceedings],[Full version] APPROX-RANDOM 2009 

14. Anindya De
    Extractors and Pseudorandom generators using the Hardcore lemma
    [Full version] Unpublished manuscript  

Miscellaneous

15. Anindya De and Elchanan Mossel
    Explicit Optimal Hardness via Gaussian Stability results
    [Arxiv] Submitted  

16. Anindya De
    Lower bounds in differential privacy
    [Arxiv] TCC 2012 (co-winner of Best student paper)  

17. Anindya De, Piyush P Kurur, Chandan Saha and Ramprasad Saptharishi
    Fast Integer Multiplication using Modular Arithmetic
    [arXiv] STOC 2008 (to appear in SICOMP) 

Some flings from the past

1. Rajeev Kumar Gajbhiye, Anindya De, Rupesh Kumar Helwade and S.A. Soman
   A simple and efficient approach to determination of minimum set of Break Point Relays for Transmission Protection System Coordination
   [Conference Proceedings], International Conference on Future Power Systems, Amsterdam, 2005

2. Rajeev Kumar Gajbhiye, Anindya De and S.A. Soman
   Computation of Optimal Break Point Set of Relays:An Integer Linear Programming Approach
   [Journal Version], IEEE Transactions on Power Delivery, 2008

3. Ho-lin Chen, Anindya De and Ashish Goel
   Towards Programmable Molecular Machines
   [Full version], FNANO, 2008

Links:    ECCC | Photos | Blog | Personal | Quotes | Friends| Mobile loyalty| Miscellaneous