|
Sandeep Sen received a BTech degree in Computer Science and Engineering from IIT Kharagpur in 1984, MS from the University of California, Santa Barbara in 1986 and a PhD from Duke University in 1989. He was a (postdoctoral) Member of Technical Staff in AT&T Bell Labs, Murray Hill from 1990-91 before he joined IIT Delhi as Assistant Professor in 1991. He has been a Professor of CSE since 2000 and he served as the Head of the Department from 2007-10. On leave from IIT Delhi, he held visiting positions in the University of Newcastle, Australia (1995, one semester), University of North Carolina, Chapel Hill (1998-99) and at the University of Connecticut (2004, one semester). He also had a brief tenure in IIT Kharagpur (2004-05) as Profeesor of CSE and has held research positions in IBM Research, New Delhi (2011) and Microsoft Research, Bangalore (2012). Academic and Research Achievements: Dr Sen's research interest has been in the areas of Algorithms and Theoretical Computer Science. The work in his MS thesis resulted in the well-known parallel sorting algorithm called Shearsort and his PhD thesis made significant contributions to the area of randomized techniques in Computational Geometry. He has continued research in a variety of algorithmic areas including randomized data-structures, dynamic graph algorithms, approximate shortest path problems, cache-efficient techniques, geometric optimization problems and clustering algorithms. Several of his algorithms are among the best known in the literature for the corresponding problems. Awards and Honors: Sandeep Sen was the recipient of AICTE career award (1998) and IBM Faculty Partnership award (2004,2005). He was elected Fellow, Indian Academy of Sciences (Bangalore) in 2007. |
