53 search results - page 6 / 11 » Fully-Functional Succinct Trees |
109
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
ADC
2003
Springer
15 years 1 months ago
2003
Springer
Information available in the Internet is frequently supplied simply as plain ascii text, structured according to orthographic and semantic conventions. Traditional document classi...
DEXAW
2008
IEEE
15 years 3 months ago
2008
IEEE
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
ICML
1990
IEEE
15 years 1 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...