Gelin Zhou
Gelin Zhou
Verified email at uwaterloo.ca
TitleCited byYear
Succinct data structures for path queries
M He, JI Munro, G Zhou
European Symposium on Algorithms, 575-586, 2012
152012
A framework for succinct labeled ordinal trees over large alphabets
M He, JI Munro, G Zhou
Algorithmica 70 (4), 696-717, 2014
142014
Path queries in weighted trees
M He, JI Munro, G Zhou
International Symposium on Algorithms and Computation, 140-149, 2011
14*2011
Two-dimensional range successor in optimal time and almost linear space
G Zhou
Information Processing Letters 116 (2), 171-174, 2016
13*2016
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
62014
Data structures for path queries
M He, JI Munro, G Zhou
ACM Transactions on Algorithms (TALG) 12 (4), 53, 2016
42016
Multidimensional range selection
TM Chan, G Zhou
International Symposium on Algorithms and Computation, 83-92, 2015
32015
Dynamic path counting and reporting in linear space
M He, JI Munro, G Zhou
International Symposium on Algorithms and Computation, 565-577, 2014
32014
Succinct Indices for Path Minimum, with Applications
TM Chan, M He, JI Munro, G Zhou
Algorithmica 78 (2), 453–491, 2017
22017
Dynamic Path Queries in Linear Space
M He, JI Munro, G Zhou
Algorithmica 80 (12), 3728-3765, 2018
2018
In-Memory Storage for Labeled Tree-Structured Data
G Zhou
University of Waterloo, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–11