scientific article; zbMATH DE number 1265079

From MaRDI portal
Revision as of 15:23, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4234989

zbMath0911.05002MaRDI QIDQ4234989

Douglas R. Stinson, Donald L. Kreher

Publication date: 17 March 1999


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



Related Items (50)

Influence of certain transpositions on the cyclic structure of permutationsOptimal patchings for consecutive ones matricesSlope packings and coverings, and generic algorithms for the discrete logarithm problemOn generation of permutations of \(m\) out of \(n\) itemsRanking/Unranking of Lambda Terms with Compressed de Bruijn IndicesAn efficient string sorting algorithm for weighing matrices of small weightStern polynomialsq-Analogs of Packing DesignsOn acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degreesContainment properties of product and power graphsOn comparing algorithms for the maximum clique problemBlock-cyclic structuring of the basis of Fourier transforms based on cyclic substitutionA tutorial on the balanced minimum evolution problemUnnamed ItemEfficient approximate verification of B and Z models via symmetry markersOrdering the Boolean cube vectors by their weights and with minimal changeHow to backdoor (classic) McEliece and how to guard against backdoorsA tabu search algorithm for the covering design problemA novel approach to perturbative calculations for a large class of interacting boson theoriesOn the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacementTowards a generic view of primality through multiset decompositions of natural numbersWeighing matrices and string sortingA mathematical programming approach to the construction of BIBDsCompact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings)Energy-momentum conserving integration schemes for molecular dynamicsComputing low-weight discrete logarithmsSymmetric ILP: Coloring and small integersAn efficient design and implementation of the in-parameter-order algorithmDescription and generation of permutations containing cyclesSome baby-step giant-step algorithms for the low hamming weight discrete logarithm problemWorkweek optimization of experimental designs: exact designs for variable sampling costsGenerating combinatorial sets with given propertiesOn the low Hamming weight discrete logarithm problem for nonadjacent representationsSyntactic view of sigma-tau generation of permutationsA branch-and-bound approach for maximum quasi-cliquesFast parameterized matching with \(q\)-gramsEfficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-orderUnnamed ItemThe relevant prefixes of coloured Motzkin walks: an average case analysisAlgorithms for generating convex sets in acyclic digraphsA survey on the problems and algorithms for covering arrays via set coversAnalytical distribution of waiting time in the M/\{iD\}/1 queueEfficient linear-time ranking and unranking of derangementsGroup testing for consecutive positivesSome problems and algorithms related to the weight order relation on the n-dimensional Boolean cubeLinear Integer Programming Approach to Construction of Balanced Incomplete Block DesignsCounting Hamiltonian cycles in bipartite graphsRanking and unranking permutations in linear timeHanoi graphs and some classical numbersApproximately counting approximately-shortest paths in directed acyclic graphs







This page was built for publication: