| Two-dimensional range successor in optimal time and almost linear space G Zhou Information Processing Letters 116 (2), 171-174, 2016 | 18* | 2016 |
| A framework for succinct labeled ordinal trees over large alphabets M He, JI Munro, G Zhou Algorithmica 70 (4), 696-717, 2014 | 18 | 2014 |
| Path Queries in Weighted Trees. M He, JI Munro, G Zhou ISAAC, 140-149, 2011 | 16* | 2011 |
| Succinct Data Structures for Path Queries. M He, JI Munro, G Zhou ESA, 575-586, 2012 | 15 | 2012 |
| Succinct Indices for Path Minimum, with Applications TM Chan, M He, JI Munro, G Zhou Algorithmica 78 (2), 453–491, 2017 | 10 | 2017 |
| Data structures for path queries M He, JI Munro, G Zhou ACM Transactions on Algorithms (TALG) 12 (4), 1-32, 2016 | 9 | 2016 |
| Succinct indices for path minimum, with applications to path reporting TM Chan, M He, JI Munro, G Zhou Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014 | 7 | 2014 |
| Multidimensional range selection TM Chan, G Zhou Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015 | 5 | 2015 |
| Dynamic path counting and reporting in linear space M He, JI Munro, G Zhou Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014 | 3 | 2014 |
| Dynamic path queries in linear space M He, JI Munro, G Zhou Algorithmica 80, 3728-3765, 2018 | 1 | 2018 |
| In-Memory Storage for Labeled Tree-Structured Data G Zhou University of Waterloo, 2017 | | 2017 |
Meng HeAssociate Professor, Dalhousie UniversityVerified email at cs.dal.ca
