2924 search results - page 232 / 585 » Lower Bounds in Distributed Computing |
165
click to vote
SPAA
1995
ACM
15 years 7 months ago
1995
ACM
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
127
click to vote
ICN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A simple UDP packet reflector for virtual multicast multimedia transfer is extended to form a distributed system of active elements that solves the scalability problem o...
133
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
122
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
133
Voted
GD
2003
Springer
15 years 9 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...