Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Algorithms and Computation
This book constitutes the refereed proceedings of the 11th International Conference on Algorithms and Computation, ISAAC 2000, held in Taipei, Taiwan in December 2000. The 46 revised papers presented together with an invited paper were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on algorithms and data structures; combinatorial optimization; approximation and randomized algorithms; graph drawing and graph algorithms; automata, cryptography, and complexity theory; parallel and distributed algorithms; computational geometry; and computational biology.
Graphs, Morphisms and Statistical Physics
Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation : 2004 Book News, Inc., Portland, OR (booknews.com).
Discrete Mathematics in the Schools
A collection of articles written by experienced primary, secondary, and collegiate educators. It explains why discrete mathematics should be taught in K-12 classrooms and offers guidance on how to do so. It offers school and district curriculum leaders material that addresses how discrete mathematics can be introduced into their curricula.
Microsurveys in Discrete Probability
This book contains eleven articles surveying emerging topics in discrete probability. The papers are based on talks given by experts at the DIMACS "Microsurveys in Discrete Probability" workshop held at the Institute for Advanced Study, Princeton, NJ, in 1997. This compilation of current research in discrete probability provides a unique overview that is not available elsewhere in book or survey form. Topics covered in the volume include: Markov chains (pefect sampling, coupling from the past, mixing times), random trees (spanning trees on infinite graphs, enumeration of trees and forests, tree-valued Markov chains), distributional estimates (method of bounded differences, Stein-Chen method for normal approximation), dynamical percolation, Poisson processes, and reconstructing random walk from scenery.
Interconnection Networks and Mapping and Scheduling Parallel Computations
This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation.
Geometric and Computational Perspectives on Infinite Groups
This book contains the proceedings of two workshops on computational aspects of geometric group theory.
Logic and Random Structures
The articles in this volume are based on lectures presented at the Workshop on Logic and Random Structures, held on November 5 through 7, 1995, at the DIMACS Center at Rutgers, New Jersey. There were two main themes in the workshop. The first was concerned with classes of random finite structures, and probabilities of properties definable in these classes. The second was the complexity of circuits and sentences.
African Americans in Mathematics
This volume contains contains research and expository papers by African-American mathematicians on issues related to their involvement in the mathematical sciences. Little is known, taught, or written about African-American mathematicians. Information is lacking on their past and present contributions and on the qualitive nature of their existence in and distribution throughout mathematics. This lack of information leads to a number of questions that have to date remainedunanswered. This volume provides details and pointers to help answer some of these questions.
