Adventures Between Lower Bounds And Higher Altitudes

This Festschrift volume is published in honor of Juraj Hromkovič on the occasion of his 60th birthday. Juraj Hromkovič is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education. The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovič’s research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.

Computational thinking is a lifelong skill important for succeeding in careers and life. Students especially need to acquire this skill while in school as it can assist with solving a number of complex problems that arise later in life. Therefore, the importance of teaching computational thinking and coding in early education is paramount for fostering problem-solving and creativity. Teaching Computational Thinking and Coding to Young Children discusses the importance of teaching computational thinking and coding in early education. The book focuses on interdisciplinary connections between computational thinking and other areas of study, assessment methods for computational thinking, and different contexts in which computational thinking plays out. Covering topics such as programming, computational thinking assessment, computational expression, and coding, this book is essential for elementary and middle school teachers, early childhood educators, administrators, instructional designers, curricula developers, educational software developers, researchers, educators, academicians, and students in computer science, education, computational thinking, and early childhood education.

This book constitutes the refereed proceedings of the workshops which complemented the 23rd Symposium on Formal Methods, FM 2019, held in Porto, Portugal, in October 2019. This volume presents the papers that have been accepted for the following workshops: Third Workshop on Practical Formal Verification for Software Dependability, AFFORD 2019; 8th International Symposium From Data to Models and Back, DataMod 2019; First Formal Methods for Autonomous Systems Workshop, FMAS 2019; First Workshop on Formal Methods for Blockchains, FMBC 2019; 8th International Workshop on Formal Methods for Interactive Systems, FMIS 2019; First History of Formal Methods Workshop, HFM 2019; 8th International Workshop on Numerical and Symbolic Abstract Domains, NSAD 2019; 9th International Workshop on Open Community Approaches to Education, Research and Technology, OpenCERT 2019; 17th Overture Workshop, Overture 2019; 19th Refinement Workshop, Refine 2019; First International Workshop on Reversibility in Programming, Languages, and Automata, RPLA 2019; 10th International Workshop on Static Analysis and Systems Biology, SASB 2019; and the 10th Workshop on Tools for Automatic Program Analysis, TAPAS 2019.

This book constitutes the proceedings of the 18th International Conference on Unconventional Computation and Natural Computation, UCNC 2019, held in Tokyo, Japan, in June 2019. The 19 full papers presented were carefully reviewed and selected from 32 submissions. The papers cover topics such as hypercomputation; chaos and dynamical systems based computing; granular, fuzzy and rough computing; mechanical computing; cellular, evolutionary, molecular, neural, and quantum computing; membrane computing; amorphous computing, swarm intelligence; artificial immune systems; physics of computation; chemical computation; evolving hardware; the computational nature of self-assembly, developmental processes, bacterial communication, and brain processes.

This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.

This book constitutes the refereed proceedings of the 25th International Computer Symposium on New Trends in Computer Technologies and Applications, ICS 2022, which took place in Taoyuan, Taiwan, in December 2022. ICS is one of the largest joint international IT symposia held in Taiwan. Founded in 1973, it is intended to provide a forum for researchers, educators, and professionals to exchange their discoveries and practices, and to explore future trends and applications in computer technologies. The biannual symposium offers a great opportunity to share research experiences and to discuss potential new trends in the IT industry. The 58 full papers and one invited paper presented in this volume were carefully reviewed and selected from 137 submissions. The papers have been organized in the following topical sections: Invited Paper; Algorithms, Bioinformatics, and Computation Theory; Cloud Computing and Big Data; Computer Vision and Image Processing; Cryptography and Information Security; Electronics and Information Technology; Mobile Computation and Wireless Communication; Ubiquitous Cybersecurity and Forensics.

This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen. Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.