TCS / Research / Publications / The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments

Reference:

Harri Haanpää and Petteri Kaski. The near resolvable 2-(13, 4, 3) designs and thirteen-player whist tournaments. Designs, Codes and Cryptography, 35(3):271–285, June 2005.

Suggested BibTeX entry:

@article{haka05:neares,
    author = {Harri Haanp{\"a}{\"a} and Petteri Kaski},
    journal = {Designs, Codes and Cryptography},
    month = {June},
    number = {3},
    pages = {271--285},
    title = {The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments},
    volume = {35},
    year = {2005},
}

This work is not available online here.

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.