685 search results - page 1 / 137 » Succinct Trees in Practice |
102
Voted
ALENEX
2010
15 years 1 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...
112
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
141
Voted
CPM
2004
Springer
15 years 5 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
111
Voted
KBSE
2000
IEEE
15 years 4 months ago
2000
IEEE
When a lack of data inhibits decision making, large scale what-if queries can be conducted over the uncertain parameter ranges. Such what-if queries can generate an overwhelming a...
CSL
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...