Dana Jansens
dana@orodu.net
Ph.D. Candidate
Computational Geometry Lab
School of Computer Science, Carleton University
My research interests include:
- Algorithms and Complexity
- Data Structures
- Randomization
- Combinatorics
- Gray Codes
- Computational Geometry
- Dancehall Music
- Bioinformatics
- Operating Systems
- Distributed Systems
- Computer Networks
Some of the things I have done:
Publications:
- Prosenjit Bose, Dana Jansens, André Van Renssen, Maria Saumell and
Sander Verdonschot.
Making triangulations 4-connected using flips.
Proceedings for the 23rd Canadian Conference on Computational Geometry
(CCCG'11). August, 2011.
- Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin
and Michiel Smid.
Improved Methods For Generating Quasi-Gray Codes.
SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory.
June, 2010.
- Dana Jansens.
Improved Methods For Generating Quasi-Gray Codes.
April, 2010. Masters thesis.
- Dana Jansens.
Understanding Network Traffic with NetADHICT.
MITACS Second Canada-France Congress. June, 2008. Poster presentation.
- Hajime Inoue, Dana Jansens, Abdulrahman Hijazi, and Anil Somayaji.
NetADHICT: A Tool for
Understanding Network Traffic. Large Installation System
Administration Conference (LISA'07). November, 2007.
Teaching:
Fall 2010
- COMP 1405/1005 - Introduction to Object-Orientation Programming
(Tutorials)
Winter 2010
- COMP 1406/1006 - Design & Implementation of Computer Applications (Tutorials)
Fall 2009
- COMP 1405/1005 - Introduction to Object-Orientation Programming (Tutorials)
Winter 2009
- COMP 1402/1002 - Introduction to Systems Programming (Tutorials)
Fall 2008
- COMP 2402 - Abstract Data Types and Algorithms (TA Office Hours)
The best riddim of all time (and then some):
PGP
My PGP key id is 5D203EC3, available from
pgpkeys.mit.edu.
It's fingerprint is
1FEE CBB0 3AB7 D321 6B5E 0AC9 274E 5285 5D20 3EC3
