This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully revi…
This book provides a self-contained undergraduate course on quantum computing based on classroom-tested lecture notes. It reviews the fundamentals of quantum mechanics from the double-slit experiment to entanglement, before progressing to the basics of qubits, quantum gates, qua…
Artificial intelligence (AI) has become pervasive in most areas of research and applications. While computation can significantly reduce mental efforts for complex problem solving, effective computer algorithms allow continuous improvement of AI tools to handle complexity-in bot…
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The work describes and analyses some of the best-known algorithms for colouring graphs, focusing on: whether these heuristics can provide optimal solutions in…
This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021. The 37 full papers presented in this volume were carefully reviewed and selected from 73…
This book offers a new Modular Petri Net as a solution to the vast Petri net models. It presents some approaches centering around modules (known as "Petri modules"). The goal of this book is to introduce a methodology in which Petri nets are moved to a new level. In this new lev…
This textbook is intended for practical, laboratory sessions associated with the course of quantum computing and quantum algorithms, as well as for self-study. It contains basic theoretical concepts and methods for solving basic types of problems and gives an overview of basic q…
This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Pract…
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 - April 1, 2021, as part of the European Joint Conferences on Theory …
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 - April 1, 2021, as part of the European Joint Conferences on Theory …
This book presents the latest trends and developments in multimodal optimization and niching techniques. Most existing optimization methods are designed for locating a single global solution. However, in real-world settings, many problems are "multimodal" by nature, i.e., multip…
This open access book constitutes the proceedings of the 24th International Conference on Fundamental Approaches to Software Engineering, FASE 2021, which took place during March 27-April 1, 2021, and was held as part of the Joint Conferences on Theory and Practice of Software, …
This stimulating textbook/reference presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging furt…
The two-volume set LNAI 12854 and 12855 constitutes the refereed proceedings of the 20th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2021, held in Zakopane, Poland, in June 2021. Due to COVID 19, the conference was held virtually. The 89 full p…
by Burgin, Mark, (Mark Semenovič)
fromMonographs in Computer Science
New discoveries about algorithms are leading scientists beyond the Church-Turing Thesis, which governs the "algorithmic universe" and asserts the conventionality of recursive algorithms. A new paradigm for computation, the super-recursive algorithm, offers promising prospects fo…
This book constitutes the proceedings of the 13th International Symposium on NASA Formal Methods, NFM 2021, held virtually in May 2021. The 21 full and 3 short papers presented in this volume were carefully reviewed and selected from 66 submissions. The papers aim to identify ch…
