Efficient iteration in admissible combinatorial classes
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
WHAM: a high-throughput sequence alignment method
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Teaching the art of computer programming (TAOCP)
Proceedings of the 16th Western Canadian Conference on Computing Education
Implicit permutation enumeration networks and binary decision diagrams reordering
Proceedings of the 48th Design Automation Conference
Shortest cycle through specified elements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Enumerating tatami mat arrangements of square grids
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
The rand and block distances of pairs of set partitions
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A program-size complexity measure for mathematical problems and conjectures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Verifying two lines of c with why3: an exercise in program verification
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
Counting and computing the Rand and block distances of pairs of set partitions
Journal of Discrete Algorithms
Monomer-dimer tatami tilings of square regions
Journal of Discrete Algorithms
Cool-lex order and k-ary Catalan structures
Journal of Discrete Algorithms
The coolest order of binary strings
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
WHAM: A High-Throughput Sequence Alignment Method
ACM Transactions on Database Systems (TODS)
Proceedings of the 20th International Conference on Real-Time and Network Systems
Using XQuery for problem solving
Software—Practice & Experience
Generating bracelets with fixed content
Theoretical Computer Science
Journal of Combinatorial Theory Series A
INFORMS Transactions on Education
International Journal of Intelligent Information and Database Systems
On the exhaustive generation of plane partitions
Theoretical Computer Science
The greedy gray code algorithm
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Automatically generating problems and solutions for natural deduction
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
Journal of Computer and Systems Sciences International
Review: Cloud computing service composition: A systematic literature review
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043 The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuths multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuths analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient review of future volumes could almost be: Knuth, Volume n has been published. Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmers library.