Understand Mathematics, Understand Computing. Discrete Mathematics That All Computing Students Should Know.. Questo articolo non è disponibile.Understand Mathematics, Understand Computing. Discrete Mathematics That All Computing Students Should Know.

In this book the authors aim to endow the reader with an operational, conceptual, and methodological understanding of the discrete mathematics that can be used to study, understand, and perform computing. They want the reader to understand the elements of computing, rather than just know them. The basic topics are presented in a way that encourages readers to develop their personal way of thinking about mathematics. Many topics are developed at several levels, in a single voice, with sample applications from within the world of computing. Extensive historical and cultural asides emphasize the human side of mathematics and mathematicians.<div><br></div><div>By means of lessons and exercises on&nbsp;“doing”&nbsp;mathematics, the book prepares interested readers to develop new concepts and invent new techniques and technologies that will enhance all aspects of computing. The book will be of value to students, scientists, and engineers engaged in the design and use of computing systems, and to scholars and practitioners beyond these technical fields who want to learn and apply novel computational ideas.</div>

<p>Prof.<b> Arnold Rosenberg</b>&nbsp;is a distinguished university professor emeritus at the University of Massachusetts, Amherst. He also held research positions at Northeastern University and Colorado State University, a professorship at Duke University, and a staff research position at IBM Watson Research Center. He was elected a fellow of the ACM in 1996 for his work on graph-theoretic models of compuation, emphasizing theoretical studies of parallel algorithms and&nbsp;architectures, VLSI design and layout, and data structures. In 1997, he was elected as a fellow of the IEEE for fundamental contributions to theoretical aspects of computer science and engineering.&nbsp;</p><p>Prof. <b>Denis Trystram</b> is a distinguished professor at the Grenoble Institute of Engineering, an honorary member of the Institut Universitaire de France (IUF), and he works at the Laboratoire d'Informatique de Grenoble&nbsp;(LIG)&nbsp;in the team-project DataMove-INRIA. His research interestst include the design and analysis of efficient algorithms for optimizing resource use in parallel and distributed systems, approximation algorithms for scheduling and packing problems, and algorithms for data analytics. Both authors have considerable teaching and practical experience in the application of discrete mathematics approaches to computing tasks.</p>