#### Filter Results:

#### Publication Year

1983

1989

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The running time of Shellsort, with the number of passes restricted to @log N), was thought for some time to be Q(N212), due to general results of Pratt. Sedgewick recently gave an O(N413) bound, but extensions of his method to provide better bounds seem to require new results on a classical problem in number theory. In this paper, we use a different… (More)

This paper describes the organization of the CENTAUR system and its main components. The system is a generic interactive environment. When given the formal specification of a particular programming language-including syntax and semantics — it produces a language specific environment. This resulting environment includes a structure editor, an… (More)

This paper describes a new method for triangulating a simple n-sided polygon. The algorithm runs in time O(n log s), with s _< n. The quantity s measures the sinuosity of the polygon, that is, the number of times the boundary alternates between complete spirals of opposite orientation. The value of s is in practice a very small constant, even for extremely… (More)

- ‹
- 1
- ›