On Generating All Binary Trees
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Revisiting exact combinational circuit synthesis
Proceedings of the 2008 ACM symposium on Applied computing
Exact combinational logic synthesis and non-standard circuit design
Proceedings of the 5th conference on Computing frontiers
Generating balanced parentheses and binary trees by prefix shifts
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Distribution of distinguishable objects to bins: generating all distributions
International Journal of Computer Mathematics
Intervals in Catalan lattices and realizers of triangulations
Journal of Combinatorial Theory Series A
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell
Proceedings of the 2009 ACM symposium on Applied Computing
A Groupoid of Isomorphic Data Transformations
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Random Generation and Enumeration of Bipartite Permutation Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient enumeration of all ladder lotteries and its application
Theoretical Computer Science
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hereditarily finite representations of natural numbers and self-delimiting codes
Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
O(1)-time unsorting by prefix-reversals in a boustrophedon linked list
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Mining frequent closed trees in evolving data streams
Intelligent Data Analysis - Ubiquitous Knowledge Discovery
Definability of combinatorial functions and their linear recurrence relations
Fields of logic and computation
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Intervals of balanced binary trees in the Tamari lattice
Theoretical Computer Science
Ranking and loopless generation of k-ary dyck words in cool-lex order
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Cool-lex order and k-ary Catalan structures
Journal of Discrete Algorithms
On Generating All Binary Trees
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
Theoretical Computer Science
Hi-index | 0.00 |
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science.The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.Volume 4, Fascicle 4This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming. In thoroughly discussing this well-known subject, while providing 124 new exercises, Knuth continues to build a firm foundation for programming. To that same end, this fascicle also covers the history of combinatorial generation. Spanning many centuries, across many parts of the world, Knuth tells a fascinating story of interest and relevance to every artful programmer, much of it never before told. The story even includes a touch of suspense: two problems that no one has yet been able to solve.