Paris 2011

Mei Jiang

Ph.D. Candidate (Computer Science)
M.Sc. (Computer Science, McMaster University)
B.CS (University of New Brunswick, Fredericton)
Advanced Optimization Laboratory
Department of Computing and Software
Faculty of Engineering
McMaster University
ITB116, 1280 Main Street West
Hamilton, Ontario L8S 4K1, Canada
Tel.: +1-905-525-9140 ext. 27248
E-mail: jiangm5@mcmaster.ca

[Awards]   [Research Interests]   [Publications]   [Technical Reports]   [Presentation]   [Teaching Assistantship]  


Awards

  1. 2011/2012
    Ontario Graduate Scholarship
  2. 2010/2011
    Queen Elizabeth II Graduate Scholarship in Science and Technology
[TOP]  

Research Interests

I'm currently working under the supervision of Dr. Frantisek Franek and Dr. Antoine Deza. My primary research interests includes the optimization and parallelization of the repetition algorithms in Stringology area.
  1. Square-maximal strings
[TOP]  

Publications

  1. F. Franek, M. Jiang, and C. Weng
    An improved version of the runs algorithm based on Crochemore's partitioning algorithm
    The Prague Stringology Conference 2011 (accepted)
  2. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings
    The 22nd Annual Symposium on Combinatorial Pattern Matching 2011 (accepted)
  3. F. Franek and M. Jiang
    Crochemore's repetitions algorithm revisited - computing runs
    International Journal of Foundations of Computer Science, to appear (accepted August 2010)
  4. F. Franek and M. Jiang
    Crochemore's repetitions algorithm revisited - computing runs
    Proceedings of the Prague Stringology Conference, Prague, Czech Republic (2009) 214-224
[TOP]  

Technical Reports

  1. F. Franek, M. Jiang, and C. Weng
    An improved version of the runs algorithm based on Crochemore's partitioning algorithm
    AdvOL-Report No. 2011/3, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, May 2011, [pdf]
  2. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings
    AdvOL-Report No. 2011/1, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, January 2011, [pdf]
  3. F. Franek and M. Jiang
    A Parallel Approach to Computing Runs in a String
    AdvOL-Report No. 2010/5, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, June 2010, [pdf]
  4. F. Franek and M. Jiang
    Crochemore repetition algorithm revisited - computing runs
    AdvOL-Report No. 2009/1, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, April 2009, [pdf]
[TOP]  

Presentation (the speaker's name is underlined)

  1. F. Franek, M. Jiang, and C. Weng
    An improved version of the runs algorithm based on Crochemore's partitioning algorithm[pdf]
    Prague Stringology Conference, Prague, Czech Republic, August 29 - 31, 2011
  2. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings[pdf]
    The 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Palermo, Italy, June 27 - 29, 2011
  3. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings[pdf]
    AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, March 8, 2011
  4. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings[pdf]
    London Stringology Days / London Algorithmic Workshop, London, U.K., February 7 - 8, 2011
  5. M. Jiang
    Parallelizing Crochemore's Repetitions Algorithm to Compute Runs in Strings[pdf]
    AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, April 27, 2010
  6. F. Franek and M. Jiang
    Crochemore's repetitions algorithm revisited - computing runs[pdf]
    Prague Stringology Conference, Prague, Czech Republic, August 31 - September 4, 2009
  7. F. Franek and M. Jiang
    Crochemore's algorithm for repetitions revisited - computing runs [pdf]
    The 4th Stringology Research Workshop, Bar-Ilan University, Ramat Gan, Israel, March 29 - April 2, 2009
  8. M. Jiang
    Revising Crochemore's Repetitions Algorithm to Compute Runs in a String [pdf]
    AdvOL student smeninar, Department of Computing and Software, McMaster University, Hamilton, Canada, March 5, 2009
[TOP]  

Teaching Assistantship

  1. Fall 2008/2009
    Software Design II - Large System Design (SE3A04)
  2. Winter 2009/2010, 2010/2011
    Databases (SE4M03/6M03)
[TOP]  

Last updated on May 20, 2011.

Valid HTML 4.01 Transitional