| Two-dimensional range successor in optimal time and almost linear space G Zhou Information Processing Letters 116 (2), 171-174, 2016 | 20* | 2016 |
| A framework for succinct labeled ordinal trees over large alphabets M He, JI Munro, G Zhou Algorithmica 70 (4), 696-717, 2014 | 20 | 2014 |
| Path queries in weighted trees M He, JI Munro, G Zhou International Symposium on Algorithms and Computation, 140-149, 2011 | 17* | 2011 |
| Succinct data structures for path queries M He, JI Munro, G Zhou European Symposium on Algorithms, 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 | 12 | 2017 |
| Data structures for path queries M He, JI Munro, G Zhou ACM Transactions on Algorithms (TALG) 12 (4), 1-32, 2016 | 10 | 2016 |
| Multidimensional range selection TM Chan, G Zhou International Symposium on Algorithms and Computation, 83-92, 2015 | 7 | 2015 |
| Succinct indices for path minimum, with applications to path reporting TM Chan, M He, JI Munro, G Zhou European Symposium on Algorithms, 247-259, 2014 | 7 | 2014 |
| Dynamic path counting and reporting in linear space M He, JI Munro, G Zhou International Symposium on Algorithms and Computation, 565-577, 2014 | 4 | 2014 |
| Dynamic path queries in linear space M He, JI Munro, G Zhou Algorithmica 80, 3728-3765, 2018 | 2 | 2018 |
| In-Memory Storage for Labeled Tree-Structured Data G Zhou University of Waterloo, 2017 | | 2017 |
