Bücher von Arnold L. Rosenberg

Computation theory is a discipline that uses mathematical concepts and tools to expose the nature of "e;computation"e; and to explain a broad range of computational phenomena: Why is it harder to perform some computations than others?  Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations?  How does one reason about such questions?This unique textbook strives to endow students with conceptual and manipulative tools necessary to make computation theory part of their professional lives. The work achieves this goal by means of three stratagems that set its approach apart from most other texts on the subject.For starters, it develops the necessary mathematical concepts and tools from the concepts' simplest instances, thereby helping students gain operational control over the required mathematics. Secondly, it organizes development of theory around four "e;pillars,"e; enabling students to see computational topics that have the same intellectual origins in physical proximity to one another. Finally, the text illustrates the "e;big ideas"e; that computation theory is built upon with applications of these ideas within "e;practical"e; domains in mathematics, computer science, computer engineering, and even further afield.Suitable for advanced undergraduate students and beginning graduates, this textbook augments the "e;classical"e; models that traditionally support courses on computation theory with novel models inspired by "e;real, modern"e; computational topics,such as  crowd-sourced computing, mobile computing, robotic path planning, and volunteer computing.Arnold L. Rosenberg is Distinguished Univ. Professor Emeritus at University of Massachusetts, Amherst, USA. Lenwood S. Heath is Professor at Virgina Tech, Blacksburg, USA.            

Research in the field of parallel computer architectures andparallel algorithms has been very successful in recentyears, and further progress isto be expected. On the otherhand, the question of basic principles of the architectureof universal parallel computers and their realizations isstill wide open. The answer to this question must beregarded as mostimportant for the further development ofparallel computing and especially for user acceptance.The First Heinz Nixdorf Symposium brought together leadingexperts in the field of parallel computing and itsapplications to discuss the state of the art, promisingdirections of research, and future perspectives. It was thefirst in a series of Heinz Nixdorf Symposia,intended tocover varying subjects from the research spectrum of theHeinz Nixdorf Institute of the University of Paderborn.This volume presents the proceedings of the symposium, whichwas held in Paderborn in November1992. The contributionsare grouped into four parts: parallel computation models andsimulations, existing parallel machines, communication andprogramming paradigms, and parallel algorithms.

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.

Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms.

Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms.