عنوان

Theoretical computer science :

(Number (ISBN

3540385614

(Number (ISBN

9783540385615

Number

b565882

Title Proper

Theoretical computer science :

General Material Designation

[Book]

Other Title Information

5th GI-conference, Karlsruhe, March 23-25, 1981

First Statement of Responsibility

edited by Peter Deussen.

Place of Publication, Distribution, etc.

Berlin ; New York

Name of Publisher, Distributor, etc.

Springer-Verlag

Date of Publication, Distribution, etc.

1981

Specific Material Designation and Extent of Item

(vii, 260 pages) : illustrations

Series Title

Lecture notes in computer science, 104.

Text of Note

English, French, or German.

Text of Note

On the subword complexity and square-freeness of formal languages --; Cycle-free IN-algebraic systems --; On the height of syntactical graphs --; Boolean functions whose monotone complexity is of size n2/log n --; Netzwerke zur simultanen Berechnung Boolescher Funktionen (Ausführliche Kurzfassung) --; The computational complexity of bilinear multiplications --; P --; complete problems in free groups --; Quelques proprietes des langages a un Compteur --; Un resultat de discontinuite dans les familles de langages --; Verallgemeinerte kommutative Sprachen --; Ein rein automatentheoretischer Aufbau der Theorie der kontext-freien Sarachen --; Un analogue du theoreme des varietes pour les cones et les cylindres --; A family of graphs with expensive depth-reduction --; On?-balanced binary search trees --; Erzeugung optimalen Codes für Series --; Parallel Graphs --; Recent directions in algorithmic research --; Dynamic k-dimensional multiway search under time-varying access frequencies --; Some applications of CFL's over infinite alphabets --; A decidable property of iterated morphisms --; Prefix-preservation for rational partial functions is decidable --; Concurrency and automata on infinite sequences --; An effective retract calculus --; Recursion and complexity theory on CPO-S --; Computable algebras, word problems and canonical term algebras --; Reachability analysis with assertion systems --; Dynamization of decomposable searching problems yielding good worst-case bounds --; Robust balancing in B-trees --; Centers of languages --; (Erasing)* strings.

Computer science -- Congresses.

Computer science.

edited by Peter Deussen.

Gesellschaft für Informatik.

Peter Deussen

Electronic name

[Book]

Y