scientific article; zbMATH DE number 2176112

Publication date: 14 June 2005

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

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Efficient recurrence for the enumeration of permutations with fixed pinnacle set ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Physical zero-knowledge proof protocol for Topswops ⋮ Detection of common subtrees with identical label distribution ⋮ Listing All Plane Graphs ⋮ Combinatorial Algorithms for Listing Paths in Minimal Change Order ⋮ Bubble-flip -- a new generation algorithm for prefix normal words ⋮ The Chinese Ring puzzle, the Crazy Elephant Dance puzzle, theb-Spinout puzzle, and Gray codes ⋮ Almost all Classical Theorems are Intuitionistic ⋮ Influence of certain transpositions on the cyclic structure of permutations ⋮ Partial duality for ribbon graphs. III: A gray code algorithm for enumeration ⋮ A loopless algorithm for generating multiple binary tree sequences simultaneously ⋮ A characterization of binary morphisms generating Lyndon infinite words ⋮ Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Multiple intersection exponents for planar Brownian motion ⋮ Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ On the maximum number of translates in a point set ⋮ An extension of Sturm's theorem to two dimensions ⋮ An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ The origins of combinatorics on words ⋮ Patterns in treeshelves ⋮ Synthetic sequence design for signal location search ⋮ Introduction to partially ordered patterns ⋮ Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution ⋮ Generalized algorithm for restricted weak composition generation ⋮ A Gray code for fixed-density necklaces and Lyndon words in constant amortized time ⋮ A note on two's company: ``The humbug of many logical values ⋮ Complement, Complexity, and Symmetric Representation ⋮ The number of fixed points of Wilf's partition involution ⋮ Partitions, Diophantine equations, and control systems ⋮ Robust optimization for premarshalling with uncertain priority classes ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Description of polygonal regions by polynomials of bounded degree ⋮ Computing with Multi-row Gomory Cuts ⋮ A quadratic lower bound for topswops ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Random generation and enumeration of bipartite permutation graphs ⋮ Tensor approach to mixed high-order moments of absorbing Markov chains ⋮ The Takagi function: a survey ⋮ A new universal cycle for permutations ⋮ Unnamed Item ⋮ Applications of the cosecant and related numbers ⋮ On semi-perfect de Bruijn words ⋮ Amortized efficiency of generating planar paths in convex position ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Dynamic and internal longest common substring ⋮ Binary bubble languages and cool-lex order ⋮ Mining frequent closed rooted trees ⋮ Integer representations towards efficient counting in the bit probe model ⋮ Unranking of small combinations from large sets ⋮ Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric ⋮ Random and exhaustive generation of permutations and cycles ⋮ On existence of a closed trajectory in a three-dimensional model of a Brusselator ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ A low-memory algorithm for finding short product representations in finite groups. ⋮ The coolest way to generate binary strings ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ A construction of Gray codes inducing complete graphs ⋮ Growing perfect cubes ⋮ On the complexity of matrix reduction over finite fields ⋮ New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems ⋮ Generalized Gray codes with prescribed ends ⋮ Description and generation of permutations containing cycles ⋮ Methods for estimating continuants ⋮ Benchmark testing of algorithms for very robust regression: FS, LMS and LTS ⋮ Shorthand universal cycles for permutations ⋮ Linear time construction of a compressed Gray code ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ Reordering columns for smaller indexes ⋮ Level sets of the Takagi function: Hausdorff dimension ⋮ Generating combinatorial sets with given properties ⋮ The Hausdorff dimension of the level sets of Takagi's function ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ Universal cycles of classes of restricted words ⋮ Partitioning datasets based on equalities among parameters ⋮ How large are the level sets of the Takagi function? ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Parity codes ⋮ A test statistic for weighted runs ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation ⋮ On prefix normal words and prefix normal forms ⋮ Long paths in hypercubes with a quadratic number of faults ⋮ Simultaneous confidence intervals for ranks using the partitioning principle ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density ⋮ Sensitivity analysis of queueing models based on polynomial chaos approach ⋮ Centered partition processes: informative priors for clustering (with discussion) ⋮ Finding Lean Induced Cycles in Binary Hypercubes ⋮ Linear-time algorithm for generating c-isolated bicliques ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Unnamed Item ⋮ Matching graphs of hypercubes and complete bipartite graphs ⋮ Unnamed Item ⋮ A low spatial complexity algorithm to generate combinations with the strong minimal change property ⋮ Computing expectations and marginal likelihoods for permutations ⋮ Characterizations of periods of multi-dimensional shifts ⋮ Gray codes for column-convex polyominoes and a new class of distributive lattices ⋮ The coolest way to generate combinations ⋮ On universal cycles for multisets ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ Some classes of bipartite graphs induced by Gray codes ⋮ Gray cycles of maximum length related to \(k\)-character substitutions ⋮ Hausdorff dimension of local level sets of Takagi's function ⋮ A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously ⋮ Tight Approximation for Unconstrained XOS Maximization

This page was built for publication: