Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (54 papers)
Keywords
About this book
The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.
Bibliographic Information
Book Title: Mathematical Foundations of Computer Science 1995
Book Subtitle: 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings
Editors: Jiří Wiedermann, Petr Hájek
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-60246-1
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1995
Softcover ISBN: 978-3-540-60246-0Published: 16 August 1995
eBook ISBN: 978-3-540-44768-9Published: 14 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 594
Topics: Theory of Computation, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Programming Languages, Compilers, Interpreters