126
click to vote
ICPP
1995
IEEE
15 years 8 months ago
1995
IEEE
Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these ...
133
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
132
click to vote
ICPP
1995
IEEE
15 years 8 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...