Meng He
Meng He
Associate Professor, Dalhousie University
Verified email at - Homepage
Cited by
Cited by
Succinct indexes for strings, binary relations and multilabeled trees
J Barbay, M He, JI Munro, SR Satti
ACM Transactions on Algorithms (TALG) 7 (4), 52, 2011
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.
P Bose, M He, A Maheshwari, P Morin
WADS 5664, 98-109, 2009
Succinct representation of labeled graphs
J Barbay, L Castelli Aleardi, M He, JI Munro
Algorithmica 62 (1-2), 224-257, 2012
Succinct ordinal trees based on tree covering
M He, JI Munro, SR Satti
ACM Transactions on Algorithms (TALG) 8 (4), 1-32, 2012
Succinct representations of dynamic strings
M He, JI Munro
String Processing and Information Retrieval: 17th International Symposium …, 2010
On minimum-and maximum-weight minimum spanning trees with neighborhoods
R Dorrigiv, R Fraser, M He, S Kamali, A Kawamura, A López-Ortiz, D Seco
Theory of Computing Systems 56, 220-250, 2015
A categorization theorem on suffix arrays with applications to space efficient text indexes
M He, JI Munro, SS Rao
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
M He, G Tang, N Zeh
Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014
Succinct geometric indexes supporting point location queries
P Bose, EY Chen, M He, A Maheshwari, P Morin
ACM Transactions on Algorithms (TALG) 8 (2), 10, 2012
Fast and compact planar embeddings
L Ferres, J Fuentes-Sepúlveda, T Gagie, M He, G Navarro
Computational Geometry 89, 101630, 2020
Range majority in constant time and linear space
S Durocher, M He, JI Munro, PK Nicholson, M Skala
Information and Computation 222, 169-179, 2013
Finding Frequent Elements in Compressed 2D Arrays and Strings.
T Gagie, M He, JI Munro, PK Nicholson
SPIRE, 295-300, 2011
On the advice complexity of buffer management
R Dorrigiv, M He, N Zeh
Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012
A framework for succinct labeled ordinal trees over large alphabets
M He, JI Munro, G Zhou
Algorithmica 70 (4), 696-717, 2014
Untangled monotonic chains and adaptive range search
D Arroyuelo, F Claude, R Dorrigiv, S Durocher, M He, A López-Ortiz, ...
Theoretical Computer Science 412 (32), 4200-4211, 2011
Path Queries in Weighted Trees.
M He, JI Munro, G Zhou
ISAAC, 140-149, 2011
Dynamic range selection in linear space
M He, JI Munro, PK Nicholson
Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011
Succinct and implicit data structures for computational geometry
M He
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of …, 2013
Succinct Data Structures for Path Queries.
M He, JI Munro, G Zhou
ESA, 575-586, 2012
Space efficient data structures for dynamic orthogonal range counting
M He, JI Munro
Computational Geometry 47 (2), 268-281, 2014
The system can't perform the operation now. Try again later.
Articles 1–20