6939 search results - page 146 / 1388 » Algorithm Engineering for Parallel Computation |
ASAP
2008
IEEE
15 years 8 months ago
2008
IEEE
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
CONCUR
2005
Springer
15 years 7 months ago
2005
Springer
84
Voted
HIPC
2003
Springer
15 years 7 months ago
2003
Springer
130
click to vote
PPOPP
1999
ACM
15 years 6 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...