Reza Dorrigiv

Reza Dorrigiv
Cheriton School of Computer Science
Phone: (519) 888-4567 ext. 33512
University of Waterloo
Email: rdorrigiv@uwaterloo.ca
Waterloo, Ontario N2L 3G1
www.cs.uwaterloo.ca/~rdorrigiv
Canada
Research Interests :
• Algorithms Design and Analysis
• Online Algorithms
• Computational Geometry
Education :
• Fall 2003 - Present
University of Waterloo
Ph.D. student in Computer Science
GPA=92.88 over 100
Advisor: Alejandro L´
opez-Ortiz
Tentative Thesis Title: Alternative Measures for Analysis of On-line Algorithms
Relevant Course Work: Algorithm Design and Analysis, Five Open Problems in Algorithm Design
and Analysis, Readings in Computational Complexity, Algorithmic Foundations of the Internet, Graph-
theoretic Algorithms, Cryptography/Network Security, Approximation Algorithms in Combinatorial Op-
timization, Computational Complexity, Introduction to Kolmogorov Complexity, Algorithms for Polyhe-
dra, Probabilistic Methods in Discrete Mathematics, Machine Learning: Statistical and Computational
Foundations, Theoretical Foundations of Clustering, Adaptive Analysis
• Fall 1999 - Spring 2003
Sharif University of Technology
B.Sc. in Computer
GPA=18.69 over 20
Relevant Course Work: Computational Complexity, Artiﬁcial Intelligence, Graph Theory, Theory of Ma-
chines and Languages, Data Structures and Algorithms, Computer Simulation, Computer Networks, Sys-
tems Analysis and Design, Design of Programming Languages, Operating Systems, Data bases, Numeric
Analysis, Compilers, Computer Architecture, Systems Programming, Veriﬁcation of Reactive Systems
• Fall 1991 - Spring 1997
Exceptional Talents High School(NODET)
Secondary Graduate Certiﬁcate
GPA = 19.70 over 20
Each year 200 students in the city can pass this school’s entrance exam.
Teaching Experience :
• Instructor for “CS 240: Data Structure & Data Management” at school of Computer Science, university
of Waterloo, Winter 2010
• Instructor for “CS 341: Algorithms” at school of Computer Science, university of Waterloo, Winter 2008
1

• I have completed the Certiﬁcate in University Teaching (CUT) program provided by Centre for Teaching
Excellence at university of Waterloo (see http://www.cte.uwaterloo.ca/graduate_programs/CUT/
index.html for more information)
• Instructional Apprentice (IA) at school of Computer Science, university of Waterloo:
– “CS 234: Data Types and Structures”, Fall 2007
– “CS 240: Data Structures and Data Management”, Spring 2007
• Teaching Assistant at school of Computer Science, university of Waterloo:
– “CS 341: Algorithms”, Winter 2007 and Winter 2006
– “CS 234: Data Types and Structures”, Fall 2006
– “CS 240: Data Structures and Data Management”, Spring 2006 and Fall 2005
– “CS 135: Designing Functional Programs”, Fall 2005
– “CS 134: Principles of Computer Science”, Spring 2005
– “CS 241: Foundations of Sequential Programs”, Winter 2005, Fall 2004, and Spring 2004
– “CS 246: Software Abstraction and Speciﬁcation”, Spring 2004
– “CS 132: Principles of Program Design”, Winter 2004
– “CS 131: Introduction to Computer Programming”, Fall 2003
• Teaching Assistant at department of Computer Engineering, Sharif University of Technology:
– “Foundations of Computer Science 1”, Fall 2001
– “Foundations of Computer Science 2”, Spring 2002
– “Theory of Machines and Languages”, Fall 2002 and Spring 2003
Publications :
1. Reza Dorrigiv, Alejandro L´
opez-Ortiz, and J. Ian Munro. “On the relative dominance of paging
algorithms”. Theoretical Computer Science, Volume 410, Issues 38-40, pages 3694-3701, 2009
2. Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro
L´
opez-Ortiz, Bradford G. Nickerson, and Alejandro Salinger. “An improved line-separable algorithm for
discrete unit disc cover”. Discrete Mathematics, Algorithms and Applications (special issue of selected
papers from ISAAC 2009), accepted, 2009.
3. Reza Dorrigiv, Martin R. Ehmsen, and Alejandro L´
opez-Ortiz. “Parameterized analysis of paging and
list update algorithms”. In Proceedings of the 7th Workshop on Approximation and Online Algorithms
(WAOA ’09), to appear, 2009
4. Reza Dorrigiv and Alejandro L´
opez-Ortiz. “On developing new models, with paging as a case study”.
ACM SIGACT (Special Interest Group on Automata and Computability Theory) News, to appear, 2009
5. Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro L´
opez-
Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, and Matthew Skala. “Untangled mono-
tonic chains and adaptive range search”. In Proceedings of the 20th International Symposium on Algo-
rithms and Computation (ISAAC ’09), pages 203-212, 2009
Invited to special issue of Theoretical Computer Science for ISAAC 2009
6. Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro L´
opez-Ortiz, and
Alejandro Salinger. “Practical discrete unit disk cover using an exact line-separable algorithm”. In
Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC ’09), pages
45-54, 2009
7. Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro L´
opez-Ortiz, J. Ian
Munro, Alejandro Salinger, and Matthew Skala. “Finding a Hausdorﬀ core of a polygon: On con-
vex polygon containment with bounded Hausdorﬀ distance”. In Proceedings of the 11th Algorithms and
Data Structures Symposium (WADS ’09), pages 218-229, 2009
2

8. Reza Dorrigiv, Alejandro L´
opez-Ortiz, and J. Ian Munro. “An application of self-organizing data
structures to compression”. In Proceedings of the 8th International Symposium on Experimental Algo-
rithms (SEA ’09), pages 137-148, 2009
9. Reza Dorrigiv and Alejandro L´
opez-Ortiz. “Adaptive searching in one and two dimensions”. In
Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG ’08), pages 215-218,
2008
10. Spyros Angelopoulos, Reza Dorrigiv, and Alejandro L´
opez-Ortiz, “List update with locality of refer-
ence”. In Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN ’08),
pages 399-410, 2008
11. Reza Dorrigiv, Alejandro L´
opez-Ortiz, and J. Ian Munro. “List update algorithms for data compres-
sion”. In Proceedings of the 2008 Data Compression Conference (DCC ’08), page 512, 2008
12. Reza Dorrigiv, Alejandro L´
opez-Ortiz, and Alejandro Salinger. “Optimal speedup on a low-degree
multi-core parallel architecture (LoPRAM) ”. In Proceedings of the 20th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA ’08), pages 185–187, 2008
13. Reza Dorrigiv and Alejandro L´
opez-Ortiz. “On certain new models for paging with locality of refer-
ence”. In Proceedings of the 2nd Workshop on Algorithms and Computation (WALCOM ’08), pages
200-209, 2008
14. Reza Dorrigiv and Alejandro L´
opez-Ortiz. “Closing the gap between theory and practice: New mea-
sures for on-line algorithm analysis”. In Proceedings of the 2nd Workshop on Algorithms and Compu-
tation (WALCOM ’08), pages 13-24, 2008
15. Spyros Angelopoulos, Reza Dorrigiv, and Alejandro L´
opez-Ortiz. “On the separation and equivalence
of paging strategies”. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA ’07), pages 229–237, 2007
16. Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges
Simjour, and Hamid Zarrabi-Zadeh. “On the complexity of ﬁnding an unknown cut via vertex queries”.
In Proceedings of the 13th Annual International Conference on Computing and Combinatorics (CO-
COON ’07), pages 459–469, 2007
17. Reza Dorrigiv, Alejandro L´
opez-Ortiz, and Pawel Pralat, “Search algorithms for unstructured peer-
to-peer networks”. In Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks
(LCN ’07), pages 343-352, 2007
18. Reza Dorrigiv, Alejandro L´
opez-Ortiz, and J. Ian Munro. “On the relative dominance of paging
algorithms”. In Proceedings of the 18th International Symposium on Algorithms and Computation
(ISAAC ’07), pages 488–499, 2007
19. Reza Dorrigiv and Alejandro L´
opez-Ortiz. “A survey of performance measures for on-line algorithms”.
ACM SIGACT (Special Interest Group on Automata and Computability Theory) News, 36 (3): 67–81,
2005
20. Reza Dorrigiv. “Operations and invariant properties”. Roshde Amuzeshe Riazi Journal, Fall 2002. (in
Persian)
Awards :
1. Inaugural Cheriton Scholarship, 10000$ per annum, 2007 and 2008
2. ICR Doctoral Fellowship, University of Waterloo, 12000$ per annum, 2003/2004
3. Top student in aggregated average(18.70 out of 20) among all of the computer engineering students who
entered Sharif University of Technology in 1999
4. Achieving the Bronze Medal in the 8th Iranian National Olympiad of Informatics (and entering
Young Scholars Club), 1998
5. Being accepted in “The First Iranian Computer Engineering Olympiad” which was held among
undergraduate students in the ﬁeld of computer engineering in a national level, 2002
3

Remark: These Olympiads are held by “The Iranian Ministry Of Science, Research and Technology”
in several engineering ﬁelds.
6. Beginning the undergraduate studies in Computer Engineering Department of Sharif University
of Technology, 1999
7. 1st place in Iran in the National “AyandeSazan” scientiﬁc competition, 1996
Remark: Scientiﬁc competition of “AyandeSazan” was held among students of the same grade. I got
the ﬁrst place among students of the 8th grade.
8. 3rd place in Iran in the National “Dahe Fajr” scientiﬁc competition, 1995
Remark: Scientiﬁc competitions of “Dahe Fajr” were held by the “Ministry of Education and Training”
among students of the same grade at several levels. I was chosen as the best student in city and
province and got the third place in the national level.
9. Entering the National Organizations for Development of Exceptional Talent(NODET), 1992
Service :
• Organizer of algorithms and complexity seminars, School of computer Science, University of Waterloo,
since Fall 2004
• Member of local organizing committee for the The 9th Latin American Theoretical Informatics Sympo-
sium (LATIN ’10)
• Webmaster for algorithms and complexity group Webpage, School of computer Science, University of
Waterloo
• Webmaster for the The 9th Latin American Theoretical Informatics Symposium (LATIN ’10)
• Member of local organizing committee for the 9th Workshop on Algorithms and Data Structures (WADS
’05)
• Member of local organizing committee for the 2005 Workshop on Combinatorial and Algorithmic Aspects
of Networking (CAAN ’05)
• Volunteer for CS4U@Waterloo (A program for high school students)
• Referee for:
– Journal of Experimental Algorithmics, 2010
– 1st Symposium on Innovations in Computer Science (ICS), 2010
– 4th Workshop on Algorithms and Computation (WALCOM), 2010
– International Journal of Computer Mathematics, 2009
– 8th International Symposium on Experimental Algorithms (SEA), 2009
– 35th International Colloquium on Automata, Languages and Programming (ICALP), 2008a, 2008b
– 19th Annual Symposium on Combinatorial Pattern Matching (CPM), 2008
– 2008 Data Compression Conference (DCC), 2008
– 8th Latin American Theoretical Informatics Symposium (Latin), 2008a, 2008b, 2008c
– 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007a, 2007b
– 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS),
2007
– 33rd International Colloquium on Automata, Languages and Programming (ICALP), 2006a, 2006b
– Canadian Conference on Artiﬁcial Intelligence, 2006
– 10th Scandinavian Workshop on Algorithm Theory (SWAT), 2006
– 8th Workshop on Algorithm Engineering and Experiments (ALENEX), 2006a, 2006b
Presentations :
4

• Adaptive analysis of online algorithms, Dagstuhl Seminar on Robot Navigation, October 2006
• On the Separation and Equivalence of Paging Strategies, Algorithms and Complexity Seminar, University
of Waterloo, October 2006
• On the separation and equivalence of paging strategies, 18th Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA ’07), January 2007
• Closing the gap between theory and practice: A reﬁned framework for the study of paging and other
on-line algorithms, 2007 Cheriton Research Symposium, University of Waterloo, September 2007
• On the relative dominance of paging algorithms, Algorithms and Complexity Seminar, University of
Waterloo, November 2007
• On the relative dominance of paging algorithms, 18th International Symposium on Algorithms and
Computation (ISAAC ’07), December 2007
• List update with locality of reference, 8th Latin American Theoretical Informatics Symposium (LATIN
’08), April 2008
• Adaptive searching in one and two dimensions, Algorithms and Complexity Seminar, University of
Waterloo, August 2008
• Adaptive searching in one and two dimensions, 20th Canadian Conference on Computational Geometry
(CCCG ’08), August 2008
• Alternative measures for the analysis of online algorithms , Dagstuhl Seminar on Adaptive, Output
Sensitive, Online and Parameterized Algorithms, April 2009
• Parameterized analysis of paging and list update algorithms, 7th Workshop on Approximation and Online
Algorithms (WAOA 09), September 2009
References :
• Alejandro L´
opez-Ortiz (alopez-o@uwaterloo.ca)
Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo,
Ontario, Canada, N2L 3G1
• J. Ian Munro (imunro@uwaterloo.ca)
Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo,
Ontario, Canada, N2L 3G1
• Jochen K¨
onemann (jochen@math.uwaterloo.ca)
Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West,
Waterloo, Ontario, Canada, N2L 3G1
5