The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
From MaRDI portal
Permutations, words, matrices (05A05) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Partitions of sets (05A18) Enumeration in graph theory (05C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms (68W40)
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)- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- A structured program to generate all topological sorting arrangements
- Loopless Gray code enumeration and the Tower of Bucharest
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
- Extending perfect matchings to Gray codes with prescribed ends
- A probabilistic spatial distribution model for wire faults in parallel network-on-chip links
- Towards a problem of Ruskey and Savage on matching extendability
- Trimming and gluing Gray codes
- Extracting co-occurrence relations from ZDDs
- Experimental comparison of decomposition methods for systems of Boolean function
- A framework for constructing de Bruijn sequences via simple successor rules
- Decomposition of data mining algorithms into unified functional blocks
- Pairs of majority-decomposing functions
- The complexity of approximating bounded-degree Boolean \(\#\)CSP
- Counting and computing the Rand and block distances of pairs of set partitions
- Monomer-dimer tatami tilings of square regions
- Counting families of mutually intersecting sets
- Enumerating the edge-colourings and total colourings of a regular graph
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Poisson twister generator by cumulative frequency technology
- Some properties of inclusions of multisets and contractive Boolean operators
- Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
- Alternation in two-way finite automata
- The toughness of Kneser graphs
- Deciphering role of inter and intracity human dispersal on epidemic spread via coupled reaction-diffusion models
- Fast verification of masking schemes in characteristic two
- Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties
- Gray codes and symmetric chains
- On greedy algorithms for binary de Bruijn sequences
- Unknotted cycles
- Knots admitting purely cosmetic surgeries are prime
- Equations for GL invariant families of polynomials
- Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems
- Regular numeral systems for data structures
- Synthesis of test sequences with a given switching activity
- Pattern Hopf algebras
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
- Testing multivariate uniformity based on random geometric graphs
- Reconstruction of score sets
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- Choosing the capacity of arcs with constraint on flow delay time
- Algorithmic search in group theory
- Finite generating functions for the sum-of-digits sequence
- Decomposing a system of Boolean functions into subsystems of connected functions
- A constant-time algorithm for middle levels Gray codes
- An algorithm for arbitrary-order cumulant tensor calculation in a sliding window of data streams
- Nyldon words
- Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting
- Implementing and reasoning about hash-consed data structures in Coq
- Imprimitive permutations in primitive groups
- Free-variable semantic tableaux for the logic of fuzzy inequalities
- The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
- A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
- Towards optimal packed string matching
- On generation of permutations of \(m\) out of \(n\) items
- Galois conjugation and multiboundary entanglement entropy
- Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension
- Young tableaux with periodic walls: counting with the density method
- On the central levels problem
- Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
- Proof of the middle levels conjecture
- Heuristic NPN classification for large functions using AIGs and LEXSAT
- Generating fixed density bracelets of arbitrary base
- Closed expressions for averages of set partition statistics
- Analysis of NORX: investigating differential and rotational properties
- The minimal hitting set generation problem: algorithms and computation
- Generating all patterns of graph partitions within a disparity bound
- Companion to the papers of Donald Knuth
- Set partitions and integrable hierarchies
- Binary decision diagrams
- Exponential mixing: lectures from Mumbai
- Combinatorics of Petersen graph and its compositions for all irreducible representations for Jahn-Teller, non-rigid molecules and clusters
- 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.
- The Stanford GraphBase. A platform for combinatorial computing.
- Generation of Colourings and Distinguishing Colourings of Graphs
- Transfinite Lyndon words
- Efficient Computation of Middle Levels Gray Codes
- Symbolic Model Checking for Dynamic Epistemic Logic
- On the exhaustive generation of plane partitions
- In-place permuting and perfect shuffling using involutions
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- Roaming moduli space using dynamical triangulations
- scientific article; zbMATH DE number 1513875 (Why is no real title available?)
- Enumerating Hamiltonian cycles
- A short proof of the middle levels theorem
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences
- Ancilla-free synthesis of large reversible functions using binary decision diagrams
- Priority queues and sorting for read-only data
- Central limit theorems for some set partition statistics
- All Jordan canonical forms of irreducible totally non-negative matrices
- Linear programming over exponent pairs
- Gray codes and symmetric chains
- Sparse Kneser graphs are Hamiltonian
- Space-optimal quasi-Gray codes with logarithmic read complexity
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
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)
