scientific article

Publication date: 26 January 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)

Related Items (only showing first 100 items - show all)

Chains with Small Intervals in the Lattice of Binary Paths ⋮ Proximity Search for Maximal Subgraph Enumeration ⋮ A new omnibus test of fit based on a characterization of the uniform distribution ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Unnamed Item ⋮ Chordal Networks of Polynomial Ideals ⋮ ZDD-based algorithmic framework for solving shortest reconfiguration problems ⋮ Star transposition Gray codes for multiset permutations ⋮ Experimental study of algorithms for minimization of binary decision diagrams using algebraic representations of cofactors ⋮ Software as storytelling: a systematic literature review ⋮ Set partitions, tableaux, and subspace profiles of regular diagonal operators ⋮ Ordering the Boolean cube vectors by their weights and with minimal change ⋮ Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic ⋮ A decision diagram operation for reachability ⋮ Compression with wildcards: Abstract simplicial complexes ⋮ Celebrating Loday's associahedron ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ The single robot line coverage problem: Theory, algorithms, and experiments ⋮ A Fibonacci analogue of the two’s complement numeration system ⋮ A curious identity arising from Stirling's formula and saddle-point method on two different contours ⋮ Hamiltonian intervals in the lattice of binary paths ⋮ Unnamed Item ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Containing All Permutations ⋮ DONAGHEY’S TRANSFORMATION: CAROUSEL EFFECTS AND TAME COMPONENTS ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ A Combinatorial Model of Two-Sided Search ⋮ Rainbow Cycles in Flip Graphs ⋮ On flips in planar matchings ⋮ Chain reduction for binary and zero-suppressed decision diagrams ⋮ Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Rainbow Cycles in Flip Graphs. ⋮ The Fibonacci recurrence with harmonic inhomogeneity ⋮ Fast Generation of Unlabelled Free Trees using Weight Sequences ⋮ Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube ⋮ Unnamed Item ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Implementing Efficient All Solutions SAT Solvers ⋮ Decision diagrams for solving a job scheduling problem under precedence constraints ⋮ 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 ⋮ Loopless Gray code enumeration and the Tower of Bucharest ⋮ Closed expressions for averages of set partition statistics ⋮ Equations for GL invariant families of polynomials ⋮ On generation of permutations of \(m\) out of \(n\) items ⋮ Generation of Colourings and Distinguishing Colourings of Graphs ⋮ A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra ⋮ Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems ⋮ Transfinite Lyndon Words ⋮ Regular numeral systems for data structures ⋮ Synthesis of test sequences with a given switching activity ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ Binary Decision Diagrams ⋮ Set partitions and integrable hierarchies ⋮ Symbolic Model Checking for Dynamic Epistemic Logic ⋮ Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence ⋮ Extending perfect matchings to Gray codes with prescribed ends ⋮ Combinatorics of Petersen graph and its compositions for all irreducible representations for Jahn-Teller, non-rigid molecules and clusters ⋮ Pattern Hopf algebras ⋮ A probabilistic spatial distribution model for wire faults in parallel network-on-chip links ⋮ Galois conjugation and multiboundary entanglement entropy ⋮ Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension ⋮ Analysis of NORX: Investigating Differential and Rotational Properties ⋮ On the exhaustive generation of plane partitions ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ In-place permuting and perfect shuffling using involutions ⋮ 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 ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram ⋮ Towards a problem of Ruskey and Savage on matching extendability ⋮ Young tableaux with periodic walls: counting with the density method ⋮ Trimming and gluing Gray codes ⋮ Unnamed Item ⋮ On the central levels problem ⋮ Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions ⋮ Towards optimal packed string matching ⋮ Counting families of mutually intersecting sets ⋮ Roaming moduli space using dynamical triangulations ⋮ Enumerating the edge-colourings and total colourings of a regular graph ⋮ Generating All Patterns of Graph Partitions Within a Disparity Bound ⋮ Enumerating Hamiltonian cycles ⋮ Testing multivariate uniformity based on random geometric graphs ⋮ Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences ⋮ Exponential Mixing: Lectures from Mumbai ⋮ Extracting co-occurrence relations from ZDDs ⋮ Ancilla-free synthesis of large reversible functions using binary decision diagrams ⋮ Central limit theorems for some set partition statistics ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity

This page was built for publication: