Mathematical foundations of computer science 2004 : 29th international symposium ; proceedings

Konferenzschrift | Kongress

This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Repulic in August 2004. The 60 revised full papers presented together with full papers of abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complecity, automata, parameterized and kolmogrov complecity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• ISBN: 9783540228233 ; 3540228233
• Dimensions: 24 cm
• Extent: XIV, 902 S.
• Language: Englisch
• Notes: graph. Darst. ; Literaturangaben

References and Relationships

• Bibliographic citation: Lecture notes in computer science ; Vol. 3153

Classification and Topics

• Classification: Informatik ; Mathematik
• Keyword: Theoretische Informatik

Contributors, Places and Time

• Event: Veröffentlichung
• (where): Berlin, Heidelberg, New York
• (who): Springer
• (when): 2004
• Contributor: Fiala, Jiří ; MFCS (29 : 2004 : Prag)

Further information

• Table of contents: https://d-nb.info/97187123X/04
• Rights: Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
• Last update: 11.03.2025, 11:49 AM CET