Publications:

• Optimal testing of Reed-Muller codes. Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, and David Zuckerman. ECCC Report TR09-086, 2009.
• Lower Bounds for Testing Triangle Freeness in Boolean Functions. Arnab Bhattacharyya and Ning Xie. SODA, 2010.
• Transitive-Closure Spanners of the Hypercube and the Hypergrid. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David Woodruff. Submitted, 2009.
• Robust Regulatory Networks. Arnab Bhattacharyya and Bernhard Haeupler. Submitted, 2009.
• Testing Linear-Invariant Non-Linear Properties. Arnab Bhattacharyya, Victor Chen, Madhu Sudan, and Ning Xie. STACS, 2009. (Slides)
• Transitive Closure Spanners. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David Woodruff. SODA, 2009. (Slides)
• A short proof of the query complexity for monotonicity testing of boolean functions. Arnab Bhattacharyya. Manuscript, 2006.
• Morphogenesis as an Amorphous Computation. Accepted at ACM 2006 International Conference on Computing Frontiers. Arnab Bhattacharyya. Abstract
• Implementing Probabilistically Checkable Proofs of Proximity. Arnab Bhattacharyya. CSAIL Technical Report TR-2005-051.

---

I occasionally write expository notes mainly to facilitate my own understanding. I put them here in case somebody else finds them useful. Note that some of these are in an unfinished state.

• An analysis of a spectral-partitioning-type theorem from this paper
• A useful theorem about random walks from this paper
• An exposition of Mihail's combinatorial analysis of graph expansion

---

My CV as of May 2009.