Supartha Podder

I am a post-doctoral researcher under Scott Aaronson at UT Austin in Austin, TX, United States.

I received my PhD in computer science from the Centre for Quantum Technologies, National University of Singapore in Singapore, under the supervision of Hartmut Klauck. Before coming to CQT I obtained my MPRI (Parisian Master of Research in Computer Science) from Ecole Normale Supérieure de Cachan (ENS de Cachan) in Paris, France. My Master thesis advisor was Iordanis Kerenidis. Even before that, I was at Chennai Mathematical Institute (CMI) in Chennai, India. There, my thesis advisor was Meena Mahajan.

Academic Interests 

I am interested in theoretical computer science. In particular I am interested in classical and quantum complexity theory. Currently I am focusing on communication complexity and query complexity and different aspects of two player games.


5.  Power of Unbounded-Width Polynomial-Size Permutation Branching Programs (2016).
Hartmut Klauck, Supartha Podder
        Abstract  |  arxiv  |  Other

4.  Graph properties in node-query setting: effect of symmetry-breaking (2015).
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
        41st International Symposium on Mathematical Foundations of Computer Science (MFCS) 2016
       Abstract  |  arxiv:1510.08267  |  Other

3.  Quantum Query Complexity of Subgraph Isomorphism and Homomorphism (2015).
Raghav Kulkarni, Supartha Podder
        33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016)
        Poster: The 19th Conference on Quantum Information Processing (QIP 2016)
        Abstract  |  arxiv:1509.06361  |  Other

2.  New Bounds for the Garden-Hose Model (2014).
Hartmut Klauck, Supartha Podder
34th International Conference on Foundation of Software Technology and Theoretical Computer Science, (FSTTCS) 2014
        Abstract  |  arxiv:1412.4904  |  Other

Two Results about Quantum Messages (2014).
        Hartmut Klauck, Supartha Podder
39th International Symposium on Mathematical Foundations of Computer Science 2014 (MFCS) 2014

        Poster: The 18th Conference on Quantum Information Processing (QIP 2015)
        Abstract  |  arxiv:1402.4312  |  Other

Ph.D. Thesis

Exploring Different Models of Query Complexity and Communication Complexity.
Supartha Podder
   Supervisor: Hartmut Klauck.
   Link to the file  |  Other

MPRI Master Thesis

Bounds For Classical And Quantum Communication Complexity.
Supartha Podder
   Supervisor: Iordanis Kerenidis.
   Link to the file  |  Other

Curriculum Vitae (CV)

Please click here to download the CV. (Updated on February 27th, 2016)



Current : Department of Computer Science,
University of Texas at Austin,
4.418, Gates Dell Complex,
2317 Speedway,
Austin, Texas, United States 78712

Office :

4.418 Gates Dell Complex
+1 (512) 471-8722
Email: [my first name]
[my first name]


We (few friends from our undergrad college) run a Charity Organisation named AALO for helping poor students in India. Go to if you wish to donate.  

Follow me on Twitter if you like.
web stats