Editors:
Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3153)
Conference series link(s): MFCS: International Symposium on Mathematical Foundations of Computer Science
Conference proceedings info: MFCS 2004.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (70 papers)
-
Front Matter
-
Invited Lectures
-
Graphs and Complexity
About this book
Keywords
- Automat
- XML
- algorithms
- automata
- complexity
- computer
- computer science
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic
Jiří Fiala, Jan Kratochvíl
-
Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Praha1, Czech Republic
Václav Koubek
Bibliographic Information
Book Title: Mathematical Foundations of Computer Science 2004
Book Subtitle: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings
Editors: Jiří Fiala, Václav Koubek, Jan Kratochvíl
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b99679
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2004
Softcover ISBN: 978-3-540-22823-3Published: 09 August 2004
eBook ISBN: 978-3-540-28629-5Published: 06 August 2004
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XXVIII, 904
Topics: Theory of Computation, Algorithms, Discrete Mathematics in Computer Science, Data Science, Computer Science Logic and Foundations of Programming