Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Permutation patterns
Linton S., Ruskuc N., Vatter V., Cambridge University Press, New York, NY, 2010. 352 pp. Type: Book (978-0-521728-34-8)
Date Reviewed: May 19 2011

This book consists of papers from the Fifth International Conference on Permutation Patterns, held in 2007. The study of permutation patterns is a branch of combinatorics that finds applications in graph theory, model theory, automata and language theory, and bioinformatics. This well-written collection of research papers by international experts in the field covers all of the significant strands of current research, including structural methods and simple patterns, generalizations of patterns, various enumerative aspects, machines, and networks.

Of special interest are the invited contributions from two leading experts: Martin Klazer (at Charles University in Prague) discusses combinatorial enumeration, and Mike Atkinson (at the University of Otago) discusses permuting machines.

I highly recommend this book to specialists and researchers in combinatorics. It should be noted that a few of the current problems in the field of permutation patterns are listed at the end of the book, which makes it a good starting point for future projects and dissertations.

Reviewer:  Hamid R. Noori Review #: CR139070 (1110-1018)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Permutations And Combinations (G.2.1 ... )
 
 
Automata (F.1.1 ... )
 
 
Pattern Matching (F.2.2 ... )
 
 
Models Of Computation (F.1.1 )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Permutations And Combinations": Date
Computing short generator sequences
Driscoll J., Furst M. Information and Computation 72(2): 117-132, 1987. Type: Article
Jan 1 1988
Permutations of bounded degree generate groups of polynomial diameter
McKenzie P. (ed) Information Processing Letters 19(5): 253-254, 1984. Type: Article
Aug 1 1985
How to construct pseudorandom permutations from pseudorandom functions
Luby M. (ed), Rackoff C. SIAM Journal on Computing 17(2): 373-386, 1988. Type: Article
Jul 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy