6365 search results - page 112 / 1273 » Fast Local Computation Algorithms |
103
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
125
Voted
SIAMCOMP
2002
15 years 2 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
132
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
103
click to vote
ANTS
1998
Springer
15 years 6 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
145
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...