Sciweavers

Share
16 search results - page 1 / 4
» An Improved Succinct Representation for Dynamic k-ary Trees
Sort
View
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
8 years 5 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
9 years 27 days ago
Fully-Functional Succinct Trees
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...
Kunihiko Sadakane, Gonzalo Navarro
SODA
2001
ACM
144views Algorithms» more  SODA 2001»
8 years 4 months ago
Representing dynamic binary trees succinctly
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
J. Ian Munro, Venkatesh Raman, Adam J. Storm
SPIRE
2010
Springer
8 years 1 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro
CN
2004
114views more  CN 2004»
8 years 3 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
books