| HomeFaculty Computer Sc. & Engg Bireswar Das |
Bireswar Das
Assistant Professor |
| |
|
B.E.: REC Silchar, 2001
M.Tech.: Indian Statistical Institute Kolkata, 2003
Ph.D.: The Institute of Mathematical Sciences, Chennai, 2010 |
Email: bireswar @ iitgn.ac.in
Phone: +91-93284 74218
Fax: +91-79-23972622
|
|
| |
| Research Interest |
- Computational Complexity Theory and Algorithms
- Algebra and Computation
|
|
| Work Experience |
- Assistant Professor, Indian Institute of Technology, Gandhinagar, (June 2010 – present)
- Visiting Faculty, National Institute of Science Education and Research, Bhubaneswar
- Visiting Researcher, Laboratoire de Recherche en Informatique, Orsay, France (Sep-2009 to Dec-2009)
|
| Selected Recent Publications |
- Bireswar Das, Jacobo Toran and Fabian Wagner, "Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs", 27th International
Symposium on Theoretical Aspects of Computer Science (STACS’10), 2010
- Bireswar Das, Samir Datta and Prajakta Nimbhorkar, "Log-space Algorithms for Paths and Matchings in k-trees", 27th International Symposium on
Theoretical Aspects of Computer Science (STACS’10), 2010
- V. Arvind and Bireswar Das, "SZK Proofs for Black-Box Group Problems", Special Issue Theory Computing Systems, 43(2): 100-117, 2008
- V. Arvind, Bireswar Das and Johannes Koebler, "The Space Complexity of k -Tree Isomorphism", Proceedings of The 18th International Symposium on Algorithms and Computation (ISAAC 2007), LNCS Vol 4835, pp.822-833, 2007
- V. Arvind, Bireswar Das and Partha Mukhopadhyay, "On Isomorphism and Canonization of Tournaments and Hypertournaments", Proceedings of The 17th International Symposium on Algorithms and Computation (ISAAC 2006), LNCS Vol 4288, pp.449-459, 2006
|
| |
| |
|
| |
