155 search results - page 2 / 31 » Dynamic Succinct Ordered Trees |
ICALP
2003
Springer
14 years 6 days ago
2003
Springer
ALENEX
2010
13 years 8 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
TACAS
2004
Springer
14 years 10 days ago
2004
Springer
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
LICS
2006
IEEE
14 years 1 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...