2924 search results - page 74 / 585 » Lower Bounds in Distributed Computing |
DAM
2008
13 years 9 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
RANDOM
1998
Springer
14 years 1 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
SPAA
1995
ACM
14 years 13 days ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
SIGMETRICS
2008
ACM
13 years 8 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
MFCS
2007
Springer
14 years 3 months ago
2007
Springer
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the clien...