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)

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 ⋮ Experimental comparison of decomposition methods for systems of Boolean function ⋮ Complexity of fixed-size bit-vector logics ⋮ A short proof of the middle levels theorem ⋮ Dualization of Boolean functions using ternary decision diagrams ⋮ Reconstruction of score sets ⋮ Mathematical vanity plates ⋮ Priority Queues and Sorting for Read-Only Data ⋮ 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 ⋮ Exhaustive generation for permutations avoiding (colored) regular sets of patterns ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Alternation in two-way finite automata ⋮ Gray codes for signed involutions ⋮ Choosing the capacity of arcs with constraint on flow delay time ⋮ The solution space of sorting with recurring comparison faults ⋮ Algorithmic search in group theory ⋮ Finite generating functions for the sum-of-digits sequence ⋮ Backdoors into heterogeneous classes of SAT and CSP ⋮ Decomposition of data mining algorithms into unified functional blocks ⋮ Ripser: efficient computation of Vietoris-Rips persistence barcodes ⋮ The toughness of Kneser graphs ⋮ Decomposing a system of Boolean functions into subsystems of connected functions ⋮ All Jordan canonical forms of irreducible totally non-negative matrices ⋮ Pairs of majority-decomposing functions ⋮ Proof of the middle levels conjecture ⋮ Coalescent simulation in continuous space: algorithms for large neighbourhood size ⋮ Deciphering role of inter and intracity human dispersal on epidemic spread via coupled reaction-diffusion models ⋮ Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT ⋮ Fast verification of masking schemes in characteristic two ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Linear programming over exponent pairs ⋮ Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties ⋮ An algorithm for arbitrary-order cumulant tensor calculation in a sliding window of data streams ⋮ Nyldon words ⋮ Gray codes and symmetric chains ⋮ On greedy algorithms for binary de Bruijn sequences ⋮ Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ Unknotted cycles ⋮ Sparse Kneser graphs are Hamiltonian ⋮ Knots admitting purely cosmetic surgeries are prime ⋮ Implementing and reasoning about hash-consed data structures in Coq ⋮ Generating fixed density bracelets of arbitrary base

This page was built for publication: