The 2006 Abel symposium is focusing on contemporary research involving interaction between computer science, computational science and mathematics. In recent years, computation has been affecting pure mathematics in fundamental ways. Conversely, ideas and methods of pure mathematics are becoming increasingly important within computational and applied mathematics. At the core of computer science is the study of computability and complexity for discrete mathematical structures. Studying the foundations of computational mathematics raises similar questions concerning continuous mathematical structures. There are several reasons for these developments. The exponential growth of computing power is bringing computational methods into ever new application areas.

The nature of the physical Universe has been increasingly better understood in recent years, and cosmological concepts have undergone a rapid evolution (see, e.g., [11], [2],or [5]).

Almost all physical phenomena can be mathematically described in terms of differential equations. The finite element method is a tool for the appro- mate solution of differential equations. However, despite the extensive use of the finite element method by engineers in the industry, understanding the principles involved in its formulation is often lacking in the common user. As an approximation process, the finite ele~ent method can be for- lated with the general technique of weighted residuals. This technique has the advantage of enhancing the essential unity of all processes of approxi- tion used in the solution of differential equations, such as finite differences, finite elements and boundary elements. The mathematics used in this text, though reasonably rigorous, is easily understood by the user with only a basic knowledge of Calculus. A common problem to the courses of Engineering is to decide about the best form to incorporate the use of computers in education. Traditional c- pilers, and even integrated programming environments such as Turbo Pascal, are not the most appropriate, since the student has to invest much time in developing an executable program that, in the best of cases, will be able to solve only one definitive type of problems. Moreover, the student ends up learning more about programming than about the problem that he/she wants to solve with the developed executable program.

This book gathers papers presented at the Workshop on Computational Diffusion MRI, CDMRI 2020, held under the auspices of the International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI), which took place virtually on October 8th, 2020, having originally been planned to take place in Lima, Peru.

The primary reason for producing this book is to demonstrate and commu­ nicate the pervasive nature of Discrete Optimisation. It has applications across a very wide range of activities. Many of the applications are only known to specialists. Our aim is to rectify this. It has long been recognized that ''modelling" is as important, if not more important, a mathematical activity as designing algorithms for solving these discrete optimisation problems. Nevertheless solving the resultant models is also often far from straightforward. Although in recent years it has become viable to solve many large scale discrete optimisation problems some problems remain a challenge, even as advances in mathematical methods, hardware and software technology are constantly pushing the frontiers forward. The subject brings together diverse areas of academic activity as well as di­ verse areas of applications. To date the driving force has been Operational Re­ search and Integer Programming as the major extention of the well-developed subject of Linear Programming. However, the subject also brings results in Computer Science, Graph Theory, Logic and Combinatorics, all of which are reflected in this book. We have divided the chapters in this book into two parts, one dealing with general methods in the modelling of discrete optimisation problems and one with specific applications. The first chapter of this volume, written by Paul Williams, can be regarded as a basic introduction of how to model discrete optimisation problems as Mixed Integer Programmes, and outlines the main methods of solving them.

This book gathers papers presented at the Workshop on Computational Diffusion MRI, CDMRI 2020, held under the auspices of the International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI), which took place virtually on October 8th, 2020, having originally been planned to take place in Lima, Peru.

This book gathers papers presented at the Workshop on Computational Diffusion MRI, CDMRI 2020, held under the auspices of the International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI), which took place virtually on October 8th, 2020, having originally been planned to take place in Lima, Peru.

The focus of these conference proceedings is on research, development, and applications in the fields of numerical geometry, scientific computing and numerical simulation, particularly in mesh generation and related problems. In addition, this year’s special focus is on Delaunay triangulations and their applications, celebrating the 130th birthday of Boris Delaunay.

You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas­ cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to the art of designing and breaking encryption schemes (or "secrecy codes"), Modern Cryptography is concerned with the rigorous analysis of any system which should withstand malicious attempts to abuse it. We emphasize two aspects of the transition from classical to modern cryptography: ( 1) the wide­ ning of scope from one specific task to an utmost wide general class of tasks; and (2) the move from an engineering-art which strives on ad-hoc tricks to a scientific discipline based on rigorous approaches and techniques.

Facilitate coding in generating geometric motives with a special focus on analyzing their geometric formulations. This book aims to teach analytical coding skills by combining arts and mathematics.

The two volume set CCIS 2032 and 2033 constitutes the proceedings of the 11th Congress on Simulation for a Sustainable Future, EUROSIM 2023, which was held in Amsterdam, The Netherlands, during July 3–5, 2023.

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.

This Festschrift volume contains the proceedings of the conference Mathematical Methods in Computer Science, MMICS 2008, which was held during December 17-19, 2008, in Karlsruhe, Germany, in memory of Thomas Beth. The themes of the conference reflected the many interests of Thomas Beth. Although, these interests might seem diverse, mathematical methods and especially algebra as a language constituted the common denominator of all of his scientific achievements.

This book constitutes the refereed post proceedings of the 18th International Conference on Advances in Computer Games, ACG 2023, held online, during November 28–30, 2023. The 14 full papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Chess and its Variants, Solving Games, Board Games, Card Games, Player Investigation, Math, Games, and Puzzles.

Practical Asymptotics is an effective tool for reducing the complexity of large-scale applied-mathematical models arising in engineering, physics, chemistry, and industry, without compromising their accuracy. It exploits the full potential of the dimensionless representation of these models by considering the special nature of the characteristic dimensionless quantities. It can be argued that these dimensionless quantities mostly assume extreme values, particularly for practical parameter settings. Thus, otherwise complicated models can be rendered far less complex and the numerical effort to solve them is greatly reduced.