In this paper we present techniques that result in time algorithms for computing many properties and functions of an n-node forest stored in an mesh of ...

In this paper we present techniques that result in O(√n) time algorithms for computing many properties and functions of an n-node forest stored in an √n ...

In this paper we present techniques that result in 0 ('1';) time algorithms for computing many properties and functions of an n -node forest stored in an ,r ...

The best previously known algorithms for solving the above problems on the mesh require 0 (V;logn ) time [GRK], and are obtained by implementing, on the mesh, ...

In this paper we present techniques that result in O(√n) time algorithms for computing many properties and functions of an n-node forest stored in an √n ...

In this paper we present techniques that result in O(√n) time algorithms for computing many properties and functions of an n-node forest stored in an √n √n ...

Solving Tree Problems on a Mesh-Connected Processor Array. Authors. Mikhail J. Atallah, Purdue UniversityFollow · Susanne E. Hambrusch, Purdue UniversityFollow ...

We present a deterministic algorithm for selecting the element of rank k among N = n2 elements, 1 S k S N, on an n X n mesh-connected processor array in ...

Using the radix sort and known results for parallel prefix on linked lists, we develop parallel algorithms that efficiently solve various computations on trees ...

[48] M. J. Atallah and S. E. Hambrusch, “Solving tree problems on a mesh-connected processor array,” Information and Control, vol. 69, no. 1-3, pp. 168–187 ...