The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
From MaRDI portal
Permutations, words, matrices (05A05) Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Enumeration in graph theory (05C30)
Recommendations
- scientific article; zbMATH DE number 2176112
- scientific article; zbMATH DE number 1033192
- scientific article; zbMATH DE number 1805583
- 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
- scientific article; zbMATH DE number 1052006
Cited in
(only showing first 100 items - show all)- Chordal networks of polynomial ideals
- The complexity of approximating bounded-degree Boolean \(\#\)CSP
- On the exhaustive generation of plane partitions
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Counting families of mutually intersecting sets
- Explicit bounds for Bell numbers and their ratios
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Computing sieve integrals using LattE, and the density of integers with a localized divisor
- A decision diagram operation for reachability
- A probabilistic spatial distribution model for wire faults in parallel network-on-chip links
- In-place permuting and perfect shuffling using involutions
- Kneser graphs are Hamiltonian
- Space-optimal quasi-Gray codes with logarithmic read complexity
- Mathematical vanity plates
- scientific article; zbMATH DE number 1513875 (Why is no real title available?)
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- Free-variable semantic tableaux for the logic of fuzzy inequalities
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- Galois conjugation and multiboundary entanglement entropy
- Analysis of NORX: investigating differential and rotational properties
- On a combinatorial generation problem of Knuth
- Generation of Colourings and Distinguishing Colourings of Graphs
- Implementing efficient All solutions SAT solvers
- 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: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- An algorithm for arbitrary-order cumulant tensor calculation in a sliding window of data streams
- Decomposing a system of Boolean functions into subsystems of connected functions
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- Linear programming over exponent pairs
- scientific article; zbMATH DE number 7124303 (Why is no real title available?)
- Decision diagrams for solving a job scheduling problem under precedence constraints
- Extracting co-occurrence relations from ZDDs
- Poisson twister generator by cumulative frequency technology
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words
- On the hardness of Gray code problems for combinatorial objects
- Loopless Gray code enumeration and the Tower of Bucharest
- ZDD-based algorithmic framework for solving shortest reconfiguration problems
- A Combinatorial Model of Two-Sided Search
- Efficient Computation of Middle Levels Gray Codes
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- The Sackin index and depth of leaves in generalized Schröder trees
- Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems
- Pivot Gray codes for the spanning trees of a graph ft. the fan
- Backdoors into heterogeneous classes of SAT and CSP
- Maximize the rightmost digit: Gray codes for restricted growth strings
- Chains with small intervals in the lattice of binary paths
- Target cuts from relaxed decision diagrams
- Knots admitting purely cosmetic surgeries are prime
- Closed expressions for averages of set partition statistics
- Some properties of inclusions of multisets and contractive Boolean operators
- Extended formulations via decision diagrams
- On greedy algorithms for binary de Bruijn sequences
- On generation of permutations of \(m\) out of \(n\) items
- The Stanford GraphBase. A platform for combinatorial computing.
- Gray codes for signed involutions
- The solution space of sorting with recurring comparison faults
- On flips in planar matchings
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- Equations for GL invariant families of polynomials
- Combinatorial generation via permutation languages. I: Fundamentals
- Nyldon words
- Traversing combinatorial 0/1-polytopes via optimization
- Sparse Kneser graphs are Hamiltonian
- Combinatorial generation via permutation languages. IV: Elimination trees
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- The two higher Stasheff-Tamari orders are equal
- Exponential mixing: lectures from Mumbai
- Regular numeral systems for data structures
- Synthesis of test sequences with a given switching activity
- The bag-based search: a meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition
- Alternation in two-way finite automata
- Roaming moduli space using dynamical triangulations
- Reconstruction of score sets
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
- Iceberg hashing: optimizing many hash-table criteria at once
- Enumerating the edge-colourings and total colourings of a regular graph
- Compression with wildcards: Abstract simplicial complexes
- The single robot line coverage problem: Theory, algorithms, and experiments
- Set partitions and integrable hierarchies
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
- Containing all permutations
- The toughness of Kneser graphs
- Kneser graphs are Hamiltonian
- Binary decision diagrams
- Fast generation of unlabelled free trees using weight sequences
- Coalescent simulation in continuous space: algorithms for large neighbourhood size
- Efficient methods of constructing shorthand universal cycles for permutations
- Enumerating Hamiltonian cycles
- A Fibonacci analogue of the two’s complement numeration system
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Efficient generation of rectangulations via permutation languages
- Combinatorial generation algorithms based on and/or tree structures for a class of algebraic generating functions
- A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra
- Pattern Hopf algebras
- Enumeration classes defined by circuits
- Numbers and ideals
- Set partitions, tableaux, and subspace profiles of regular diagonal operators
This page was built for publication: The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957449)
