Debasis Mandal

B23 Atanasoff Hall
Information and Complexity Lab
Department of Computer Science
Iowa State University

Email: debasis AT iastate DOT edu


I am broadly interested in various areas of theoretical computer science, specifically, in computational complexity theory, algorithms, and randomness. My current research lies in the following two sub-areas of complexity theory: structural complexity and space-bounded computations. In structural complexity, my objective is to understand various completeness notions in NP under different kinds of polynomial-time reductions (such as Turing and many-one reductions) and discover new relationships among them. In space-bounded computations, my interest lies in making progress toward obtaining weak but unconditional derandomizations (removing the randomness from the computation, albeit partially) of probabilistic complexity classes.

My doctoral advisor is Dr. Pavan Aduri.

Before joining grad school, I worked as a project engineer at the Indian Institute of Technology Kharagpur, India on Cross Lingual Information Retrieval under the supervision of Dr. Sudeshna Sarkar. Before that, I worked as a software engineer at Infosys Technologies Ltd. and UshaComm for nearly 2 years. My undergrad thesis was in the area of survivable Optical WDM Networks under the guidance of Dr. Bivas Mitra.

Here is my Curriculum Vitae.

Publications

Links

Journals: CC, JACM, SICOMP, JCSS, TCS, TOCT, TOC, TOCS, IPL, RSA, I&C.

Surveys and Magazines: SIGACT News, BEATCS, CACM, FTTCS, DIMACS Reports, ACM Surveys.


Valid CSS! Valid XHTML 1.0 Strict