Titlebook: Mathematical Foundations of Computer Science 1988; 13th Symposium Carls Michal P. Chytil,Václav Koubek,Ladislav Janiga Conference proceedin

ERUPT

geriatrician

Robust oracle machines,istic "witness searching" process in NP problems. It is shown that straightforward modifications of the original notion are closely related with other concepts in structural complexity theory, such as "self-reducibility", "lowness", and "interactive proof systems".

Antecedent

disciplined

Comparing interconnection networks,escriptions of efficient methods to simulate an algorithm designed for one type of architecture on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors.

HUMP

Distribution of Sequential Processes,y equivalent concurrent processes? The models of systems are finite automata in the non-distributed case and some collection of finite automata with synchronization in the distributed case. The concurrency criterion is commutativity.

Kaleidoscope

reception

Reusable specification components,ation. Every node of the tree is a structured specification. In contrast to other approaches to software reusability these trees are considered as objects of the language and can be constructed and manipulated by operators of the language.

松馳

Meager

小丑