60. Birthday: Wilfried Brauer, 1997

@proceedings{DBLP:conf/birthday/1997brauer,
  editor    = {Christian Freksa and
               Matthias Jantzen and
               R{\"u}diger Valk},
  title     = {Foundations of Computer Science: Potential - Theory - Cognition,
               to Wilfried Brauer on the occasion of his sixtieth birthday},
  booktitle = {Foundations of Computer Science: Potential - Theory - Cognition},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1337},
  year      = {1997},
  isbn      = {3-540-63746-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Computer Science and Its Potential

• Friedrich L. Bauer:
  The Might of Formulas and Their Limits. 1-8
  
• Heinz Zemanek:
  Hardware - Software: An Equivalence and a Contradiction. 9-19
  
• Wolfgang Coy:
  Defining Discipline. 21-35
  

Social Implications of Computer Science

• Dirk Siefkes:
  Computer Science as Cultural Development: Toward a Broader Theory. 37-47
  
• Jozef Gruska, Roland Vollmar:
  Towards Adjusting Informatics Education to Information Era. 49-67
  
• Herbert Klaeren, Christiane Floyd, Friedrich Diestelmeier:
  Informatics and Society: A Curriculum for Distance Education. 69-78
  

Theory of Formal Languages and Automata

• Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa:
  Syntactic and Semantic Aspects of Parallelism. 79-105
  
• Ingbert Kupka:
  Unique Fixpoints in Complete Lattices with Applications to Formal Languages and Semantics. 107-115
  
• Georg Karner, Werner Kuich:
  On Abstract Families of Languages, Power Series, and Elements. 117-124
  
• Klaus-Jörn Lange:
  Are There Formal Languages Complete for SymSPACE(log n)? 125-134
  
• Matthias Jantzen:
  On Twist-Closed Trios: A New Morphic Characterization of r.e. Sets. 135-142
  
• Javier Esparza, Peter Rossmanith:
  An Automata Approach to Some Problems on Context-Free Grammars. 143-152
  

Structures and Complexity Theory

• Karel Culik II, Jarkko Kari:
  On Aperiodic Sets of Wang Tiles. 153-162
  
• Birgit Jenner:
  Closure under Complementation of Logspace Complexity Classes - A Survey. 163-175
  
• Bernd Kirsig:
  A Relation Between Sparse and Printable Sets in NSPACE(log n). 177-184
  
• Klaus Weihrauch:
  A Foundation for Computable Analysis. 185-199
  
• Jürgen Schmidhuber:
  A Computer Scientist's View of Life, the Universe, and Everything. 201-208
  
• Manfred Kudlek:
  Calendars and Chronologies. 209-217
  

Petri Nets

• Hartmut Ehrig, Julia Padberg:
  A Uniform Approach to Petri Nets. 219-231
  
• Astrid Kiehn:
  Observing Partial Order Runs of Petri Nets. 233-238
  
• José Meseguer, Ugo Montanari, Vladimiro Sassone:
  Representation Theorems for Petri Nets. 239-249
  
• Volker Diekert:
  A Remark on Trace Equations. 251-260
  
• Ekkart Kindler, Wolfgang Reisig:
  Verification of Distributed Algorithms with Algebraic Petri Nets. 261-270
  
• Walter Vogler:
  A Short STory on Action Refinement. 271-278
  

Systems Analysis and Distributed Systems

• Manfred Broy:
  Interactive and Reactive Systems: States, Observations, Experiments, Input, Output, Nondeterminism, Compositionality and all That. 279-286
  
• Hans Daduna:
  Discrete Time Analysis of a State Dependent Tandem with Different Customer Types. 287-296
  
• Jörg Desel:
  How Distributed Algorithms Play the Token Game. 297-306
  
• Rolf Walter:
  The Asynchronous Stack Revisited: Rounds Sets the Twilight Reeling. 307-312
  
• Burkhard Monien, Petra Berenbrink, Reinhard Lüling, Marco Riedel:
  Online Scheduling of Continuous Media Streams. 313-320
  

Software Engineering and Verification

• Hans Langmaack:
  Contribution to Goodenough's and Gerhart's Theory of Software Testing and Verification: Relation between Strong Compiler Test and Compiler Implementation Verification. 321-335
  
• Günter Hotz, Hongzhong Wu:
  On the Arrangement Complexity of Uniform Trees. 337-350
  
• Harold Boley:
  A Relational-Functional Integration for Declarative Programming. 351-358
  

Cognition and Artificial Intelligence

• Siegfried Kanngießer:
  Inside and Outside the Chinese Room. 359-368
  
• Christopher Habel, Carola Eschenbach:
  Abstract Structures in Spatial Cognition. 369-378
  
• Christian Freksa:
  Spatial and Temporal Structures in Cognitive Processes. 379-387
  

Knowledge Representation and Reasoning

• Daniel Hernández:
  Qualitative vs. Fuzzy Represenations of Spatial Distance. 389-398
  
• Simone Pribbenow:
  What's a Part? On Formalizing Part-Whole Relations. 399-406
  
• Claus-Rainer Rollinger:
  SPOCK: A Feasibility Study on the Completeness of Part Lists. 407-415
  
• Kerstin Schill:
  Decision Support Systems with Adaptive Reasoning Strategies. 417-427
  

Machine Learning

• Katharina Morik:
  Knowledge Discovery in databases - An Inductive Logic Programming Approach. 429-436
  
• Kurt Ammon:
  The Composition Heuristic. 437-444
  
• Gerhard Weiß:
  The Job Assignment Problem: A Study in Parallel and Distributed Machine Learning. 445-454
  
• Mohamed Salah Hamdi, Karl Kaiser:
  Self-Improving Behavior Arbitration. 455-464
  

Neural Networks and Robotics

• Margit Sturm:
  Neural Networks for Manipulator Path Planning. 465-472
  
• Martin Eldracher, Thomas Pic:
  Path Planning Using a Subgoal Graph. 473-480
  
• Christian Schittenkopf, Gustavo Deco:
  A Nonlinear Markovian Characterization of Time Series Using Neural Networks. 481-488
  

Language and Information Systems

• Gabriele Scheler:
  Feature-Based Perception of Semantic Concepts. 489-497
  
• Gerda Ruge:
  Automatic Detection of Thesaurus relations for Information Retrieval Applications. 499-506
  
• Leo Pfefferer, Dieter Schütt:
  InfoShere^TM-V: A New Approach to 3D-Visualization of Information. 507-514