2252 search results - page 88 / 451 » Lower Bounds for Dynamic Algorithms |
104
click to vote
SOFSEM
1997
Springer
15 years 5 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
113
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
117
click to vote
ECRTS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
123
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
100
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...