Anindya De
First 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.
In the past life, 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 

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