Education
- Ph.D. in
Computer Science, September 2003-e September 2007
University
of British Columbia, Vancouver, Canada.CourseWork:
Computational Complexity (94) - MultiAgent Systems (Game Theory) (93) -
Machine Learning (AUDIT).
- M.Math. in Computer Science, January
2002-August 2003
University of Waterloo, Waterloo,
Canada.Overall GPA: 92 out of
100
CourseWork: Graph Theoretic Algorithms (97) - Advanced
Algorithms (94) - Algorithms for the Internet (95) - Computer-Aided
Verification (86) - Cryptography/Network Security (88) - Randomized
Algorithms (AUDIT).
- B.Sc. in Computer Engineering (minor in
Software), September 1997-August 2001
Sharif University of
Technology, Tehran, Iran.Overall
GPA: 17.01 out of 20
CourseWork: Advanced Algorithms (20 out
of 20) - Seminars on Graphs and Algorithms (19.5 out of
20).
Research
Interests
- Research
Interests. Design and analysis of
algorithms (approximation and randomized algorithms in particular),
constraints satisfaction, algorithmic graph theory, metric embedding, game
theory, and combinatorial optimization.
Employment History: Research
Experiences
Researcher
Department of
Computer Science, University of British Columbia. with Prof. Will Evans et
al.
April 2004-April 2004
Projects:
- We worked on
Bar-K-Visibility graphs and obtained various results.
Research Assistant
Bioinformatics, and Empirical and
Theoretical Algorithmics Laboratory (beta-Lab) supervised by Prof.
Will Evans
September 2003-August 2007
Projects:
- We've proved that
series-parallel graphs are embeddable into l1 with distortion 6.0. The
previous bound was 13.92. This has application in the sparsest cut problem
which is, in turn, the main ingredient of many other hard
problems.
- We proved that if the optimal embedding
distortion between two line metrics is at most some constant, 13.63, then
one can find that embedding in polytime. We also found some applications
in pattern matching and stack sorting.
- We resolved
some fundamental questions about D-Width: An algorithm for computing
optimal D-Decomposition for bound D-Width digraphs, equivalence between
D-Width and cop-monotone cops and robber game and some other algorithmic
results.
- We extended D-Width to hypergraphs and
proposed hyper D-Width as a measure of connectivity. One very nice
implication was tractable solution for bounded hyper D-Width SAT problems
in which every variable occurs in bounded number of
clauses.
Research
Assistant
School of Computer Science,
University of Waterloo, supervised by Prof. Prabhakar
Ragde
January 2002-August 2003
Projects:
- We introduced
D-Width as a new measure of connectivity for directed graphs. It resembles
tree-width on undirected graphs, has all advantages of previous definition
by Johnson et al., and has potential for many algorithmic
applications.
Researcher
School of
Computer Science, University of Waterloo, with Prof. Alex Lopez
Ortiz
September 2002-August 2003
Projects:
- We found a linear
time order preserving compression which works very well in comparison with
the best non-order-preserving compression methods and has many
applications.
Researcher
School of
Computer Science, University of Waterloo, with Prof. Therese
Biedl
January 2002-May 2002
Projects:
- We proved that
every series parallel graphs in which every edge appesrs in at mos two
triangles has boxicity at most two.
Researcher and Developer
Sharif Arvand Robocup Simulation Group, department of
computer Engineering, Sharif University of
Technology.
1999-2001
Projects:
- We researched and
implemented various AI techniques on a simulated soccer environment. In
particular, I used neural networks to help the goalie take fast and
accurate decisions.
Researcher
Department of
Computer Engineering, Sharif University of Technology, with Prof. Mohammad
Ghodsi
September 2000-August 2001
Projects:
- We worked on
interval routing schemes(IRS) on networks. IRS is a space efficient
routing strategy on networks. In particular, we did some research on
multidimensional interval routing schemes (MIRS) and its connection to
tree-width.
Reviewer
Projects:
- Graphs and Combinatorics Journal: Reviewed
some papers.
- CSI
Computer Conference: Reviewed 7 papers for the 12th International
CSI (Computer Society of Iran) Computer Conference.
- STACS: Reviewed some
papers.
- Theoretical
Computer Science: Reviewed some papers.
Academic
Awards
- Ph.D.
tuition fee award, University of British
Columbia, 2003-2007
- Graduate Entrance Scholarship, Department of Computer Science, University of British
Columbia, 2003
5000$ given
to the best incoming graduate students of every year.
- International Graduates
Scholarshiop, University of
Waterloo, 2002-2003
- Robocup Online Coach League, 2001
1st (together with Sharif-Arvand
Robocup Team Members) in the online coach league at the 5th robocup world
championship, Seattle, US.
- Robocup Simulation League, 2001
3rd (together with Sharif-Arvand
Robocup Team Members) in simulation league at the first German Open
robocup, Paderborn, Germany.
- Robocup Simulation League, 2000
7th (together with Sharif-Arvand
Robocup Team Members) in the simulation league at the 4th robocup world
championship, Melbourne, Australia.
- Robocup Simulation League, 2000
1st (together with Sharif-Arvand
Robocup Team Members) in the first Iranian robocup championship, Tehran,
Iran.
- Iran
university entrance exam, 1997
53rd among more than 350,000 participants in the nation-wide
university entrance exam.
- Iranian Olympiad in Informatics, 1997
- Iranian Olympiad in
Informatics, 1996
Publications
Employment History: Teaching Experiences
Teaching
Assistant
Projects:
- CPSC445: Algorithm for Bioinformatics. Winter'05,
Winter'07.
- CPSC320: Intermediate Algorithms.
Fall'03, Winter'03, Summer'04, Summer'05, Fall'05.
- CS466/666 (University of Waterloo): Advanced Algorithms.
Winter'02.
- CS240 (University of Waterloo): Data
Structures and Data Management. Winter'02.
- CS241
(University of Waterloo): Foundation of Sequential Programming.
Winter'02.
- Winter'02: (University of Waterloo)
Principles of Computer Science. Winter'02.
- CE40-224: (Sharif University of Technology). Data
Structures and Algorithms. Winter'01.
- CE40-411
(Sharif University of Technology). Theory of Machines and Languages.
Fall'00.
Lecturer
Projects:
- 1999-2001:
Backtracking and algorithm techniques. for participants of International
Computer and Informatics Olympiad, Young Scholars Club,
Iran.
Presentations
Projects:
- "D-Width: A more
natural measure for directed tree-width", in 30th International Symposium
on Mathematical Foundations of Computer Science (MFCS'05), Gdansk, Poland,
August'05.
- "Directed One Trees", in European
Conference on Combinatorics, Graph Theory and Applications (EuroComb'05),
Berlin, Germany, August'05.
- "Metric Embedding", in
Complexity Group at the department of Computing Science, Simon Fraser
University, October 2006.
Workshops attended
UBC
TAG Program
April 2006
A 24 hour workshop, Instructional Skills Workshops. A
certificate was given at the end.
Employment History: Professional
Experiences
Website
Administrator
Sharif University of Technology
Association
August 2003-October 2005
Projects:
- SUTA Reunion
2004
- Membership management (credit card payment
process through authorize.net gateway, membership reminders,
etc.)
Founder and
Administrator
Academier
May
2006-Present
Academier is a
a universal place for people in academia to build their homepage, make
resume, make networking, and manage their papers.
Technical
Skills
Programming Languages:
C/C++, Perl, Java, Pascal.
Web Development: (X)HTML
/ CSS / Javascript, Perl / PHP, Web 2.0.
Linux / UNIX: Shell
scripts, Network programming, Distributed computing, Cross
compiling.
Internationalization:
Unicode, Bidirectional text,
Localization.
Academic Software
and Languages: Matlab, Maple, LISP,
Prolog.
Database: Mysql.
XML:
XML, XSL, XPath, DTD, DOM, RSS,
RDF.