336 search results - page 1 / 68 » Program Speedups in Theory and Practice |
IFIP
1994
Springer
13 years 9 months ago
1994
Springer
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
PPOPP
2012
ACM
12 years 12 days ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
IFIP
1994
Springer
13 years 9 months ago
1994
Springer
CEFP
2009
Springer
13 years 2 months ago
2009
Springer