SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
SPAA
2005
ACM
13 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...