7. MFCS 1978: Zakopane, Poland
Invited Lectures
Communications
Mikhail Auguston:
Writing and Verifying Sequential Files Updating Programs.
102-111
François Bancilhon:
On the Completeness of Query Languages for Relational Data Bases.
112-123
Gerhard Barth:
Mastering Contextsensitivity in Programming Languages.
124-133
Jan A. Bergstra:
Decision Problems Concerning Parallel Programming.
134-142
Hans-Dieter Ehrich:
Extensions and Implementations of Abstract Data Type Specifications.
155-164
Georges Gardarin:
Contribution to the Theory of Concurrency in Databases.
201-212
Dima Grigoriev:
Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication.
250-256
Jacek Irlik:
Transforming Recursive Equations to Algorithms.
277-285
Gérard Jacob:
Structural Invariants for Some Classes of Structured Programs.
286-297
Reinhard Klette:
Fast Matrix Multiplication by Boolean RAM in Linear Storage.
308-314
Gerhard Lischke:
Complexity Measures Defined by Mazurkiewicz-Algorithms.
326-332
Otto Mayer:
A Framework for Producing Deterministic Canonical Bottom-up Parsers.
355-363
V. A. Nepomniaschy:
On Divergence and Halting Problems for Monadic Program Schemas.
385-392
Rohit Parikh:
The Completeness of Propositional Dynamic Logic.
403-415
Alberto Pettorossi:
Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract).
416-425
Jan Pittl:
On Two Subclasses of Real-Time Grammars.
426-435
Zbigniew W. Ras:
On Information Storage and Retrieval Systems: An Algebraic Approach, Part I.
436-441
Michel Sintzoff:
Ensuring Correctness by Arbitrary Postfixed-Points.
484-492
A. O. Slisenko:
String-Matching in Real Time: Some Properties of the Data Structure.
493-496
Esko Ukkonen:
Tranformations to Produce Certain Covering Grammars.
516-525
Rüdiger Valk:
On the Computational Power of Extended Petri Nets.
526-535
Jorma Rissanen:
Theory of Relations for Databases - A Tutorial Survey.
536-551
data released under the ODC-BY 1.0 license
