Sciweavers

419 search results - page 9 / 84
» Succincter
Sort
View
CCCG
2008
14 years 11 months ago
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
RSA
2000
95views more  RSA 2000»
14 years 9 months ago
Distribution of the number of consecutive records
A succinct series expression is derived for describing the limit distribution of the number of times r consecutive elements are all records (in a sequence of independent and ident...
Hua-Huai Chern, Hsien-Kuei Hwang, Yeong-Nan Yeh
ICALP
2009
Springer
15 years 9 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 11 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
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 10 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola