52 search results - page 10 / 11 » On Factor Universality in Symbolic Spaces |
STOC
2012
ACM
11 years 8 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 ≥...
WETICE
2000
IEEE
13 years 10 months ago
2000
IEEE
This paper presents joint work by the California Institute of Technology’s Jet Propulsion Laboratory and the University of California at Davis (UC Davis) sponsored by the Nation...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
WWW
2011
ACM
13 years 1 months ago
2011
ACM
As information technology supports more aspects of modern life, digital access has become an important tool for developing regions to lift themselves from poverty. Though broadban...
POPL
2006
ACM
14 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...