| Mathematical Foundations of Computer Science 1995: 20th International Symposium, Mfcs'95, Prague, Czech Republic, August 28 - September 1, 1995. Proce 1995 Edition Contributor(s): Wiedermann, Jiri (Editor), Hajek, Petr (Editor) |
|
 |
ISBN: 3540602461 ISBN-13: 9783540602460 Publisher: Springer OUR PRICE: $104.49 Product Type: Paperback - Other Formats Published: August 1995 Annotation: This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. 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. |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Computers | Software Development & Engineering - General - Computers | Logic Design |
| Dewey: 004.015 |
| LCCN: 95217384 |
| Series: Lecture Notes in Physics |
| Physical Information: 1.24" H x 6.14" W x 9.21" (1.87 lbs) 594 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. 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. |