We present two methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is surprisingly natural andâ€¦ (More)

We present two new methods for finding a lowest common ancesto r (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices andm edges. The first method is surprisingly naturalâ€¦ (More)

<italic>Two new algorithms finding relative neighborhood graph RNG(V) for a set V of n points are presented. The first algorithm solves this problem for input points inâ€¦ (More)

A new geometrical transform, skewed-projection, is introduced. This transform is applied to design a new algorithm for a common transversal problem for families of polyhedra inâ€¦ (More)

This paper presents a theoretical study of a model of parallel computations called Parallel Alternating-Direction Access Machine (padam). padam is an abstraction of the multiprocessor computers adenaâ€¦ (More)