Proceedings of an International Conference held in Vancouver, B.C., August 1993, to commemorate the 50th anniversary of the founding of the journal Mathematics of Computation. It consisted of a Symposium on Numerical Analysis and a Minisymposium of Computational Number Theory. This proceedings contains 14 invited papers, including two not presented at the conference--an historical essay on integer factorization, and a paper on componentwise perturbation bounds in linear algebra. The invited papers present surveys on the various subdisciplines covered by Mathematics of Computation, in a historical perspective and in a language accessible to a wide audience. The 46 contributed papers address contemporary specialized work. Annotation copyright by Book News, Inc., Portland, OR

This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, July 2006. The book presents 37 revised full papers together with 4 invited papers selected for inclusion. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.

Symbolic dynamics originated as a tool for analyzing dynamical systems and flows by discretizing space as well as time. The development of information theory gave impetus to the study of symbol sequences as objects in their own right. Today, symbolic dynamics has expanded to encompass multi-dimensional arrays of symbols and has found diverse applications both within and beyond mathematics. This volume is based on the AMS Short Course on Symbolic Dynamics and its Applications. It contains introductory articles on the fundamental ideas of the field and on some of its applications. Topics include the use of symbolic dynamics techniques in coding theory and in complex dynamics, the relation between the theory of multi-dimensional systems and the dynamics of tilings, and strong shift equivalence theory. Contributors to the volume are experts in the field and are clear expositors. The book is suitable for graduate students and research mathematicians interested in symbolic dynamics and its applications.

Since their emergence in 1917, tomography and inverse problems remain active and important fields that combine pure and applied mathematics and provide strong interplay between diverse mathematical problems and applications. The applied side is best known for medical and scientific use, in particular, medical imaging, radiotherapy, and industrial non-destructive testing. Doctors use tomography to see the internal structure of the body or to find functional information, such asmetabolic processes, noninvasively. Scientists discover defects in objects, the topography of the ocean floor, and geological information using X-rays, geophysical measurements, sonar, or other data. This volume, based on the lectures in the Short Course The Radon Transform and Applications to InverseProblems at the American Mathematical Society meeting in Atlanta, GA, January 3-4, 2005, brings together articles on mathematical aspects of tomography and related inverse problems. The articles cover introductory material, theoretical problems, and practical issues in 3-D tomography, impedance imaging, local tomography, wavelet methods, regularization and approximate inverse, sampling, and emission tomography. All contributions are written for a general audience, and the authors have includedreferences for further reading.

The Mandelbrot set has emerged as one of the most recognizable objects in mathematics. While there is no question of its beauty, relatively few people appreciate the fact that the mathematics behind such images is equally beautiful. This book presents lectures delivered during the AMS Short Course entitled Complex Dynamical Systems: The Mathematics Behind the Mandelbrot and Julia Sets, held at the Joint Mathematics Meetings in Cincinnati in January 1994. The lectures cover a wide range of topics, including the classical work of Julia and Fatou on local dynamics of analytic maps as well as recent work on the dynamics of quadratic and cubic polynomials, the geometry of Julia sets, and the structure of various parameter spaces. Among the other topics are recent results on Yoccoz puzzles and tableaux, limiting dynamics near parabolic points, the spider algorithm, extensions of the theory to rational maps, Newton's method, and entire transcendental functions. Much of the book is accessible to anyone with a background in the basics of dynamical systems and complex analysis.

What is the shape of data? How do we describe flows? Can we count by integrating? How do we plan with uncertainty? What is the most compact representation? These questions, while unrelated, become similar when recast into a computational setting. Our input is a set of finite, discrete, noisy samples that describes an abstract space. Our goal is to compute qualitative features of the unknown space. It turns out that topology is sufficiently tolerant to provide us with robust tools. This volume is based on lectures delivered at the 2011 AMS Short Course on Computational Topology, held January 4-5, 2011 in New Orleans, Louisiana. The aim of the volume is to provide a broad introduction to recent techniques from applied and computational topology. Afra Zomorodian focuses on topological data analysis via efficient construction of combinatorial structures and recent theories of persistence. Marian Mrozek analyzes asymptotic behavior of dynamical systems via efficient computation of cubical homology. Justin Curry, Robert Ghrist, and Michael Robinson present Euler Calculus, an integral calculus based on the Euler characteristic, and apply it to sensor and network data aggregation. Michael Erdmann explores the relationship of topology, planning, and probability with the strategy complex. Jeff Erickson surveys algorithms and hardness results for topological optimization problems.

This book constitutes the refereed proceedings of the 13th International Conference on High-Performance Computing, HiPC 2006, held in Bangalore, India, December 2006. Coverage in this volume includes scheduling and load balancing, network and distributed algorithms, application software, network services, ad-hoc networks, systems software, sensor networks and performance evaluation, as well as routing and data management algorithms.

In the mid-1970s, Whitfield Diffie and Martin Hellman invented public key cryptography, an innovation that ultimately changed the world. Today public key cryptography provides the primary basis for secure communication over the internet, enabling online work, socializing, shopping, government services, and much more. While other books have documented the development of public key cryptography, this is the first to provide a comprehensive insiders’ perspective on the full impacts of public key cryptography, including six original chapters by nine distinguished scholars. The book begins with an original joint biography of the lives and careers of Diffie and Hellman, highlighting parallels and intersections, and contextualizing their work. Subsequent chapters show how public key cryptography helped establish an open cryptography community and made lasting impacts on computer and network security, theoretical computer science, mathematics, public policy, and society. The volume includes particularly influential articles by Diffie and Hellman, as well as newly transcribed interviews and Turing Award Lectures by both Diffie and Hellman. The contributed chapters provide new insights that are accessible to a wide range of readers, from computer science students and computer security professionals, to historians of technology and members of the general public. The chapters can be readily integrated into undergraduate and graduate courses on a range of topics, including computer security, theoretical computer science and mathematics, the history of computing, and science and technology policy.

This book introduces readers to key ideas and applications of computational algebraic geometry. Beginning with the discovery of Gröbner bases and fueled by the advent of modern computers and the rediscovery of resultants, computational algebraic geometry has grown rapidly in importance. The fact that "crunching equations" is now as easy as "crunching numbers" has had a profound impact in recent years. At the same time, the mathematics used in computational algebraic geometry is unusually elegant and accessible, which makes the subject easy to learn and easy to apply. This book begins with an introduction to Gröbner bases and resultants, then discusses some of the more recent methods for solving systems of polynomial equations. A sampler of possible applications follows, including computer-aided geometric design, complex information systems, integer programming, and algebraic coding theory. The lectures in this book assume no previous acquaintance with the material.

A fascinating journey into the mind-bending world of prime numbers Cicadas of the genus Magicicada appear once every 7, 13, or 17 years. Is it just a coincidence that these are all prime numbers? How do twin primes differ from cousin primes, and what on earth (or in the mind of a mathematician) could be sexy about prime numbers? What did Albert Wilansky find so fascinating about his brother-in-law's phone number? Mathematicians have been asking questions about prime numbers for more than twenty-five centuries, and every answer seems to generate a new rash of questions. In Prime Numbers: The Most Mysterious Figures in Math, you'll meet the world's most gifted mathematicians, from Pythagoras and Euclid to Fermat, Gauss, and Erd?o?s, and you'll discover a host of unique insights and inventive conjectures that have both enlarged our understanding and deepened the mystique of prime numbers. This comprehensive, A-to-Z guide covers everything you ever wanted to know--and much more that you never suspected--about prime numbers, including: * The unproven Riemann hypothesis and the power of the zeta function * The "Primes is in P" algorithm * The sieve of Eratosthenes of Cyrene * Fermat and Fibonacci numbers * The Great Internet Mersenne Prime Search * And much, much more