2084 search results - page 36 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
65
Voted
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
TIT
2010
14 years 4 months ago
2010
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
COCO
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
87
Voted
PIMRC
2010
IEEE
14 years 7 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...