This book constitutes the refereed proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2003, held in Mumbai, India in December 2003. The 23 revised full papers presented together with 4 invited papers and the abstract of an invited paper were carefully reviewed and selected from 160 submissions. A broad variety of current topics from the theory of computing are addressed, ranging from algorithmics and discrete mathematics to logics and programming theory.

This book constitutes the refereed proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2002, held in Kanpur, India in December 2002. The 26 revised full papers presented together with 5 invited contributions were carefully reviewed and selected from 108 submissions. A broad variety of topics from the theory of computing are addressed, from algorithmics and discrete mathematics as well as from logics and programming theory.

This book constitutes the refereed proceedings of the International Conference IFIP TCS 2000 held in Sendai, Japan in August 2000. The 32 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 70 submissions. The papers are organized in two tracks on algorithms, complexity, and models of computation and on logics, semantics, specification, and verification. The book is devoted to exploring new frontiers of theoretical informatics and addresses all current topics in theoretical computer science.

This book contains the invited and contributed papers selected for presentation at SOFSEM 2021, the 47th International Conference on Current Trends in Theory and Practice of Computer Science, which was held online during January 25–28, 2021, hosted by the Free University of Bozen-Bolzano, Italy. The 33 full and 7 short papers included in the volume were carefully reviewed and selected from 100 submissions. They were organized in topical sections on: foundations of computer science; foundations of software engineering; foundations of data science and engineering; and foundations of algorithmic computational biology. The book also contains 5 invited papers.

This volume contains papers selected for presentation at the 31st Annual C- ference on Current Trends in Theory and Practice of Informatics – SOFSEM 2005, held on January 22–28, 2005 in LiptovskyJ ́ an, ́ Slovakia. The series of SOFSEM conferences, organized alternately in the Czech - public and Slovakia since 1974, has a well-established tradition. The SOFSEM conferences were originally intended to break the Iron Curtain in scienti?c - change. After the velvet revolution SOFSEM changed to a regular broad-scope international conference. Nowadays, SOFSEM is focused each year on selected aspects of informatics. This year the conference was organized into four tracks, each of them complemented by two invited talks: – Foundations of Computer Science (Track Chair: Bernadette Charron-Bost) – Modeling and Searching Data in the Web-Era (Track Chair: Peter Vojt ́ a? s) – Software Engineering (Track Chair: M ́ aria Bielikova) ́ – Graph Drawing (Track Chair: Ondrej Syk ́ ora) The aim of SOFSEM 2005 was, as always, to promote cooperation among professionalsfromacademiaandindustryworkinginvariousareasofinformatics. Each track was complemented by two invited talks. The SOFSEM 2005 Program Committee members coming from 13 countries evaluated 144 submissions (128 contributed papers and 16 student research - rum papers). After a careful review process (counting at least 3 reviews per paper), followed by detailed discussions in the PC, and a co-chairs meeting held on October 8, 2005 in Bratislava, Slovakia, 44 papers (overall acceptance rate 34.

This book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models.

Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Contents Tutorial • Applications • Further Reading

This book constitutes the refereed proceedings of the 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012. The 43 revised papers presented in this volume were carefully reviewed and selected from 121 submissions. The book also contains 11 invited talks, 10 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; cryptography, security, and verification; and artificial intelligence.

This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018. The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.