Classification of simple 2-(11,3,3) designs (Q1011489)

With the aid of computers, the authors have established the existence of precisely 7,038,699,746 nonisomorphic 2-(11,3,3) designs without repeated blocks, as well as computing the sizes of their automorphism groups. This was the smallest case awaiting enumeration. They provide a detailed description of the backtracking and isomorph rejection phases of their algorithm, along with historical background and references. They also used their methods to confirm the previously known classifications of 2-(8,3, 6), 2-(12,3,2), and 2-(19,3,1) designs.