Efficient computation of statistical procedures based on all subsets of a specified size
From MaRDI portal
Publication:4337135
DOI10.1080/03610929608831709zbMath0875.65126OpenAlexW1985808586MaRDI QIDQ4337135
Arnold J. Stromberg, John E. Hinkle
Publication date: 11 November 1997
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610929608831709
Cites Work
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Gray codes with restricted density
- Jackknife, bootstrap and other resampling methods in regression analysis
- Approximation Theorems of Mathematical Statistics
- Index system and separability of constant weight Gray codes
- A Gray code for compositions
- Efficient generation of the binary reflected gray code and its applications
- Adjacent interchange generation of combinations
- Transposition Graphs
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
This page was built for publication: Efficient computation of statistical procedures based on all subsets of a specified size