H. J. M. Goeman

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we introduce the triangular heap, a heap with the special property that for every father node its right child (if present) is smaller than its left child. We show how triangular heaps can be applied to the traditional problem of sorting an array in situ in ways quite similar to well-known methods using ordinary heaps. An average case analysis(More)
An active system component, the arbiter, is proposed as a system struc-turing concept for the implementation of synchronizing primitives. The concept is illustrated by showing a new and very simple implementation of the critical section with a busy form of waiting. This implementation will be reened in such a way that it does not need the commonly stated(More)
  • 1