Compact Representations Of Ordered Sets

Compact Representations Of Ordered Sets (2004)

by Daniel K. Blandford , Guy E. Blelloch

Citations:

18 - 3 self

User correction supplied by mph

Datum	Value	Source
TITLE	Compact Representations Of Ordered Sets	user correction - Legacy Corrections
AUTHOR NAME	Daniel K. Blandford	user correction
AUTHOR NAME	Guy E. Blelloch	user correction
ABSTRACT	We consider the problem of e#ciently representing sets S of size n from an ordered universe U = . . . , m-1}. Given any ordered dictionary structure (or comparison-based ordered set structure) D that uses O(n) pointers, we demonstrate a simple blocking technique that produces an ordered set structure supporting the same operations in the same time bounds but with O(n log n ) bits. This is within a constant factor of the information-theoretic lower bound. We assume the unit cost RAM model with word size #ze \|U \|) and a table of size O(m m) bits, for some constant # > 0. The time bound for our operations contains a factor of 1/#. We present	user correction
YEAR	2004	user correction - Legacy Corrections
CITATIONS	5 found	ParsCit 1.0