Spremljaj
Meng He
Meng He
Professor, Faculty of Computer Science, Dalhousie University
Preverjeni e-poštni naslov na cs.dal.ca - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
1472011
Succinct representation of labeled graphs
J Barbay, L Castelli Aleardi, M He, JI Munro
Algorithmica 62 (1-2), 224-257, 2012
84*2012
Succinct orthogonal range search structures on a grid with applications to text indexing
P Bose, M He, A Maheshwari, P Morin
Workshop on Algorithms and Data Structures, 98-109, 2009
822009
Succinct ordinal trees based on tree covering
M He, JI Munro, SR Satti
ACM Transactions on Algorithms (TALG) 8 (4), 1-32, 2012
76*2012
Succinct representations of dynamic strings
M He, JI Munro
International Symposium on String Processing and Information Retrieval, 334-346, 2010
502010
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
452015
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
M He, G Tang, N Zeh
International Symposium on Algorithms and Computation, 128-140, 2014
422014
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
412005
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
302013
Fast and compact planar embeddings
L Ferres, J Fuentes-Sepúlveda, T Gagie, M He, G Navarro
Computational Geometry 89, 101630, 2020
282020
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
272012
Finding frequent elements in compressed 2D arrays and strings
T Gagie, M He, JI Munro, PK Nicholson
International Symposium on String Processing and Information Retrieval, 295-300, 2011
262011
Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing
Y Gao, M He, Y Nekrich
arXiv preprint arXiv:2006.11978, 2020
192020
A framework for succinct labeled ordinal trees over large alphabets
M He, JI Munro, G Zhou
Algorithmica 70 (4), 696-717, 2014
192014
On the advice complexity of buffer management
R Dorrigiv, M He, N Zeh
Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012
192012
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
182011
Path queries in weighted trees
M He, JI Munro, G Zhou
International Symposium on Algorithms and Computation, 140-149, 2011
172011
Succinct and implicit data structures for computational geometry
M He
Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of …, 2013
162013
Succinct data structures for path queries
M He, JI Munro, G Zhou
European Symposium on Algorithms, 575-586, 2012
162012
Dynamic range selection in linear space
M He, JI Munro, PK Nicholson
International Symposium on Algorithms and Computation, 160-169, 2011
162011
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20