2252 search results - page 160 / 451 » Lower Bounds for Dynamic Algorithms |
139
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
163
Voted
ECCC
2011
14 years 10 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
121
click to vote
SWAT
1994
Springer
15 years 7 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
110
Voted
ALGORITHMICA
2000
15 years 3 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
95
Voted
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...