ENGLISH

Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Toru´n, Poland, August 25-29, 2008. Proceedings

By Andreas Blass , Yuri Gurevich (auth.) , Edward Ochmański , Jerzy Tyszkiewicz (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2008
ISBN
3540852379, 9783540852377
DOI
10.1007/978-3-540-85238-4
Language
english
Format
PDF
Filesize
7 MB (7117771 bytes)
Series
Lecture Notes in Computer Science 5162
Edition
1
Pages
626\637
Library
Kolxo3
Time added
2010-02-05 01:51:52
Algorithm Analysis and Problem Complexity; Computa

Description

This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.

Similar books