15. MFCS 1990: Banská Bystrica, Czechoslovakia
Invited Lectures
Egon Börger:
A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation.
1-14
Dexter Kozen:
On Kleene Algebras and Closed Semirings.
26-47
Christoph Meinel:
Restricted Branching Programs and Their Computational Power.
61-75
Willem G. Vree:
Implementation of Parallel Graph Reduction by Explicit Annotation and Program Transformation.
135-151
Communications
Maris Alberts:
Interrogative Complexity of omega-Languages' Recognition.
152-157
Ivana Cerná:
Some Properties of Zerotesting Bounded One-Way Multicounter Machines.
195-201
Carsten Damm:
The Complexity of Symmetric Functions in Parity Normal Forms.
232-238
Dainis Geidmanis:
On Possibilities of One-Way Synchronized and Alternating Automata.
292-299
Friedhelm Hinz:
The Membership Problem for Context-Free Chain Code Picture Languages.
329-336
Bengt Jonsson:
A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract).
347-354
Emmanuel Kounalis:
Pumping Lemmas for Tree Languages Generated by Rewrite Systems.
369-377
Matthias Krause:
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.
385-391
Mirko Krivánek:
The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.
392-398
Ana Pasztor:
A Sup-Preserving Completion of Ordered Partial Algebras.
446-456
Regimantas Pliuskevicius:
Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary Calculi.
464-469
Stephan Waack:
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract).
492-498
Andreas Weber:
Distance Automata Having Large Finite Distance or Finite Ambiguity.
508-515
Ingo Wegener:
Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).
516-522
Thomas Zeugmann:
Computing Large Polynomial Powers Very Fast in Parallel.
538-544
data released under the ODC-BY 1.0 license
