Ebook: Mathematical Foundations of Computer Science 2005: 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29–September 2, 2005. Proceedings
- Genre: Mathematics
- Tags: Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Discrete Mathematics in Computer Science, Data Structures, Logics and Meanings of Programs, Algorithms
- Series: Lecture Notes in Computer Science 3618 : Theoretical Computer Science and General Issues
- Year: 2005
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
This book constitutes the refereed proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005.
The 62 revised full papers presented together with full papers or abstracts of 7 invited talks were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from quantum computing, approximation, automata, circuits, scheduling, games, languages, discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.
This book constitutes the refereed proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005.
The 62 revised full papers presented together with full papers or abstracts of 7 invited talks were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from quantum computing, approximation, automata, circuits, scheduling, games, languages, discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.