36 search results - page 6 / 8 » Resizable Arrays in Optimal Time and Space |
STOC
2012
ACM
12 years 1 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
ACRI
2004
Springer
14 years 4 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
VLDB
2004
ACM
14 years 4 months ago
2004
ACM
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
ICTAI
2003
IEEE
14 years 4 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
ALGORITHMICA
2010
13 years 11 months ago
2010
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...