This book is dedicated to Hermann Maurer on the occasion of his 70th birthday. The title word Rainbow reflects the beauty and variety of the achievements of this outstanding scientist, and also the diversity and depth of current research in computer science. The high admiration that Professor Maurer enjoys in the computer science community all over the world was witnessed by the enthusiastic response received to the request to contribute to this book. The contributors are leading researchers, also representing the diversity of computer science. The research areas included in the book range from Automata, Formal Languages and Computability to various aspects of the Practice of Computer Science, as well as from Algorithmics to Learning. The book consists of a brief Preface describing the achievements of Professor Maurer, followed by twenty articles roughly grouped together according to their topics. Most of the articles are written in a style understandable to a wider audience. The book is useful to anyone interested in recent developments in computer science.

This book constitutes the thoroughly refereed post-conference proceedings of the First IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, held in Tehran, Iran, in August 2015. The 10 full papers presented together with 3 invited talks were carefully reviewed and selected from 48 submissions. The papers feature novel and high-quality research in all areas of theoretical computer science.

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems, parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.

Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring, and rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number. Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject.

How do you crack nuts with a piece of string? Reverse gravity? Cobble together a clock out of a coffee cup, a soda bottle, and some water? Use a vacuum cleaner and nineteenth-century railroad technology to fashion a makeshift bazooka that can launch paper projectiles? Create a rainbow in a block of Jello? This is a one-volume romp through a whole array of counterintuitive science experiments that require little more than common household items and a sense of curiosity. Prepare to have your surprise sensors on overload as Neil Downie stretches math, physics, and chemistry to do what they have never done before. This book describes twenty-nine unusual but practical experiments, detailing how they are done and the math and physics behind them. It will delight both casual and inveterate tinkerers. Of varying levels of complexity, the experiments are grouped in sections covering a wide field of physics and the borders of chemistry, ranging from dynamic mechanics (''Kinetic Curiosities'') to electricity (''Antediluvian Electronics'') and combustion (''Infernal Inventions''). The chapters are titillatingly titled, from ''Twisted Sinews'' and ''Mole Radio'' to ''A Symphony of Siphons'' and ''Tornado Transistor.'' More-detailed explanations, along with simple mathematical models using high-school level math, are given in boxes accompanying each experiment. Armchair scientists will welcome this edifying and entertaining alternative to idleness, not least for the buoyant prose, enriched by historical and literary anecdotes introducing each topic. With this book in hand, tinkerers, whether dabblers in science or devotees, students or teachers, need never again wonder how to impress friends, the judges at the science fair, and, not least, themselves.