Anindya De
Fourth year Ph.D. student in Computer Science
at University of California, Berkeley
<myfirstname> at cs dot berkeley dot edu

I am interested in Complexity Theory (more specifically this) and work with Luca Trevisan.
Previously, I had spent four wonderful years at IIT Kanpur where I incidentally also obtained my Bachelors in Computer Science.
Papers

  1. Anindya De, Piyush P Kurur, Chandan Saha and Ramprasad Saptharishi
    Fast Integer Multiplication using Modular Arithmetic
    [arXiv], STOC 2008

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

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

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

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

  6. Anindya De, Christopher Portmann, Thomas Vidick and Renato Renner
    Trevisan's extractor in the presence of quantum side information
    [Arxiv version] 

  7. Anindya De
    Extractors and Pseudorandom generators using the Hardcore lemma
    [Full version] Submitted  

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

  9. Anindya De and Thomas Watson
    Extractors and lower bounds for locally samplable sources
    [ECCC version] APPROX-RANDOM 2011  

  10. Anindya De
    Lower bounds in differential privacy
    [Arxiv] TCC 2012   (Best student paper)

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

  12. Anindya De, Ilias Diakonikolas and Rocco A. Servedio
    The Inverse Shapley Value problem
    ICALP 2012  

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

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