2924 search results - page 42 / 585 » Lower Bounds in Distributed Computing |
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
COCO
1999
Springer
14 years 1 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
COCO
2003
Springer
14 years 2 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
FOCS
2007
IEEE
14 years 21 days ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...