Search results
Sandeep Sen June 1991- July 31, 2022. Email: ssen@cse.iitd.ac.in Currently in Ashoka University. Ex Dean of Faculty, IIT Delhi (Aug 2016 - Aug 2018) Ex Head, Dept of CSE (Aug 2007 - Aug 2010) Biosketch
Sandeep Sen (FASc, FNA) Education . Ph.D. in Computer Science (Dec 1989), Duke University. Thesis Title: Random Sampling Techniques for Efficient Parallel Algorithms in Computational Geometry. Thesis advisor: John H. Reif. M.S. in Computer Engineering (Aug 1986), University of California at Santa Barbara.
Sandeep Sen and Amit Kumar Department of Computer Science and Engineering, IIT Delhi, New Delhi 110016, India. E-mail:ssen,amitk@cse.iitd.ernet.in March 13, 2019 1 c 2018 Sandeep Sen and Amit Kumar. Any commercial distribution of this material is prohibited without prior permission of the authors. Preface This book embodies a distillation of topics that we have frequently covered in
Instructor : Sandeep Sen Guest Lecturer: Pankaj Agarwal (Duke University) Lectures: Tue, Wed, Fri 5-6 pm (K slot) MS 107 (Video Recording Studio, next to the elevator) Prerequisite: Algorithms and data structures. Topics: Computational geometry studies the design, analysis, and implementation of algorithms and data structures for geometric problems. These problems arise in a wide range of areas, including CAD/CAM, robotics, computer graphics, molecular biology, GIS, spatial databases, sensor ...
Rijurekha Sen Assistant Professor Ph.D. (IIT Bombay) Mobile and Embedded Systems (Hardware Architecture, OS, Sensing, Efficient Processing, Security), Computational Sustainability. riju AT cse.iitd.ac.in . Bharti 514 +91 (11) 2659 7385
Design and Analysis of Algorithms : A Contemporary Perspective 1 SandeepSenandAmitKumar DepartmentofComputerScienceandEngineering, IITDelhi,NewDelhi110016,India.
Sandeep Sen July 2007 5. Chapter 1 Model and Analysis When we make a claim like Algorithm A has running time O(n2 logn), we have an underlying computational model where this statement is valid. It may not be true if we change the model. Before we formalize the notion of a computational model, let us consider the example of computing Fibonacci numbers. 1.1 Computing Fibonacci numbers
Instructor : Sandeep Sen : Lectures: M,Th 8 - 9:20 , Venue IIA 101. discussion session: Thu 4:30p - 5:30p ,SIT 001 . Teaching Assistants: RAKESH RAUSHAN office hours Mon 3-5 pm office SIT 308; AYUSH GUPTA office hours Fri 4-6 pm SIT, ICTD Lab (1st floor) The total will be computed as Minors 1 and 2 - 20% each, Major 40%, Quizes - and assignments - 20%.
Sandeep Sen July 2007 5. Chapter 1 Model and Analysis When we make a claim like Algorithm A has running time O(n2 logn), we have an underlying computational model where this statement is valid. It may not be true if we change the model. Before we formalize the notion of a computational model, let us consider the example of computing Fibonacci numbers. 1.1 Computing Fibonacci numbers
Instructor : Sandeep Sen : Lectures: Mon, Thu 9:30 - 11am LH 623 . Teaching Assistant: Nikhil Kumar (csz148210@cse.iitd.ac.in ) Prerequisite: Algorithms and data structures. Topics: Computational geometry studies the design, analysis, and implementation of algorithms and data structures for geometric problems. These problems arise in a wide range of areas, including CAD/CAM, robotics, computer graphics, molecular biology, GIS, spatial databases, sensor networks, and machine learning.
