Mathematical Foundations of Computer Science 2015

40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I

Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella (Herausgeber)

Buch | Softcover

XXVI, 459 Seiten

2015 | 1st ed. 2015
Springer Berlin (Verlag)
978-3-662-48056-4 (ISBN)

Infos

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).

Produkt-Details

• Erscheint lt. Verlag: 20.8.2015
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Zusatzinfo: XXVI, 459 p. 51 illus.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
• Schlagworte: algebra and categories in computer science • Algorithm analysis and problem complexity • algorithmic game theory • Algorithmic Learning Theory • algorithms and data structures • Applications • approximation algorithms • automata-computational complexity • Computer Science • Concurrency Theory • conference proceedings • cryptography and security • databases and knowledge-based systems • Distributed Computing • Formal Specifications • Foundations of Computing • grammars and formal languages • Informatics • Lambda-Calculus • Linear Programming • logic-networks • Parallel Computing • Program Development • Quantum Computing • Research • semantics and verification of programs
• ISBN-10: 3-662-48056-5 / 3662480565
• ISBN-13: 978-3-662-48056-4 / 9783662480564
• Zustand: Neuware