IMYCS 1990: Smolenice, Czechoslovakia

Tutorial

• Karel Culik II, Simant Dube:
  Methods for Generating Deterministic Fractals and Image Compression. 2-28
  

Invited Lectures

• Bin Cong, Zevi Miller, Ivan Hal Sudborough:
  Optimum Simulation of Meshes by Small Hypercubes. 30-46
  
• Yves Kodratoff:
  Seven Hard Problems in Symbolic Background Knowledge Acquisition. 47-61
  
• Christophe Reutenauer:
  Subsequential Functions: Characterizations, Minimization, Examples. 62-79
  
• Ildikó Sain:
  Past Proves More Invariance Properties but not PCA's. 80-92
  
• Juraj Wiedermann:
  Complexity Issues in Discrete Neurocomputing. 93-108
  

Communications

• Marcella Anselmo:
  Two-Way Reading on Words. 110-119
  
• Jean-Luc Coquidé, Rémi Gilleron:
  Proofs and Reachablity Problem for Ground Rewrite Systems. 120-129
  
• Carsten Damm:
  Problems Complete for +L. 130-137
  
• Marta Franová:
  Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving. 138-147
  
• Andreas Goerdt, Helmut Seidl:
  Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. 148-158
  
• Dominik Gomm, Rolf Walter:
  The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets. 159-168
  
• Martin Loebl:
  Greedy Compression Systems. 169-176
  
• Michael Mñuk:
  A Div(n) Depth Boolean Circuit for Smooth Modular Inverse. 177-183
  
• Martin Fodslette Møller:
  Learning by Conjugate Gradients. 184-194
  
• Maryse Pelletier:
  Monoids Described by Pushdown Automata. 195-203
  
• Peter Rajcáni:
  Optimal Parallel 3-Colouring Algorithm for Rooted Trees and Its Application. 204-213
  
• Klaus Reinhardt:
  Hierarchies over the Context-Free Languages. 214-224
  
• Lila Santean:
  A Hierarchy of Unary Primitive Recursive String-Functions. 225-233
  
• Patrice Séébold, Karine Slowinski:
  Minimizing Picture Words. 234-243
  
• Peter Skodný:
  Remarks on the Frequency-Coded Neural Nets Complexity. 244-250
  
• Ralf Stiebe:
  Picture Generation Using Matrix Systems. 251-260
  
• Christian B. Suttner:
  Representing Heuristic-Relevant Information for an Automated Theorem Prover. 261-270
  
• Kristel Unger:
  A New Method for Proving Lower Bounds in the Model of Algebraic Decision Trees. 271-277
  
• Juraj Waczulík:
  Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection. 278-287
  
• Igor Walukiewicz:
  Decision Procedure for Checking Validity of PAL Formulas. 288-298
  

Last update Fri May 25 08:22:46 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page