Balanced parentheses strike back
Work
Year: 2008
Type: article
Abstract: An ordinal tree is an arbitrary rooted tree where the children of each node are ordered. Succinct representations for ordinal trees with efficient query support have been extensively studied. The best... more
Source: ACM Transactions on Algorithms
Authors Hsueh-I Lu, Chia-Chi Yeh
Institution National Taiwan University
Cites: 30
Cited by: 49
Related to: 10
FWCI: 5.875
Citation percentile (by year/subfield): 93.51
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder National Science Council
Grant ID 94-2213-F-002-12695-2221-E-002-07796-2221-E-002-033