The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
binary decision diagramBoolean functionscombinatorial algorithmsgeneration of combinatorial objectsinteger partitionset partition
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Partitions of sets (05A18) Trees (05C05) Enumeration in graph theory (05C30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics on words (68R15) Nonnumerical algorithms (68W05)
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
- On tree-growing search strategies
- Determining the majority: The biased case
- Normal convergence problem? Two moments and a recurrence may be the clues
- Substitutions, coding prescriptions and integer representation
- Features of formation and ordering of samples
- The number of winners in a discrete geometrically distributed sample
- Distributional convergence for the number of symbol comparisons used by QuickSort
- Faster compressed quadtrees
- Product optimization in stepwise design
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations
- Fast and simple compact hashing via bucketing
- Eigenlogic in the spirit of George Boole
- Constructing unlabelled lattices
- DenseZDD: a compact and fast index for families of sets
- On the error resilience of ordered binary decision diagrams
- Towards a generic view of primality through multiset decompositions of natural numbers
- Influence of addition modulo 2ⁿ on algebraic attacks
- The Boolean constraint solver of SWI-Prolog (system description)
- Solving quantified bit-vector formulas using binary decision diagrams
- Fast compressed tries through path decompositions
- Algebraic attacks using binary decision diagrams
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- DD: a new decision diagram for efficient problem solving in permutation space
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
- scientific article; zbMATH DE number 3864523 (Why is no real title available?)
- The Stanford GraphBase. A platform for combinatorial computing.
- Permutation pattern avoidance and the Catalan triangle
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- scientific article; zbMATH DE number 1954382 (Why is no real title available?)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
- A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- Concatenations of the hidden weighted bit function and their cryptographic properties
- Successor algorithms via counting arguments
- Pruned discrete random samples
- Best-order streaming model
- Computational complexity of puzzles and related topics
- Optimal resizable arrays
- Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
- Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
- Counting occurrences of patterns in permutations
- The topology of isospectral manifolds of tridiagonal matrices
- On the silhouette of binary search trees
This page was built for publication: The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393339)
