746 search results - page 35 / 150 » Updates Under Pstable |
SRDS
2000
IEEE
14 years 26 days ago
2000
IEEE
This paper discusses the implementation and performance of bounded voting: a new object replication protocol designed for use in mobile and weakly-connected environments. We show ...
DCW
2000
Springer
14 years 25 days ago
2000
Springer
: In Web applications it is often required to manipulate information of semistructured nature, which may present variations according to different circumstances. Multidimensional ...
JCP
2007
13 years 8 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...