2252 search results - page 310 / 451 » Lower Bounds for Dynamic Algorithms |
143
Voted
ESA
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
126
click to vote
MIDDLEWARE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Epidemic protocols have demonstrated remarkable scalability and robustness in disseminating information on internet-scale, dynamic P2P systems. However, popular instances...
149
Voted
PODS
2001
ACM
16 years 3 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
116
Voted
ICDCN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...
113
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...