Links:
| Fall 2009 | Winter 2009 | |
| COMP 3804 COMP 5703 |
COMP 3804 |
| Fax | Phone | |
| anil@scs.carleton.ca | 1-613-520-4334 | 1-613-520-2600 Ext. 3907 |
How to reach Carleton University: Carleton
University Map Directions
| Design, analysis and implementation of algorithms: My main interest is in problems related to shortest paths, spanners and separators in computational geometry and graph theory. As such I am interested in sequential, parallel, distributed, multi-core, and external memory algorithms for problems which fit within the framework of design and analysis of algorithms. Discrete Mathematics: All
sorts of discrete math problems - problems in
graph theory, combinatorics, building discrete structures, finding
applications in other fields. I am also interested in developing
innovative ways to teach Mathematics to School Age Children,
especially designing material on the web. Also check this
web-page for the seminars in our group and I am interested in most
of these topics. Have a look into my publications
and this will give some ideas on my research interests. |
Honors Project will typically be implementation oriented,
unless the student comes up with an interesting topic along my research
interests.
Masters thesis will typically have a mix of theory and implementation possibly in the areas of Parallel Computation, Computational Geometry, and Graph Algorithms.
Ph.D. Thesis will have foundational theoretical work possibly supported by experimental studies. The research topics include parallel computation, computational geometry, graph algorithms, discrete mathematics and problems which in general obey the framework of the design and analysis of discrete algorithms. (See the recent journals and conference proceedings, e.g., Jl. ACM, SIAM Jl. Computing, Algorithmica, Discrete and Computational Geometry, CGTA, Proc. ACM-SIAM SODA, Proc. ACM Comp. Geom., Proc. ACM-SPAA).
Requirements:
| Honors |
|
| Masters |
|
| Ph.D. |
|
