Anindya C. Patthak

Research Interests:    I am interested in the theoretical aspects of computer science. In particular,  I am interested in computational complexity,  coding theory,  property testing,   algebraic-combinatorial constructions. I am currently a post doc at the University of California at Riverside hosted by Prof. Ilya Dumer. Before that I did my PhD at the University of Texas at Austin in August 2007 under the supervision of Prof. David Zuckerman.

My CV: PS  PDF 

Research Statement 

Teaching Statement 

Ph.D. Thesis: Error-correcting Codes : Local Testing, List Decoding, and Applications PS  PDF 

Publications: (Copyright rules may be applicable.)
  1. Correlated  Algebraic-Geometry codes :  Improved List-decoding over Bounded Alphabets.  (Preliminary full version)   V. Guruswami  and A. C. Patthak.  Mathematics of Computation, September 2007. Preliminary version appeared in FOCS 06.

  2. Provably Good Codes for Hash Function Design. C. S. Jutla and A. C. Patthak.  Selected  Areas in  Cryptography, 2006

  3. Testing Low Degree Polynomials over Prime Fields. C. S. Jutla, A. C. Patthak, A. Rudra, D. Zuckerman. FOCS 2004.   Prelimiary Full version.

    4.            Long back I worked on formal verification of temporal properties. Below is the outcome.

  4. Quantified Computational Tree Logic.  A. C. Patthak, I. Bhattacharya, A. Dasgupta, P. Dasgupta, P.P. Chakrabarti; IPL 82(2002).



Desiderata:


Contact :