6129 search results - page 1084 / 1226 » A parallel LLL algorithm |
146
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
147
click to vote
PODC
2005
ACM
15 years 10 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...
247
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
149
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
124
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...