 |
 |
Dr Anil Maheshwari
Professor
|
5125b HP
1125 Colonel By Drive
Ottawa, Ontario
K1S 5B6 |
Education and Research
| Rank: | Professor |
| Degrees: | Ph.D. TIFR (Bombay) India (1993), M.Math BITS (Pilani) India (1987), B.E.E.Eng. BITS (Pilani) India (1987) |
| Research Interests: | Parallel Computing, Computational Geometry, Design and Analysis of Algorithms, Graph Algorithms, |
Technical Reports
- TR-11-02, Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jorg-Rudiger Sack,
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
- TR-10-18, Mohammad R Nikseresht, Anil Somayaji, Anil Maheshwari,
Customer Appeasement Scheduling
- TR-10-08, Anil Maheshwari, Jorg-Rudiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh,
Frechet Distance with Speed Limits*
- TR-07-22, Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid,
Spanners of complete k-Partite Geometric Graphs
- TR-07-15, Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel Smid & Norbert Zeh,
Geometric Spanners With Small Chromatic Number
- TR-07-07, Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel Smid, Yihui Tang,
On the False-Positive Rate of Bloom Filters
Supervised Honours Projects
- Select topics from Private Computation and Private Computational Geometry by Simardeep Ahuja
- Empirical Study of Spanning Properties of Communication Graphs Induced by Directional Antennas by Beibyt Azymbek
- Algorithms for Generating Random Mazes by Matthew Eastman
- Finding Shortest Path in the Environment with Obstacles
- Visualizing and Analyzing Data Structure Behavior During the Execution of an Algorithm by Pawel Raubic
|
scs.carleton.ca