Tetsuo Asano,
Hiroshi Umeo:
Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. 77-85
Wojciech Rytter:
A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. 138-145
Dietmar Uhlig:
On Reliable Networks from Unreliable Gates. 155-162
Imrich Vrto:
Area-time Tradeoffs for Selection. 163-168
F. Wächter:
Optimization of Special Permutation Networks Using Simple Algebraic Relations. 169-174
Chee-Keng Yap:
What Can be Parallelized in Computational Geometry?. 184-195