2084 search results - page 115 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
241
Voted
STOC
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
109
Voted
PPSN
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
131
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. ...
108
Voted
RSA
1998
15 years 2 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
109
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...