You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003, held in Bratislava, Slovakia in August 2003. The 55 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.
This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties. These foundations are built on a solid mathematical basis, using elements of universal algebra, category theory and logic, and this mathematical toolbox provides a convenient language for precisely formulating the concepts involved in software specification and development. Once formally defined, these notions become subject to mathematical investigation, and this interplay between mathematics and software engineering yields results that are mathematically intere...
This volume contains the proceedings of the 14th International Colloquium on Automata Languages and Programming, organized by the European Association for Theoretical Computer Science (EATCS) and held in Karlsruhe, July 13-17, 1987. The papers report on original research in theoretical computer science and cover topics such as algorithms and data structures, automata and formal languages, computability and complexity theory, semantics of programming languages, program specification, transformation and verification, theory of data bases, logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, cryptography, and theory of robotics. The authors are young scientists and leading experts in these areas.
The papers in this volume were presented at the Eleventh Annual International Computing and Combinatorics Conference (COCOON 2005), held August 16–19, 2005, in Kunming, China.
The 28th International Workshop on Graph-Theoretic Concepts in Computer ? Science (WG 2002) was held in Cesky ́ Krumlov, a beautiful small town in the southern part of the Czech Republic on the river Vltava (Moldau), June 13–15, 2002. The workshop was organized by the Department of Applied Mathematics of the Faculty of Mathematics and Physics of Charles University in Prague. Since 1975, WG has taken place in Germany 20 times, twice in Austria and The Netherlands, and once in Italy, Slovakia, and Switzerland. As in previous years, the workshop aimed at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extrac...
This book constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and structural complexity, automata and formal languages, and logic in computer science.
The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop took place June 19–21, 2003. The 72 participants of WG 2003 came from universities and research institutes from 18 di?erent countries and ?ve di?erent continents. The workshop looks back at a long tradition. It was ?rst held in 1975, and has been held 20 times in Germany, twice in Austria, and once in Italy, Slo- kia, Switzerland, and the Czech Republic, and has now been held for the third time in ...
This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.
None