Mathematical Foundations of Computer Science 2004. 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings.

Hutchison, David:

ISBN 10: 3540228233 / ISBN 13: 9783540228233

Published by Berlin/Heidelberg, Springer Berlin Heidelberg, 2004

About this Item

915 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7791 9783540228233 Sprache: Englisch Gewicht in Gramm: 900.

Seller Inventory # 2347489

Bibliographic Details

• Title: Mathematical Foundations of Computer Science 2004. 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings.
• Publisher: Berlin/Heidelberg, Springer Berlin Heidelberg
• Publication Date: 2004
• Language: English
• ISBN 10: 3540228233
• ISBN 13: 9783540228233
• Binding: Soft cover
• Edition: 1st ed.
• Seller catalogs:
  • AA Varia

About this title

Synopsis

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.

Synopsis

This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004. The 60 revised full papers presented together with full papers or 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 complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.