IMYCS 1988:
Smolenice,
Czechoslovakia
Jürgen Dassow, Jozef Kelemen (Eds.):
Machines, Languages, and Complexity, 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988, Proceedings.
Lecture Notes in Computer Science 381 Springer 1989, ISBN 3-540-51516-X
Languages
- Friedhelm Hinz:
Questions of Decidability for Context-free Chain Code Picture Languages.
2-11
- Galina Jirásková:
Chomsky Hierarchy and Communication Complexity.
12-18
- Klaus-Jörn Lange:
Complexity Theory and Formal Languages.
19-36
- Michel Latteux:
Rational Cones and Commutations.
37-54
- Bernd Reichel:
A Remark on Some Classifications of Indian Parallel Languages.
55-65
Machines
Algorithmics
- Daniele Cortolezzis:
The Virtual Floating Grid File.
116-127
- Carlo Gaibisso:
A Partially Persistent Data Structure for the Set-Union Problem with Backtracking.
128-135
- Mirko Krivánek:
A Note on the Computational Complexity of Bracketing and Related Problems.
136-145
- Martin Loebl, Jaroslav Nesetril:
Postorder Hierarchy for Path Compressions and Set Union.
146-151
- Kristel Unger:
The Convex Hull Problem on Grides - Computational and Combinatorial Aspects.
152-160
- Derick Wood:
The Riches of Rectangles.
161-168
Artificial Intelligence
- Frank van Harmelen:
The Limitations of Partial Evaluation.
170-187
- Klaus P. Jantke:
Algorithmic Learning from Incomplete Information - Principles and Problems.
188-207
Cryptography
- Jarkko Kari:
A Cryptosystem Based on Propositional Logic.
210-219
- Arto Salomaa:
Cryptography and Data Security.
220-244
Copyright © Sun Nov 15 04:48:09 2009
by Michael Ley (ley@uni-trier.de)