IMYCS 1988: Smolenice, Czechoslovakia

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

• Zoltán Ésik:
  An Extension of the Krohn-Rhodes Decomposition of Automata. 66-71
  
• Katsushi Inoue, Itsuo Takanami:
  A Survey of Two-Dimensional Automata Theory. 72-91
  
• Akira Ito, Katsushi Inoue, Itsuo Takanami:
  The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. 92-101
  
• Anna Slobodová:
  Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States. 102-113
  

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
  

Last update Sat May 18 19:00:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page