The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments

Harri Haanpää, Petteri Kaski

    Research output: Contribution to journalArticleScientificpeer-review

    5 Citations (Scopus)
    Original languageEnglish
    Pages (from-to)271-285
    JournalDESIGNS CODES AND CRYPTOGRAPHY
    Volume35
    Issue number3
    Publication statusPublished - 2005
    MoE publication typeA1 Journal article-refereed

    Keywords

    • near resolvable design
    • orderly algorithm
    • whist tournament

    Cite this