2252 search results - page 243 / 451 » Lower Bounds for Dynamic Algorithms |
128
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
140
Voted
TIT
2008
15 years 3 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
173
Voted
ANCS
2010
ACM
15 years 1 months ago
2010
ACM
Over the past few years, researchers have developed many crosslayer wireless protocols to improve the performance of wireless networks. Experimental evaluations of these protocols...
149
Voted
IOPADS
1997
15 years 5 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
135
click to vote
IAT
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...