Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Combinatorial designs: constructions and analysis

Combinatorial designs: constructions and analysis 3. Modelling Distributed Systems by Fokkink. Misc Books 1. Quantum Computing Without Magic by Meglicki. 2. Advanced Data Structures by Peter Brass. 3. Introduction to Information Retrieval by Manning, Raghavan, and Schutze. 4. Higher Arithmetic: An algorithmic introduction to Number Theory 5. A Conscise introduction to Data Compression by Salomon. 6. Putting Auction Theory to Work by Paul Milgrom. 7. Di €erence Equations: From Rabbits to Chaos by Cull, Flahive, and Robson. Review of 1 Combinatorial Designs: Constructions and Analysis Author of Book: Douglas R. Stinson Springer-Verlag, New York, 2004, 300 pages Review by R. Gregory Taylor Introduction The origins of combinatorial design theory lie within recreational mathematics. With the work of Fisher and Yates in the 1930s it began to take on the character of a serious academic subject with deep connections to linear algebra, group theory, and number theory; there are applications to statistical experimentation, tournament scheduling, mathematical biology, algorithm design and analysis, and cryptography. The basic notion is that of a design, whereby one intends a pair (X, A) with X any set of elements (or points) and A any multiset of nonempty subsets of X (termed blocks). (If A is a set, then (X, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGACT News Association for Computing Machinery

Combinatorial designs: constructions and analysis

ACM SIGACT News , Volume 39 (4) – Nov 30, 2008

Loading next page...
 
/lp/association-for-computing-machinery/combinatorial-designs-constructions-and-analysis-Ux30Lfk4zL

References (100)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2008 by ACM Inc.
ISSN
0163-5700
DOI
10.1145/1466390.1466393
Publisher site
See Article on Publisher Site

Abstract

3. Modelling Distributed Systems by Fokkink. Misc Books 1. Quantum Computing Without Magic by Meglicki. 2. Advanced Data Structures by Peter Brass. 3. Introduction to Information Retrieval by Manning, Raghavan, and Schutze. 4. Higher Arithmetic: An algorithmic introduction to Number Theory 5. A Conscise introduction to Data Compression by Salomon. 6. Putting Auction Theory to Work by Paul Milgrom. 7. Di €erence Equations: From Rabbits to Chaos by Cull, Flahive, and Robson. Review of 1 Combinatorial Designs: Constructions and Analysis Author of Book: Douglas R. Stinson Springer-Verlag, New York, 2004, 300 pages Review by R. Gregory Taylor Introduction The origins of combinatorial design theory lie within recreational mathematics. With the work of Fisher and Yates in the 1930s it began to take on the character of a serious academic subject with deep connections to linear algebra, group theory, and number theory; there are applications to statistical experimentation, tournament scheduling, mathematical biology, algorithm design and analysis, and cryptography. The basic notion is that of a design, whereby one intends a pair (X, A) with X any set of elements (or points) and A any multiset of nonempty subsets of X (termed blocks). (If A is a set, then (X,

Journal

ACM SIGACT NewsAssociation for Computing Machinery

Published: Nov 30, 2008

There are no references for this article.