Meng he
Assistant Professor
Faculty of Computer ScienceÂ
Dalhousie University
Canada
Biography
Dr. MENG HE is affiliated to Faculty of Computer Science , Dalhousie University. Dr. MENG HE is currently providing services as Assistant Professor. Dr. MENG HE has authored I145and co-authored multiple peer-reviewed scientific papers and presented works at many national and International conferences. Dr. MENG HE contributions have acclaimed recognition from honourable subject experts around the world. Dr. MENG HE is actively associated with different societies and academies. Dr. MENG HE academic career is decorated with several reputed awards and funding. Dr. MENG HE research interests include Algorithms and data structures, especially fast and space-efficient algorithms and data structures, including succinct data structures, string algorithms and text indexing, I/O-efficient algorithms, implicit data structures, and adaptive algorithms..
Research Interest
Algorithms and data structures, especially fast and space-efficient algorithms and data structures, including succinct data structures, string algorithms and text indexing, I/O-efficient algorithms, implicit data structures, and adaptive algorithms.
Publications
-
Meng He, J. Ian Munro and Gelin Zhou, A Framework for Succinct Labeled Ordinal Trees over Large Alphabets, Algorithmica, Volume 70, Issue 4 (special issue for the 23rd International Symposium on Algorithms and Computation), pages 696-717,
-
Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz and Diego Seco, On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods, Theory of Computing Systems, Volume 56, Issue 1Â
-
Timothy M. Chan, Meng He, J. Ian Munro and Gelin Zhou, Succinct Indices for Path Minimum, with Applications, Algorithmica, Volume 78, Issue 2, pages 453-491
