scientific article

Publication date: 1978

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

discrete structures FORTRAN subroutines analyses of combinatorial algorithms generation of random test data

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Discrete mathematics in relation to computer science (68Rxx)

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

A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ Polynomials with Height 1 and Prescribed Vanishing at 1 ⋮ Time-efficient estimation of conditional mutual information for variable selection in classification ⋮ On a problem of Byrnes concerning polynomials with restricted coefficients, II ⋮ Listing graphs that satisfy first-order sentences ⋮ Closed expressions for averages of set partition statistics ⋮ Newman polynomials with prescribed vanishing and integer sets with distinct subset sums ⋮ A hybrid algorithm for computing permanents of sparse matrices ⋮ Efficient computation of permanents, with applications to boson sampling and random matrices ⋮ Efficient enumeration of words in regular languages ⋮ Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Doubly adjacent gray codes for the symmetric group ⋮ Sequential vector packing ⋮ On the lexicographical generation of compressed codes ⋮ Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables ⋮ A hybrid algorithm for multi-homogeneous Bézout number ⋮ Ryser's permanent identity in the symmetric algebra ⋮ Combinatorial identities by way of Wilf's multigraph model ⋮ Counting genealogical trees ⋮ A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL ⋮ Permanent variational wave functions for bosons ⋮ Random Deterministic Automata ⋮ Lexicographical Ordering of k-Subsets of a Set ⋮ Unnamed Item ⋮ Random path method with pivoting for computing permanents of matrices ⋮ Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Bernstein polynomial angular densities of multivariate extreme value distributions ⋮ Invariant norm quantifying nonlinear content of Hamiltonian systems ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ Enumerative encoding of correlation-immune Boolean functions ⋮ Phase transitions and the search problem ⋮ Refining the phase transition in combinatorial search ⋮ Flip-swap languages in binary reflected Gray code order ⋮ The construction of optimal designs for dose-escalation studies ⋮ Efficient Enumeration of Regular Languages ⋮ Young tableaux with periodic walls: counting with the density method ⋮ Ordering of nested square roots of 2 according to the Gray code ⋮ A linear algorithm for the random sampling from regular languages ⋮ Chromatic polynomials for regular graphs and modified wheels ⋮ On the shape of random Pólya structures ⋮ Optimal selection and ordering of columns in supersaturated designs ⋮ A homomorphic polynomial for oriented graphs ⋮ RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP ⋮ Multinomial interpoint distances ⋮ A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems ⋮ Transfer distance between partitions ⋮ An example of two homeomorphic, nondiffeomorphic complete intersection surfaces ⋮ On the likelihood of dummy players in weighted majority games ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ New constructions for covering designs ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ A METHOD FOR FINDING AGGREGATED REPRESENTATIONS OF LINEAR DYNAMICAL SYSTEMS ⋮ Efficient enumeration of cyclic permutations in situ ⋮ The limiting distribution of the trace of a random plane partition ⋮ Observations on the generation of permutations from random sequences ⋮ A faster exact-counting protocol for anonymous dynamic networks ⋮ Fixed-parameter tractability of satisfying beyond the number of variables ⋮ Boltzmann samplers for first-order differential specifications ⋮ Consensus of partitions: a constructive approach ⋮ Exact solution of two classes of prudent polygons ⋮ Enumeration and generating functions of Rota-Baxter words. ⋮ Enumeration and generating functions of differential Rota-Baxter words. ⋮ Calculation of the permanent of a sparse positive matrix ⋮ A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes ⋮ An efficient algorithm for computing permanental polynomials of graphs ⋮ Generating alternating permutations lexicographically ⋮ $\pi$-formulas and Gray code ⋮ Short proof that Kneser graphs are Hamiltonian for $n \geqslant 4k$ ⋮ Counting and generating permutations in regular classes ⋮ Generating all distributions of objects to bins ⋮ Finding and counting permutations via CSPs ⋮ Binary self-dual codes with automorphisms of order 23 ⋮ Multiphysics Computational Modeling in $\boldsymbol{\mathcal{C}}\mathbf{Heart}$ ⋮ Gray code enumeration of families of integer partitions ⋮ Runge-Kutta methods for quadratic ordinary differential equations ⋮ Fast verification of masking schemes in characteristic two ⋮ Centered partition processes: informative priors for clustering (with discussion) ⋮ Genealogical-tree probabilities in the infinitely-many-site model ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Phorma: perfectly hashable order restricted multidimensional arrays ⋮ Unnamed Item ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Statistical properties of lambda terms ⋮ Degeneracy in heteroscedastic regression models ⋮ Analytical distribution of waiting time in the M/\{iD\}/1 queue ⋮ Expected frequency and mean size of the paradox of new members ⋮ Natural exact covering systems and the reversion of the Möbius series ⋮ Evaluating matrix-variate moments through higher-order differential forms and combinatorial algorithms. ⋮ Gray-Codes ⋮ Rekursive Erzeugung aller Partitionen einer endlichen Menge ⋮ Minimal change list for Lucas strings and some graph theoretic consequences ⋮ On the information-based measure of covariance complexity and its application to the evaluation of multivariate linear models ⋮ Computation of several power indices by generating functions ⋮ Iterating Through Labelled Combinatorial Structures ⋮ Zeroless arithmetic: representing integers ONLY using ONE ⋮ The dual variable method for solving fluid flow difference equations on Delaunay triangulations ⋮ Parallel sorting on Cayley graphs ⋮ On the effective generation of set elements within specified ranges ⋮ The generation of random, binary unordered trees

This page was built for publication: