400 search results - page 38 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
ASAP
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we analyze the theoretical delay bound of the SHA-1 algorithm and propose architectures to achieve high throughput hardware implementations which approach this boun...
115
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
SPAA
1995
ACM
15 years 3 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...