Titlebook: STACS 88; 5th Annual Symposium Robert Cori,Martin Wirsing Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.Aut

Panther

Laconic

专横

The relation of two patterns with comparable languages,t results that it is true only for very restricted patterns (with variables only) and only when erasing substitutions are considered. The relation between two patterns is studied also in the case that the languages they produce are equal.

DEMN

Emmenagogue

Venules

FECK

On the construction of optimal time adders,f multiplexer cells is used in the carry computation part. We show that, for the complete conditional carry adder, this results in an overall computation time which seems to be substantially shorter than for any other known (optimal time) adder (e.g. carry look ahead adders ([BrKu]) or conditional s

最有利

On computations with integer division,ts. We characterize the families of languages L ⊂ ℕ that can be recognized over {+, −, DIV.}, {+, −, DIV}, and {+, −, *, DIV}, resp. and show that they are identical. Furthermore we prove lower bounds for CT‘s with operations {+, −, DIV.} for languages L ⊂ ℕ which only contain short arithmetic progr

Infuriate

Maintaining range trees in secondary memory, memory. To this end, we have to partition range trees into parts that can be stored in consecutive blocks in secondary memory. A number of partition schemes will be presented that limit the part sizes and the number of disk accesses necessary for performing updates and queries. Matching lower bound

贪婪地吃