Titlebook: Mathematical Foundations of Computer Science 1981; 10th Symposium Strbs Jozef Gruska,Michal Chytil Conference proceedings 1981 Springer-Ver

Macronutrients

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626119.jpg

不合

背信

不再流行

On the power of algebraic specifications, to specify hyperarithmetical algebras and are characterized by them. For partial abstract types we prove that every computable partial algebra has an equational hidden enrichment specification and discuss the power of hierarchical partial algebras. Finally we give an example of the specification of a simple nondeterministic programming language.

里程碑

Insubordinate

The art of dynamizing, general techniques that were developed for dynamizing decomposable searching problems and will discuss a recent solution to Bentley‘s original question to devise a dynamization method for such problems with worst-case optimal insertion and deletion routines.

CYN

The complexity of manipulating hierarchically defined sets of rectangles,ugh much theoretical work has appeared recently on the complexity of rectangle problems, it has assumed that the inputs are given as a list of rectangles. In this paper we study the complexity of rectangle problems when the inputs are given in a hierarchical language that allows the designer to buil

糾纏,纏繞

Hyaluronic-Acid

Rheumatologist

The art of dynamizing,asier to find a static solution first, his goal was to obtain efficient dynamic data structures by applying transformations to static data structures. This approach has become a paradigm (known as "dynamization") in current research in the design of efficient algorithms. We shall outline a number of