NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
A standard problem of courts at all levels is the selection of a panel of potential jurors from a jury pool, which is a list of people who are eligible to serve as jurors. The problem is to select N people out of the M possible people in a fair way. One definition of fair is that each of the M people has an equal chance to be selected for any jury pool. A much more rigorous definition is that each of the possible combinations of N people has an equal chance to be selected as the entire jury pool. A working computer program incorporating a fair algorithm for the problem stated above has been produced, together with a brief testing program. The properties of this algorithm are discussed, and an improved version of a program developed previously is presented.
Citation
- 6569
Report Number
6569
Pub Type
NIST Pubs
Keywords
chi-square test, jury selction, lagged-Fibonacci generator, Pseudo-Random Number, random numbers
Citation
Blue, J.
(2000),
Fair Selection of Jury Panels From Jury Pools, - 6569, National Institute of Standards and Technology, Gaithersburg, MD
(Accessed October 21, 2025)