Twenty-five papers from the May 1997 conference discuss current trends in discrete mathematics in all its versatility, width, and depth. The largest number of papers deal with graph theory. Other topics include a more structural (algebraic) approach, combinatorial questions of an algebraic nature, problems related to computer science, and applications. Annotation copyrighted by Book News, Inc., Portland, OR
This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993-94 Special year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speed-ups on parallel computers. The challenge invluded two problem areas for research study: tree searching, algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Participants at sites in the US and Europe undertook projects from November 1993 through October 1994. The workshop was held at DIMACS in November 1994. Participants were encouraged to share test results, to rework their implementations considering feedback at the workshop, and to submit a final report for the proceedings. Nine papers were selected for this volume.
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.
The fledgling field of DNA computers began in 1994 when Leonard Adleman surprised the scientific community by using DNA molecules, protein enzymes, and chemicals to solve an instance of a hard computational problem. This volume presents results from the second annual meeting on DNA computers held at Princeton only one and one-half years after Adleman's discovery. By drawing on the analogy between DNA computing and cutting-edge fields of biology (such as directed evolution), this volume highlights some of the exciting progress in the field and builds a strong foundation for the theory of molecular computation.
This book is a collection of articles written by leading researchers in information theory stemming from the DIMACS Workshop on Network Information held at Rutgers University (Piscataway, NJ). The articles focus on problems concerning efficient and reliable communication in multi-terminal settings. Information theory has recently attracted renewed attention because of key developments spawning challenging research problems. The material is divided into four parts: "Information Theory for Sources", which concentrates on network source coding problems; "Information Theory for Channels", where ch.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.