In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Many strategies have been proposed to address the problems associated with managing increasingly complex computing systems. IBM's Autonomic Computing (AC) paradigm is one suc...