Publications of Douglas Stinson

This listing contains all my publications (papers and book chapters). Links are frequently provided to published versions of papers; however, subscriptions may be required to access them.

Papers Published in 2017

  1. D. R. Stinson and R. Wei. Combinatorial repairability for threshold schemes. To appear in Designs, Codes and Cryptography. Published online, Feb. 8, 2017, 16 pp.
  2. N. Nasr Esfahani and D. R. Stinson. Computational results on invertible matrices with the maximum number of invertible 2 × 2 submatrices. Australasian Journal of Combinatorics 69 (2017), 130-144.
  3. W. J. Martin and D. R. Stinson. Some nonexistence results for strong external difference families using character theory. Bulletin of the ICA 80 (2017), 79-92.
  4. T. M. Laing, K. M. Martin, M. B. Paterson and D. R. Stinson. Localised multisecret sharing. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences 9 (2017), 581-597.
  5. C. Guo and D. R. Stinson. A tight bound on the size of certain separating hash families. Australasian Journal of Combinatorics 67 (2017), 294-303.

Papers Published in 2016

  1. X. Ma, D. R. Stinson and R. Wei. An optimization problem for combinatorial key predistribution. Journal of Combinatorial Mathematics and Combinatorial Computing 99 (2016), 225-235.
  2. P. D'Arco, N. Nasr Esfahani and D. R. Stinson. All or nothing at all. Electronic Journal of Combinatorics 23(4) (2016), paper 4.10, 24 pp.
  3. D. S. Archdeacon, J. H. Dinitz, A. Mattern and D. R. Stinson. On partial sums in cyclic groups. Journal of Combinatorial Mathematics and Combinatorial Computing 98 (2016), 327-342.
  4. M. B. Paterson and D. R. Stinson. Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discrete Mathematics 339 (2016), 2891-2906.
  5. M. B. Paterson, D. R. Stinson and Yongge Wang. On encoding symbol degrees of array BP-XOR codes. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences 8 (2016), 19-32.
  6. C. M. Swanson and D. R. Stinson. Unconditionally secure signature schemes revisited. Journal of Mathematical Cryptology 10 (2016), 35-67.

Papers Published in 2015

  1. K. Henry and D. R. Stinson. Linear approaches to resilient aggregation in sensor networks. Journal of Mathematical Cryptology 9 (2015), 245-272.
  2. M. B. Paterson and D. R. Stinson. Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs. Journal of Mathematical Cryptology 9 (2015), 215-225.
  3. C. Guo, D. R. Stinson and Tran van Trung. On tight bounds for binary frameproof codes. Designs, Codes and Cryptography 77 (2015), 301-319.
  4. C. Guo, D. R. Stinson and Tran van Trung. On symmetric designs and binary frameproof codes. In Springer Proceedings in Mathematics and Statistics, "Algebraic Design Theory and Hadamard Matrices", Springer, 2015, pp. 125-136.
  5. C. Swanson and D. R. Stinson. Extended results on privacy against coalitions of users in user-private information retrieval protocols. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences 7 (2015), 415-437.
  6. M. Nojoumian and D. R. Stinson. Sequential secret sharing as a new hierarchical access structure. Journal of Internet Services and Information Security 5 (2015), 24-32.

Papers Published in 2014

  1. M. Kendall, K. M. Martin, S.-L. Ng, M. B. Paterson and D. R. Stinson. Broadcast-enhanced key predistribution schemes. ACM Transactions on Sensor Networks 11 (2014), article No. 6, 33 pp.
  2. Colleen M. Swanson and Douglas R. Stinson. Additional constructions to solve the generalized Russian cards problem using combinatorial designs. Electronic Journal of Combinatorics 21 (2014), paper #P3.29, 31 pp.
  3. D. R. Stinson, C. Swanson and Tran van Trung. A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs. Discrete Mathematics 325 (2014), 23-31.
  4. M. B. Paterson and D. R. Stinson. A unified approach to combinatorial key predistribution schemes for sensor networks. Designs, Codes and Cryptography 71 (2014), 433-457.
  5. Colleen M. Swanson and Douglas R. Stinson. Combinatorial solutions providing improved security for the generalized Russian cards problem. Designs, Codes and Cryptography 72 (2014), 345-367.
  6. D. R. Stinson and J. Upadhyay. Is extracting data the same as possessing data? Journal of Mathematical Cryptology 8 (2014), 189-207.
  7. K. Henry, M. B. Paterson and D. R. Stinson. Practical approaches to varying network size in combinatorial key predistribution schemes. Lecture Notes in Computer Science 8282 (2014), 89-117. (SAC 2013 Proceedings.)
  8. M. Nojoumian and D. R. Stinson. Efficient sealed-bid auction protocols using verifiable secret sharing. Lecture Notes in Computer Science 8434 (2014), 302-317. (10th International Conference on Information Security Practice and Experience, ISPEC 2014.)

Papers Published in 2013

  1. D. R. Stinson. Nonincident points and blocks in designs. Discrete Mathematics 313 (2013), 447-452.
  2. M. Nojoumian and D. R. Stinson. On dealer-free dynamic threshold schemes. Advances in Mathematics of Communications 7 (2013), 39-56.
  3. M. B. Paterson and D. R. Stinson. A simplified combinatorial treatment of constructions and threshold gaps of ramp schemes. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences 5 (2013), 229-240.
  4. M. B. Paterson, D. R. Stinson and J. Upadhyay. A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage. Journal of Mathematical Cryptology 7 (2013), 183-216.

Papers Published in 2012

  1. J. H. Dinitz, P. R. J. Ostergard and D. R. Stinson. Packing Costas arrays. J. Combin. Math. Combin. Comput. 80 (2012), 385-403.
  2. S. R. Blackburn, D. R. Stinson and J. Upadhyay. On the complexity of the herding attack and some related attacks on hash functions. Designs, Codes and Cryptography 64 (2012), 171-193.
  3. J. H. Dinitz, M. B. Paterson, D. R. Stinson and R. Wei. Constructions for retransmission permutation arrays. Designs, Codes and Cryptography 65 (2012), 325-351.
  4. M. Nojoumian and D. R. Stinson. Social secret sharing in cloud computing using a new trust function. Tenth Annual Conference on Privacy, Security and Trust (PST 2012), pp. 161-167.
  5. M. Nojoumian and D. R. Stinson. Socio-rational secret sharing as a new direction in rational cryptography. Lecture Notes in Computer Science 7638 (2012), 18-37 (Conference on Decision and Game Theory for Security, GameSec 2012).
  6. C. M. Swanson and D. R. Stinson. Extended combinatorial constructions for peer-to-peer user-private information retrieval. Advances in Mathematics of Communications 6 (2012), 479-497.

Papers Published in 2011

  1. K. M. Martin, M. B. Paterson and D. R. Stinson. Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences 3 (2011), 65-86.
  2. K. Henry and D. R. Stinson. Secure network discovery in wireless sensor networks using combinatorial key pre-distribution. 2011 IEEE Workshop on Lightweight Security & Privacy: Devices, Protocols and Applications (LightSec 2011), pp. 34-43.
  3. C. Swanson and D. R. Stinson. Unconditionally secure signature schemes revisited. Lecture Notes in Computer Science 6673 (2011), 100-116. (ICITS 2011 Proceedings.)
  4. S. R. Blackburn, M. Paterson and D. R. Stinson. Putting dots in triangles. J. Combin. Math. Combin. Comput. 78 (2011), 23-32.
  5. G. M. Zaverucha and D. R. Stinson. Short one-time signatures. Advances in Mathematics of Communications 5 (2011), 473-488.
  6. J. Wu and D. R. Stinson. Three improved algorithms for multipath key establishment in sensor networks using protocols for secure message transmission. IEEE Transactions on Dependable and Secure Computing 8 (2011), 929-937.
  7. R. C.-W. Phan, J. Wu, K. Ouafi and D. R. Stinson. Privacy analysis of forward and backward untraceable RFID identification schemes. Wireless Personal Communications 61 (2011), 69-81.

Papers Published in 2010

  1. A. Mashatan and D.R. Stinson. Practical unconditionally secure two-channel message authentication. Designs, Codes and Cryptography 55 (2010), 169-188.
  2. M.B. Paterson and D.R. Stinson. Yet another hat game. Electronic Journal of Combinatorics 17(1) (2010), #R86, 12 pp.
  3. G.M. Zaverucha and D.R. Stinson. Anonymity in shared symmetric key primitives. Designs, Codes and Cryptography 57 (2010), 139-160.
  4. K.M. Martin, M.B. Paterson and D.R. Stinson. Key predistribution for homogeneous wireless sensor networks with group deployment of nodes. ACM Transactions on Sensor Networks 7-2 (2010), article No. 11, 27 pp.
  5. S.R. Blackburn, A. Panoui, M.B. Paterson and D.R. Stinson. Honeycomb arrays. Electronic Journal of Combinatorics 17(1) (2010), #R172, 10 pp.
  6. M. Nojoumian, D.R. Stinson and M. Grainger. Unconditionally secure social secret sharing scheme. IET Information Security 4 (2010), 202-211.
  7. I. Goldberg, A. Mashatan and D. R. Stinson. On message recognition protocols: recoverability and explicit confirmation. International Journal of Applied Cryptography 2 (2010), 100-120.
  8. G. M. Zaverucha and D. R. Stinson. Group testing and batch verification. Lecture Notes in Computer Science 5973 (2010), 140-157. (ICITS 2010 Proceedings.)
  9. M. Nojoumian and D.R. Stinson. Unconditionally secure first-price auction protocols using a multicomponent commitment scheme. Lecture Notes in Computer Science 6476 (2010), 266-280. (ICICS 2010 Proceedings.)

Papers Published in 2009

  1. A. Mashatan and D.R. Stinson. Interactive two-channel message authentication based on interactive-collision resistant hash functions. International Journal of Information Security 8 (2009), 49-60.
  2. M.B. Paterson, D.R. Stinson and R. Wei. Combinatorial batch codes. Advances in Mathematics of Communications 3 (2009), 13-27.
  3. J. Sui and D.R. Stinson. A critical analysis and improvement of AACS drive-host authentication. International Journal of Applied Cryptography 1 (2009), 169-180.
  4. H. Cao, J. Dinitz, D. Kreher, D.R. Stinson and R. Wei. On orthogonal generalized equitable rectangles. Designs, Codes and Cryptography 51 (2009), 225-230.
  5. K. Henry, D.R. Stinson and J. Sui. The effectiveness of receipt-based attacks on ThreeBallot. IEEE Transactions on Information Forensics 4 (2009), 699-707.
  6. J. Wu and D.R. Stinson. An efficient identification protocol secure against concurrent-reset attacks. Journal of Mathematical Cryptology 3 (2009), 339-352.
  7. J. Wu and D.R. Stinson. How to improve security and reduce hardware demands of the WIPR RFID protocol. 2009 IEEE International Conference on RFID, pp. 192-199.
  8. I. Goldberg, A. Mashatan and D.R. Stinson. A new message recognition protocol with self-recoverability for ad hoc pervasive networks. Lecture Notes in Computer Science 5336 (2009), 219-237. (7th International Conference on Applied Cryptography and Network Security, ACNS '09.)
  9. J. Wu and D.R. Stinson. A highly scalable RFID authentication protocol. Lecture Notes in Computer Science 5594 (2009), 360-376. (14th Australasian Conference on Information Security and Privacy, ACISP '09).

Papers Published in 2008

  1. D.R. Stinson, R. Wei and K. Chen. On generalized separating hash families. JCT A 115 (2008), 105-120.
  2. J. Lee and D.R. Stinson. On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. TISSEC 11 (2008), article 5, 35 pp.
  3. D.R. Stinson and G.M. Zaverucha. Some improved bounds for secure frameproof codes and related separating hash families. IEEE Transactions on Information Theory 54 (2008), 2508-2514.
  4. S.R. Blackburn, T. Etzion, D.R. Stinson and G.M. Zaverucha. A bound on the size of separating hash families. JCT A 115 (2008), 1246-1256.
  5. M.B. Paterson and D.R. Stinson. Two attacks on a sensor network key distribution scheme of Cheng and Agrawal. Journal of Mathematical Cryptology 2 (2008), 393-403.
  6. J. Wu and D.R. Stinson. Minimum node degree and κ-connectivity for key predistribution schemes and distributed sensor networks. Proceedings of the First ACM Conference on Wireless Network Security (WiSec 2008), pp. 119-124.
  7. J. Sui and D.R. Stinson. A critical analysis and improvement of AACS drive-host authentication. Lecture Notes in Computer Science 5107 (2008), 37-52. (ACISP 2008 Proceedings).
  8. S.R. Blackburn, K.M. Martin, M.B. Paterson and D.R. Stinson. Key refreshing in wireless sensor networks. Lecture Notes in Computer Science 5155 (2008), 156-170. (ICITS 2008 Proceedings.)
  9. J. Wu and D.R. Stinson. Authorship proof for textual document. Lecture Notes in Computer Science 5284 (2008), 209-223. (Information Hiding 2008.)
  10. K. Gopalakrishnan and D.R. Stinson. Applications of orthogonal arrays to computer science. Lecture Notes Series in Mathematics (Ramanujan Mathematical Society) 7 (2008), 149-164. (International Conference on Discrete Mathematics, ICDM 2006.)
  11. A. Mashatan and D.R. Stinson. A new message recognition protocol for ad hoc pervasive networks. Lecture Notes in Computer Science 5339 (2008), 378-394. (Seventh International Conference on Cryptology and Network Security, CANS 2008.)

Papers Published in 2007

  1. D. Deng, D.R. Stinson, P.C. Li, G.H.J. van Rees and R. Wei. Constructions and bounds for splitting systems. Discrete Mathematics 307 (2007), 18-37.
  2. B. Sunar, W.J. Martin and D.R. Stinson. A provably secure true random number generator with built-in tolerance to active attacks. IEEE Transactions on Computers 56 (2007), 109-119
  3. M. Nandi and D.R. Stinson. Multicollision attacks on some generalized sequential hash functions. IEEE Transactions on Information Theory 53 (2007), 759-767.
  4. J. Dinitz, A. Ling and D.R. Stinson. Perfect hash families from transversal designs. Australasian Journal of Combinatorics 37 (2007), 233-242.
  5. D.R. Stinson and R. Wei. Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols. Journal of Mathematical Cryptology 1 (2007), 33-46.
  6. D.R. Stinson. Unconditionally secure chaffing and winnowing with short authentication tags. Advances in Mathematics of Communication. 1 (2007), 269-280.
  7. D.R. Stinson and S. Zhang. Algorithms for detecting cheaters in threshold schemes J. Combin. Math. Combin. Comput. 61 (2007), 169-191.
  8. C. Blundo, P. D'Arco, A. De Santis and D.R. Stinson. On unconditionally secure distributed oblivious transfer. Journal of Cryptology 20 (2007), 323-373.
  9. D.R. Stinson and J. Wu. An efficient and secure two-flow zero-knowledge identification protocol. Journal of Mathematical Cryptology 1 (2007), 201-220.
  10. A. Mashatan and D.R. Stinson. Noninteractive two-channel message authentication based on hybrid-collision resistant hash functions. IET Information Security 1 (2007), 111-118.
  11. D.R. Stinson. Generalized mix functions and orthogonal equitable rectangles. Designs, Codes and Cryptography 45 (2007), 347-357.
  12. Chapters in the Handbook of Combinatorial Designs, Second Edition, CRC Press, Inc., 2007:
    1. Bent functions, pp. 337-339.
    2. Correlation-immune and resilient functions, coauthored with K. Gopalakrishnan, pp. 355-357.
    3. Coverings, coauthored with D.M. Gordon, pp. 365-373.
    4. Derandomization, coauthored with K. Gopalakrishnan, pp. 389-391.
    5. Packings, coauthored with R. Wei and J. Yin, pp. 550-556.
    6. Secrecy and authentication codes, coauthored with K. Gopalakrishnan, pp. 606-611.
    7. Threshold and ramp schemes, coauthored with K. Gopalakrishnan, pp. 635-639.

Papers Published in 2006

  1. J.A. Muir and D.R. Stinson. Minimality and other properties of the width-w nonadjacent form. Mathematics of Computation 75 (2006), 369-384.
  2. P. D'Arco, W. Kishimoto and D.R. Stinson. Properties and constraints of cheating-immune secret sharing schemes. Discrete Applied Mathematics 154 (2006), 219-233.
  3. D.R. Stinson. Some observations on the theory of cryptographic hash functions. Designs, Codes and Cryptography 38 (2006), 259-277.
  4. K. Khoo, G. Gong and D.R. Stinson. A new characterization of bent and semi-bent functions on finite fields. Designs, Codes and Cryptography 38 (2006), 279-295.
  5. J.A. Muir and D.R. Stinson. On the low hamming weight discrete logarithm problem for nonadjacent representations. Applicable Algebra in Engineering, Communication and Computing 16 (2006), 461-472.
  6. W. Ogata, K. Kurosawa and D.R. Stinson. Optimum secret sharing scheme secure against cheating. SIAM Journal on Discrete Mathematics 20 (2006), 79-95.
  7. J. Lee and D.R. Stinson. Common intersection designs. Journal of Combinatorial Designs 14 (2006), 251-269.
  8. J.H. Dinitz, A. Ling and D.R. Stinson. Fault tolerant routings with minimum optical index. Networks 48 (2006), 47-55.
  9. J. Lee and D.R. Stinson. Tree-based key distribution patterns. Lecture Notes in Computer Science 3897 (2006), 189-204. (SAC 2005 Proceedings.)
  10. P. C. Li, D. R. Stinson, G. H. J. van Rees and R. Wei. On {123, 124, 134}-free hypergraphs. Congressus Numerantium 183 (2006), 161-174. (Thirty-seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, 2006.)

Papers Published in 2005

  1. J.H. Dinitz and D.R. Stinson. On the maximum number of different ordered pairs of symbols in sets of latin squares. Journal of Combinatorial Designs 13 (2005), 1-15.
  2. J.H. Dinitz, P. Dukes and D.R. Stinson. Sequentially perfect and uniform one-factorizations of the complete graph. Electronic Journal of Combinatorics 12 (2005), #R1, 12pp.
  3. J.H. Dinitz and D.R. Stinson. On assigning referees to tournament schedules Bulletin of the ICA 44 (2005), 22-28.
  4. J.A. Muir and D.R. Stinson. Alternative digit sets for nonadjacent representations. SIAM J. on Discrete Math. 19 (2005), 165-191.
  5. K.A. Lauinger, D.L. Kreher, R.S. Rees and D.R. Stinson. Computing transverse t-designs. J. Combin. Math. Combin. Comput. 54 (2005), 33-56.
  6. J. Lee and D.R. Stinson. Deterministic key predistribution schemes for distributed sensor networks. Lecture Notes in Computer Science 3357 (2005), 294-307. (SAC 2004 Proceedings.)
  7. J.A. Muir and D.R. Stinson. New minimal weight representations for left-to-right window methods. Lecture Notes in Computer Science 3376 (2005), 366-383. (CT-RSA 2005 Proceedings.)
  8. J. Lee and D.R. Stinson. A combinatorial approach to key predistribution for distributed sensor networks . IEEE Wireless Communications and Networking Conference (WCNC 2005), vol. 2, pp. 1200-1205.

Papers Published in 2004

  1. D.R. Stinson and R. Wei. Generalized cover-free families. Discrete Mathematics 279 (2004), 463-477.
  2. W. Ogata, K. Kurosawa, D.R. Stinson and H. Saido. New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discrete Mathematics 279 (2004), 383-405.
  3. D.R. Stinson. Attack on a concast signature scheme. Information Processing Letters 91 (2004), 39-41.
  4. D. Deng, D.R. Stinson and R. Wei. The Lovasz local lemma and its applications to some combinatorial arrays. Designs, Codes and Cryptography 32 (2004), 121-134.
  5. J.A. Muir and D.R. Stinson. Alternative digit sets for nonadjacent representations. Lecture Notes in Computer Science 3006 (2004), 306-319. (SAC 2003 Proceedings.)

Papers Published in 2003

  1. M. Chateauneuf, A.C.H. Ling and D.R. Stinson. Slope packings and coverings, and generic algorithms for the discrete logarithm problem. Journal of Combinatorial Designs 11 (2003), 36-50.
  2. C. Blundo, P. D'Arco, A. De Santis and D.R. Stinson. Contrast optimal threshold visual cryptography schemes. SIAM J. on Discrete Math. 16 (2003), 224-261.
  3. C. Blundo, P. D'Arco, A. De Santis and D.R. Stinson. New results on unconditionally secure distributed oblivious transfer: extended abstract. Lecture Notes in Computer Science 2595 (2003), 291-309. (SAC 2002 Proceedings.)
  4. P. D'Arco and D.R. Stinson. Fault tolerant and distributed broadcast encryption. Lecture Notes in Computer Science 2612 (2003), 263-280. (Topics in Cryptography, CT-RSA 2003.)

Papers Published in 2002

  1. D.R. Stinson. Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Mathematics of Computation 71 (2002), 379-391.
  2. P.A. Eisen and D.R. Stinson. Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels. Designs, Codes and Cryptography 25 (2002), 15-61.
  3. C.J. Colbourn, D.L. Kreher, J.P. McSorley and D.R. Stinson. Orthogonal arrays of strength three from regular 3-wise balanced designs. Journal of Statistical Planning and Inference 100 (2002), 191-195.
  4. C. Blundo, B. Masucci, D.R. Stinson and R. Wei. Constructions and bounds for unconditionally secure non-interactive commitment schemes. Designs, Codes and Cryptography 26 (2002), 97-110.
  5. S.S. Magliveras, D.R. Stinson and Tran van Trung. New approaches to designing public key cryptosystems using one-way functions and trap-doors in finite groups. Journal of Cryptology 15 (2002), 285-297.
  6. D.R. Stinson. Universal hash families and the leftover hash lemma, and applications to cryptography and computing. J. Combin. Math. Combin. Comput. 42 (2002), 3-31.
  7. P. D'Arco and D.R. Stinson. On unconditionally secure robust distributed key distribution centers. Lecture Notes in Computer Science 2501 (2002), 346-363. (ASIACRYPT 2002 Proceedings.)
  8. J.H. Dinitz and D.R. Stinson. A singular direct product for bicolorable Steiner triple systems. In Codes and Designs, Walter de Gruyter, 2002, pages 87-97 (Ohio State University Mathematical Research Institute Publications, volume 10).
  9. M. Qu, D. Stinson and S. Vanstone. Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based key distribution system over elliptic curves. In Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, Springer-Verlag, 2002, pp. 263-269. (Sixth International Conference on Finite Fields and Applications.)

Papers Published in 2001

  1. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson. Extended capabilities for visual cryptography. Theoretical Computer Science 250 (2001), 143-161.
  2. D. R. Stinson. Something about all or nothing (transforms). Designs, Codes and Cryptography 22 (2001), 133-138.
  3. J. N. Staddon, D.R. Stinson and R. Wei. Combinatorial properties of frameproof and traceability codes. IEEE Transactions on Information Theory 47 (2001), 1042-1049.
  4. C. J. Colbourn, J. H. Dinitz and D. R. Stinson. Quorum systems constructed from combinatorial designs. Information and Computation 169 (2001), 160-173.
  5. K. Kurosawa, T. Johansson and D. R. Stinson. Almost k-wise independent sample spaces and their cryptologic applications. Journal of Cryptology 14 (2001), 231-253.
  6. B. Masucci and D. R. Stinson. Efficient metering schemes with pricing. IEEE Transactions on Information Theory 47 (2001), 2835-2844.
  7. C. Blundo, A. De Bonis, B. Masucci and D. R. Stinson. Dynamic multi-threshold metering schemes. Lecture Notes in Computer Science 2012 (2001), 130-143. (SAC 2000.)
  8. D. R. Stinson and R. Strobl. Provably secure distributed Schnorr signatures and a (t, n) threshold scheme for implicit certificates. Lecture Notes in Computer Science 2119 (2001), 417-434. (Sixth Australasian Conference on Information Security and Privacy, ACISP 2001.)
  9. P. Sarkar and D. R. Stinson. Frameproof and IPP codes. Lecture Notes in Computer Science 2247 (2001), 117-126. (INDOCRYPT 2001.)
  10. P. D'Arco and D. R. Stinson. Generalized zig-zag functions and oblivious transfer reductions. Lecture Notes in Computer Science 2259 (2001), 87-102. (Selected Areas in Cryptography, 2001.)

Papers Published in 2000

  1. D. R. Stinson, Tran van Trung and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference. 86 (2000), 595-617.
  2. D. R. Stinson, R. Wei and L. Zhu. New constructions for perfect hash families and related structures using combinatorial designs and codes. J. Combin. Designs 8 (2000), 189-200.
  3. D. R. Stinson, R. Wei and L. Zhu. Some new bounds for cover-free families. J. Combin. Theory A. 90 (2000), 224-234.
  4. D. L. Kreher and D. R. Stinson. Pseudocode: a LaTeX style file for displaying algorithms. Bulletin of the ICA 30 (2000), 11-24.
  5. M. Atici, D. R. Stinson and R. Wei. A new practical algorithm for the construction of a perfect hash function. J. Combin. Math. Combin. Comput. 35 (2000), 127-145.
  6. G. Gong, T. A. Berson and D. R. Stinson. Elliptic curve pseudorandom sequence generators. Lecture Notes in Computer Science 1758 (2000), 34-48. (SAC '99 Proceedings.)
  7. D. R. Stinson and R. Wei. Unconditionally secure proactive secret sharing scheme with combinatorial structure. Lecture Notes in Computer Science 1758 (2000), 200-214. (SAC '99 Proceedings.)
  8. B. Masucci and D. R. Stinson. Metering schemes for general access structures. Lecture Notes in Computer Science 1895 (2000), 72-87. (Sixth European Symposium on Research in Computer Security, ESORICS 2000.)

Papers Published in 1999

  1. D. R. Stinson. Some results on nonlinear zigzag functions. J. Combin. Math. Combin. Comput. 29 (1999), 127-138.
  2. C. Blundo, A. De Santis and D. R. Stinson. On the contrast in visual cryptography schemes. Journal of Cryptology 12 (1999), 261-289.
  3. W. J. Martin and D. R. Stinson. A generalized Rao bound for ordered orthogonal arrays and (t, m, s)-nets. Canadian Mathematical Bulletin 42 (1999), 359-370.
  4. W. J. Martin and D. R. Stinson. Association schemes for ordered orthogonal arrays and (T, M, S)-nets. Canadian Journal of Mathematics 51 (1999), 326-346.
  5. D. R. Stinson and R. Wei. An application of ramp schemes to broadcast encryption. Information Processing Letters 69 (1999), 131-135.
  6. R. Rees, D. R. Stinson, R. Wei and G. H. J. van Rees. An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme. Ars Combinatoria 53 (1999), 225-237.
  7. C. J. Colbourn, J. H. Dinitz and D. R. Stinson. Applications of combinatorial designs to communications, cryptography and networking. In "Surveys in Combinatorics, 1999", Cambridge University Press, 1999, pp. 37-100 (London Mathematical Lecture Note Series, vol. 267).
  8. D. R. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. Lecture Notes in Computer Science 1556 (1999), 144-156. (SAC '98 Proceedings.)

Papers Published in 1998

  1. C. Blundo, L. Frota Mattos and D. R. Stinson. Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. Theoretical Computer Science 200 (1998), 313-334.
  2. D. R. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal on Discrete Mathematics 11 (1998), 41-53.
  3. J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson. A note on the duality of linear programming bounds for orthogonal arrays and codes. Bulletin of the ICA 22 (1998), 17-24.
  4. K. Kurosawa, K. Okada, H. Saido, and D. R. Stinson. New combinatorial bounds for authentication codes and key predistribution schemes. Designs, Codes and Cryptography 15 (1998), 87-100.
  5. D. R. Stinson and Tran van Trung. Some new results on key distribution patterns and broadcast encryption. Designs, Codes and Cryptography 14 (1998), 261-279.

Papers Published in 1997

  1. C. Blundo, A. Giorgio Gaggia and D. R. Stinson. On the dealer's randomness required in secret sharing schemes. Designs, Codes and Cryptography 11 (1997), 235-259.
  2. D. L. Kreher and D. R. Stinson. Small group divisible designs with block size four. Journal of Statistical Planning and Inference 58 (1997), 111-118.
  3. C. J. Colbourn, D. R. Stinson and L. Zhu. More frames with block size four. J. Combin. Math. Combin. Comput. 23 (1997), 3-19.
  4. C. Blundo and D. R. Stinson. Anonymous secret sharing schemes. Discrete Applied Mathematics 77 (1997), 13-28.
  5. D. R. Stinson. On some methods for unconditionally secure key distribution and broadcast encryption. Designs, Codes and Cryptography 12 (1997), 215-243.
  6. D. L. Kreher, D. R. Stinson and L. Zhu. On the maximum number of fixed points in automorphisms of prime order of 2-(v, k, 1) designs. Annals of Combinatorics 1 (1997), 227-243.
  7. K. Kurosawa, T. Johansson and D. R. Stinson. Almost k-wise independent sample spaces and their cryptologic applications. Lecture Notes in Computer Science 1233 (1997), 409-421. (Advances in Cryptology — EUROCRYPT '97.)

Papers Published in 1996

  1. R. S. Rees and D. R. Stinson. Combinatorial characterizations of authentication codes II. Designs, Codes and Cryptography 7 (1996), 239-259.
  2. J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson. Orthogonal arrays, resilient functions, error-correcting codes and linear programming bounds. SIAM Journal on Discrete Mathematics 9 (1996), 424-452.
  3. M. Atici, S. S. Magliveras, D. R. Stinson and W.-D. Wei. Some recursive constructions for perfect hash families. J. Combin. Designs 4 (1996), 353-363.
  4. K. Gopalakrishnan and D. R. Stinson. A short proof of the non-existence of certain cryptographic functions. J. Combin. Math. Combin. Comput. 20 (1996), 129-137.
  5. C. J. Colbourn, J. H. Dinitz and D. R. Stinson. More on thwarts in transversal designs. Finite Fields and Their Applications 2 (1996), 293-303.
  6. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson. Visual cryptography for general access structures. Information and Computation 129 (1996), 86-106.
  7. K. Gopalakrishnan and D. R. Stinson. A simple analysis of the error probability of two-point based sampling. Information Processing Letters 60 (1996), 91-96.
  8. G. Ateniese, C. Blundo, A. De Santis and D. R. Stinson. Constructions and bounds for visual cryptography. Lecture Notes in Computer Science 1099 (1996), 416-428. (23rd International Colloquium on Automata, Languages and Programming.)
  9. M. Atici and D. R. Stinson. Universal hashing and multiple authentication. Lecture Notes in Computer Science 1109 (1996), 16-30. (Advances in Cryptology — CRYPTO '96.)
  10. C. Blundo, L. Frota Mattos and D. R. Stinson. Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution. Lecture Notes in Computer Science 1109 (1996), 387-400. (Advances in Cryptology — CRYPTO '96.)
  11. D. R. Stinson. On the connections between universal hashing, combinatorial designs and error-correcting codes. Congressus Numerantium 114 (1996), 7-27 (Twenty-fifth Manitoba Conference on Combinatorial Mathematics and Computing, 1995.)
  12. Chapters in the Handbook of Combinatorial Designs, CRC Press, Inc., 1996:
    1. Coverings, pp. 260-265.
    2. Packings, pp. 409-413.
    3. Applications of designs to cryptography, coauthored with K. Gopalakrishnan, pp. 549-557.
    4. Derandomization, coauthored with K. Gopalakrishnan, pp. 558-560.

Papers Published in 1995

  1. C. Blundo, L. Frota Mattos and D. R. Stinson. Multiple key distribution maintaining user anonymity via broadcast channels. Journal of Computer Security 3 (1994/95), 309-323.
  2. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro. Graph decompositions and secret sharing schemes. Journal of Cryptology 8 (1995), 39-64.
  3. D. R. Stinson and J. L. Massey. An infinite class of counterexamples to a conjecture concerning non-linear resilient functions. Journal of Cryptology 8 (1995), 167-173.
  4. K. Gopalakrishnan and D. R. Stinson. Three characterizations of non-binary correlation-immune and resilient functions. Designs, Codes and Cryptography 5 (1995), 241-251.
  5. C. Blundo, A. Giorgio Gaggia and D. R. Stinson. On the dealer's randomness required in secret sharing schemes. Lecture Notes in Computer Science 950 (1995), 35-46 (Advances in Cryptology — EUROCRYPT '94.)

Papers Published in 1994

  1. D. R. Stinson. Decomposition constructions for secret sharing schemes. IEEE Transactions on Information Theory 40 (1994), 118-125.
  2. D. R. Stinson and L. Zhu. On the existence of certain SOLS with holes. J. Combin. Math. Combin. Comput. 15 (1994), 33-45.
  3. D. R. Stinson. Combinatorial techniques for universal hashing. Journal of Computer and System Sciences 48 (1994), 337-346.
  4. D. R. Stinson. Universal hashing and authentication codes. Designs, Codes and Cryptography 4 (1994), 369-380.
  5. J. H. Dinitz, D. R. Stinson and L. Zhu. On the spectra of certain classes of Room frames. Electronic Journal of Combinatorics 1 (1994), paper #R7, 21pp.
  6. J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson. Bounds for resilient functions and orthogonal arrays. Lecture Notes in Computer Science 839 (1994), 247-256. (Advances in Cryptology — CRYPTO '94.)

Papers Published in 1993

  1. D. Chen and D. R. Stinson. On the construction of large sets of disjoint group-divisible designs. Ars Combinatoria 35 (1993), 103-115.
  2. S. A. Vanstone, D. R. Stinson, P. J. Schellenberg, A. Rosa, R. Rees, C. J. Colbourn, M. Carter, and J. Carter. Hanani triple systems. Israel Journal of Mathematics 83 (1993), 305-319.
  3. D. R. Stinson. An explicit formulation of the second Johnson bound. Bulletin of the ICA 8 (1993), 86-92.
  4. D. R. Stinson and L. Zhu. Towards the spectrum of Room squares with subsquares. Journal of Combinatorial Theory A 63 (1993), 129-142.
  5. A. M. Hamel, W. H. Mills, R. C. Mullin, R. Rees, D. R. Stinson, and J. Yin. The spectrum of PBD({5, k*}, v) for k = 9, 13. Ars Combinatoria 36 (1993), 7-26.
  6. K. Gopalakrishnan, D. G. Hoffman and D. R. Stinson. A note on a conjecture concerning symmetric resilient functions. Information Processing Letters 47 (1993), 139-143.
  7. D. R. Stinson. Resilient functions and large sets of orthogonal arrays. Congressus Numerantium 92 (1993), 105-110. (Twenty-second Manitoba Conference on Numerical Mathematics and Computing, 1992.)
  8. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro. Graph decompositions and secret sharing schemes. Lecture Notes in Computer Science 658 (1993), 1-24. (Advances in Cryptology — EUROCRYPT '92.)
  9. D. R. Stinson. New general lower bounds on the information rate of secret sharing schemes. Lecture Notes in Computer Science 740 (1993), 170-184. (Advances in Cryptology — CRYPTO '92.)
  10. J. H. Dinitz and D. R. Stinson. A few more Room frames. In "Graphs, Matrices and Designs", Marcel Dekker, Inc., 1993, pp. 133-146.
  11. D. R. Stinson. Combinatorial designs and cryptography. In "Surveys in Combinatorics, 1993", Cambridge University Press, 1993, pp. 257-287 (London Mathematical Lecture Note Series, vol. 187).

Papers Published in 1992

  1. R. Rees and D. R. Stinson. Frames with block size four. Canadian Journal of Mathematics 44 (1992), 1030-1049.
  2. C. J. Colbourn, D. R. Stinson, and L. Teirlinck. A parallelization of Miller's nlog n technique. Information Processing Letters 42 (1992), 223-228.
  3. D. R. Stinson and Y. J. Wei. Some results on quadrilaterals in Steiner triple systems. Discrete Mathematics 105 (1992), 207-219.
  4. D. Chen, C. C. Lindner, and D. R. Stinson. Further results on large sets of disjoint group-divisible designs. Discrete Mathematics 110 (1992), 35-42.
  5. E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. Journal of Cryptology 5 (1992), 153-166.
  6. D. R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography 2 (1992), 357-390.
  7. C. J. Colbourn, S. S. Magliveras, and D. R. Stinson. Steiner triple systems of order 19 with nontrivial automorphism group. Mathematics of Computation 59 (1992), 283-295.
  8. C. A. Rodger and D. R. Stinson. Nesting directed cycle systems of even length. European Journal of Combinatorics 13 (1992), 213-218.
  9. D. R. Stinson. Combinatorial characterizations of authentication codes. Designs, Codes and Cryptography 2 (1992), 175-187.
  10. D. R. Stinson. Combinatorial characterizations of authentication codes. Lecture Notes in Computer Science 576 (1992), 62-73. (Advances in Cryptology — CRYPTO '91.)
  11. D. R. Stinson. Universal hashing and authentication codes. Lecture Notes in Computer Science 576 (1992), 74-85. (Advances in Cryptology — CRYPTO '91.)
  12. J. H. Dinitz and D. R. Stinson. A brief introduction to design theory. In "Contemporary Design Theory — A Collection of Surveys", John Wiley & Sons, Inc., 1992, pp. 1-12.
  13. J. H. Dinitz and D. R. Stinson. A survey of Room squares and related designs. In "Contemporary Design Theory — A Collection of Surveys", John Wiley & Sons, Inc., 1992, pp. 137-204.

Papers Published in 1991

  1. E. F. Brickell and D. R. Stinson. The detection of cheaters in threshold schemes. SIAM Journal on Discrete Mathematics 4(1991), 502-510.
  2. E. S. Kramer, S. S. Magliveras, and D. R. Stinson. Some small large sets of t-designs. Australasian Journal of Combinatorics 3(1991), 191-205.
  3. D. R. Stinson and L. Zhu. Orthogonal Steiner triple systems of order 6m + 3. Ars Combinatoria 31(1991), 33-63.
  4. C. J. Colbourn, J. H. Dinitz, and D. R. Stinson. Spanning sets and scattering sets in Steiner triple systems. Journal of Combinatorial Theory A 57(1991), 46-59.
  5. C. J. Colbourn, A. Rosa, and D. R. Stinson. Pairwise balanced designs with block sizes 3 and 4. Canadian Journal of Mathematics 43 (1991), 673-704.
  6. D. R. Stinson and L. Zhu. On the existence of three MOLS with equal-sized holes. Australasian Journal of Combinatorics 4(1991), 33-47.
  7. D. R. Stinson. A survey of Kirkman triple systems and related designs. Discrete Mathematics 92(1991), 371-393.
  8. D. Chen, R. G. Stanton, and D. R. Stinson. Disjoint packings on 6k+5 points. Utilitas Mathematica 40(1991), 129-138.
  9. D. R. Stinson. Designs constructed from maximal arcs. Discrete Mathematics 97(1991), 387-393.
  10. D. R. Stinson. On bit serial multiplication and dual bases in GF(2m). IEEE Transactions on Information Theory 37(1991), 1733-1736.
  11. C. C. Lindner, C. A. Rodger, and D. R. Stinson. Nestings of directed cycle systems. Ars Combinatoria 32(1991), 153-159.
  12. R. C. Mullin, D. R. Stinson, and W. D. Wallis. Sets of properly separated permutations. Congressus Numerantium 80(1991), 185-191. (Twentieth Manitoba Conference on Numerical Mathematics and Computing, 1990.)
  13. E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. Lecture Notes in Computer Science 537(1991), 242-252. (Advances in Cryptology — CRYPTO '90.)

Papers Published in 1990

  1. D. R. Stinson and L. Teirlinck. A construction for authentication/secrecy codes from 3-homogeneous permutation groups. European Journal of Combinatorics 11(1990), 73-79.
  2. D. Chen and D. R. Stinson. Recent results on combinatorial constructions for threshold schemes. Australasian Journal of Combinatorics 1(1990), 29-48.
  3. C. C. Lindner, C. A. Rodger, and D. R. Stinson. Small embeddings for partial cycle systems of odd length. Discrete Mathematics 80(1990), 273-280.
  4. D. R. Stinson. The combinatorics of authentication and secrecy codes. Journal of Cryptology 2(1990), 23-49.
  5. C. C. Lindner and D. R. Stinson. Nesting of cycle systems of even length. J. Combin. Math. Combin. Comput. 8(1990), 147-157.
  6. D. R. Stinson. Some observations on parallel algorithms for fast exponentiation in GF(2n). SIAM Journal on Computing 19(1990), 711-717.
  7. R. Rees and D. R. Stinson. On the number of blocks in a perfect covering of v points. Discrete Mathematics 83(1990), 81-93.
  8. R. C. Mullin and D. R. Stinson. Pairwise balanced designs with odd block sizes exceeding 5. Discrete Mathematics 84(1990), 47-62.
  9. E. F. Brickell and D. R. Stinson. The detection of cheaters in threshold schemes. Lecture Notes in Computer Science 403(1990), 564-577. (Advances in Cryptology — CRYPTO '88.)
  10. D. R. Stinson. The construction of nested cycle systems. In "Coding Theory and Design Theory, Part II, Design Theory", Springer-Verlag, 1990, pp. 362-367. (IMA Volumes in Mathematics and its Applications, vol. 21.)
  11. J. H. Dinitz and D. R. Stinson. On the existence of Room squares with subsquares. In "Finite Geometries and Combinatorial Designs", American Mathematical Society, 1990, pp. 73-91. (Contemporary Mathematics, vol. 111.)

Papers Published in 1989

  1. R. Rees and D. R. Stinson. On the existence of Kirkman triple systems containing Kirkman subsytems. Ars Combinatoria 26 (1989), 3-16.
  2. R. Rees and D. R. Stinson. On the existence of incomplete designs of block size four having one hole. Utilitas Mathematica 35 (1989), 119-152.
  3. P. J. Schellenberg and D. R. Stinson. Threshold schemes from combinatorial designs. J. Combin. Math. Combin. Comput. 5 (1989), 143-160.
  4. D. R. Stinson. A new proof of the Doyen-Wilson theorem. Australasian Journal of Combinatorics 47 (1989), 32-42.
  5. B. Alspach, P. Schellenberg, D. R. Stinson, and D. Wagner. The Oberwolfach problem and factors of uniform odd length cycles. Journal of Combinatorial Theory A 52 (1989), 20-43.
  6. J. H. Dinitz and D. R. Stinson. Some new perfect one-factorizations from starters in finite fields. Journal of Graph Theory 13 (1989), 405-415.
  7. K. T. Phelps, D. R. Stinson, and S. A. Vanstone. The existence of simple S3(3, 4, v). Discrete Mathematics 77 (1989), 255--258.
  8. C. C. Lindner, C. A. Rodger, and D. R. Stinson. Nesting of cycle systems of odd length. Discrete Mathematics 77 (1989), 191--203.
  9. R. Rees and D. R. Stinson. On combinatorial designs with subdesigns. Discrete Mathematics 77 (1989), 259--279.
  10. E. S. Kramer, D. L. Kreher, R. Rees, and D. R. Stinson. On perpendicular arrays with t3. Ars Combinatoria 28 (1989), 215-223.
  11. E. Seah and D. R. Stinson. A perfect one-factorization for K40. Congressus Numerantium 68 (1989), 211-214. (Eighteenth Manitoba Conference on Numerical Mathematics and Computing, 1988.)

Papers Published in 1988

  1. D. R. Stinson. Some constructions and bounds for authentication codes. Journal of Cryptology 1 (1988), 37-51.
  2. E. Seah and D. R. Stinson. On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groups. Mathematics of Computation 50 (1988), 607-618.
  3. D. R. Stinson. On the spectrum of nested 4-cycle systems. Utilitas Mathematica 33 (1988), 47-50.
  4. D. R. Stinson and S. A. Vanstone. A combinatorial approach to threshold schemes. SIAM Journal on Discrete Mathematics 1 (1988), 230-237.
  5. R. Rees and D. R. Stinson. Kirkman triple systems with maximum subsystems. Ars Combinatoria 25 (1988), 125-132.
  6. C. C. Lindner, C. A. Rodger, and D. R. Stinson. Embedding cycle systems of even length. J. Combin. Math. Combin. Comput. 3 (1988), 65-69.
  7. E. Seah and D. R. Stinson. A perfect one-factorization for K36. Discrete Mathematics 70 (1988), 199-202.
  8. D. R. Stinson. A construction for authentication/secrecy codes from certain combinatorial designs. Journal of Cryptology 1 (1988), 119-127.
  9. C. J. Colbourn and D. R. Stinson. Edge-coloured designs with block size four. Aequationes Mathematicae 36 (1988), 230-245.
  10. D. R. Stinson and S. A. Vanstone. A combinatorial approach to threshold schemes. Lecture Notes in Computer Science 293 (1988), 330-339 (Advances in Cryptology — CRYPTO '87.)
  11. E. F. Brickell and D. R. Stinson. Authentication codes with multiple arbiters. Lecture Notes in Computer Science 330 (1988), 51-55. (Advances in Cryptology — EUROCRYPT '88.)
  12. D. R. Stinson. A construction for authentication/secrecy codes from certain combinatorial designs. Lecture Notes in Computer Science 293 (1988), 355-366 (Advances in Cryptology — CRYPTO '87.)

Papers Published in 1987

  1. R. Rees and D. R. Stinson. On resolvable group-divisible designs with block-size 3. Ars Combinatoria 23 (1987), 107-120.
  2. E. Ihrig, E. Seah, and D. R. Stinson. A perfect one-factorization for K50. J. Combin. Math. Combin. Comput. 1 (1987), 217-219.
  3. E. Seah and D. R. Stinson. An assortment of new Howell designs. Utilitas Mathematica 31 (1987), 175-188.
  4. D. R. Stinson. Frames for Kirkman triple systems. Discrete Mathematics 65 (1987), 289-300.
  5. D. R. Stinson and L. Zhu. On the existence of MOLS with equal-sized holes. Aequationes Mathematicae 33 (1987), 96-105.
  6. J. H. Dinitz and D. R. Stinson. A hill-climbing algorithm for the construction of one-factorizations and Room squares. SIAM Journal on Algebraic and Discrete Methods 8 (1987), 430-438.
  7. R. C. Mullin and D. R. Stinson. Pairwise balanced designs with block sizes 6t+1. Graphs and Combinatorics 3 (1987), 365-377.
  8. A. Assaf, E. Mendelsohn, and D. R. Stinson. On resolvable coverings of pairs by triples. Utilitas Mathematica 32 (1987), 67-74.
  9. D. R. Stinson. On the existence of skew Room frames of type 2n. Ars Combinatoria 24 (1987), 115-128.
  10. D. R. Stinson. Some constructions and bounds for authentication codes. Lecture Notes in Computer Science 263 (1987), 418-425 (Advances in Cryptology — CRYPTO '86.)
  11. E. Seah and D. R. Stinson. Some perfect one-factorizations for K14. In "Combinatorial Design Theory", North-Holland, 1987, pp. 419-436. (Annals of Discrete Mathematics, vol. 34.)
  12. D. R. Stinson and W. D. Wallis. Graphs which are not leaves of maximal partial triple systems. In "Combinatorial Design Theory", North-Holland, 1987, pp. 449-460. (Annals of Discrete Mathematics, vol. 34.)

Papers Published in 1986

  1. D. R. Stinson and E. Seah. 284457 Steiner triple systems of order 19 contain a subsystem of order 9. Mathematics of Computation 46 (1986), 717-729.
  2. A. Rosa and D. R. Stinson. One-factorizations of regular graphs and Howell designs of small order. Utilitas Mathematica 29 (1986), 99-124.
  3. E. Seah and D. R. Stinson. An enumeration of non-isomorphic one-factorizations and Howell designs for the graph K10 minus a one-factor. Ars Combinatoria 21 (1986), 145-161.
  4. C. J. Colbourn, W. L. Kocay, and D. R. Stinson. Some NP-complete problems for hypergraph degree sequences. Discrete Applied Mathematics 14 (1986), 239-254.
  5. D. R. Stinson. Concerning the spectrum of perpendicular arrays of triple systems. Discrete Mathematics 61 (1986), 305-310.
  6. D. R. Stinson. Holey perpendicular arrays. Utilitas Mathematica 30 (1986), 31-43.
  7. D. R. Stinson. The equivalence of certain incomplete transversal designs and frames. Ars Combinatoria 22 (1986), 81-87.
  8. D. R. Stinson and S. A. Vanstone. Orthogonal packings in PG(5,2). Aequationes Mathematicae 31 (1986), 159-168.

Papers Published in 1985

  1. D. R. Stinson and H. Ferch. 2000000 Steiner triple systems of order 19. Mathematics of Computation 44 (1985), 533-535.
  2. D. R. Stinson and L. Zhu. On sets of three MOLS with holes. Discrete Mathematics 54(1985), 321-328.
  3. D. R. Stinson and S. A. Vanstone. Some non-isomorphic Kirkman triple systems of orders 39 and 51. Utilitas Mathematica 27(1985), 199-205.
  4. D. R. Stinson and S. A. Vanstone. A Kirkman square of order 51 and block-size 3. Discrete Mathematics 55(1985), 107-111.
  5. D. S. Archdeacon, J. H. Dinitz, and D. R. Stinson. V-squares. Ars Combinatoria 19(1985), 161-174.
  6. D. R. Stinson. Isomorphism testing of Steiner triple systems: canonical forms. Ars Combinatoria 19(1985), 213-218.
  7. D. R. Stinson. The spectrum of nested Steiner triple systems. Graphs and Combinatorics 1(1985), 189-191.
  8. W. L. Kocay, D. R. Stinson, and S. A. Vanstone. On strong starters in cyclic groups. Discrete Mathematics 56(1985), 45-60.
  9. D. R. Stinson and S. A. Vanstone. A few more balanced Room squares. Journal of the Australian Mathematical Society A 39(1985), 344-352.
  10. D. R. Stinson. Room squares with maximum empty subarrays. Ars Combinatoria 20(1985), 159-166.
  11. D. R. Stinson. Hill-climbing algorithms for the construction of combinatorial designs. In "Algorithms in Combinatorial Design Theory'", North-Holland, 1985, pp. 321-334. (Annals of Discrete Mathematics, vol. 26.)
  12. C. J. Colbourn, M. J. Colbourn, and D. R. Stinson. The computational complexity of finding subdesigns of combinatorial designs. In "Algorithms in Combinatorial Design Theory", North-Holland, 1985, pp. 59-66. (Annals of Discrete Mathematics, vol. 26.)
  13. J. D. Horton, B. K. Roy, P. J. Schellenberg, and D. R. Stinson. On decomposing graphs into isomorphic uniform $2-$factors. In "Cycles in Graphs'", North-Holland, 1985, pp. 297-320. (Annals of Discrete Mathematics, vol. 27.)

Papers Published in 1984

  1. D. R. Stinson. A short proof of the non-existence of a pair of orthogonal Latin squares of order 6. Journal of Combinatorial Theory A 36(1984), 373-376.
  2. B. A. Anderson, P. J. Schellenberg, and D. R. Stinson. The existence of Howell designs of even side. Journal of Combinatorial Theory A 36(1984), 23-55.
  3. D. R. Stinson and G. H. J. van Rees. Some improved results concerning the Cordes problem. Ars Combinatoria 17(1984), 117-128.
  4. D. R. Stinson. Pair-packings and projective planes. Journal of Australian Mathematical Society A 37(1984), 27-38.
  5. D. R. Stinson and W. D. Wallis. An even side analogue of Room squares. Aequationes Mathematicae 27(1984), 201-213.
  6. E. Billington, R. G. Stanton, and D. R. Stinson. On λ-packings with block-size four (v not ≡ 0 mod 3). Ars Combinatoria 17A(1984), 73-84.
  7. R. C. Mullin and D. R. Stinson. Holey SOLSSOMs. Utilitas Mathematica 25(1984), 159-169.
  8. D. R. Stinson and G. H. J. van Rees. The equivalence of certain equidistant binary codes and symmetric BIBDs. Combinatorica 4(1984), 357-362.
  9. C. C. Lindner and D. R. Stinson. Steiner pentagon systems. Discrete Mathematics 52(1984), 67-74.
  10. C. C. Lindner and D. R. Stinson. The spectrum for the conjugate invariant subgroups of perpendicular arrays. Ars Combinatoria 18(1984), 51-60.
  11. D. R. Stinson. On scheduling perfect competitions. Ars Combinatoria 18(1984), 45-49.
  12. D. R. Stinson and S. A. Vanstone. A note on non-isomorphic Kirkman triple systems. Journal of Combinatorics, Information and Systems Sciences 9(1984), 113-116.
  13. C. J. Colbourn, M. J. Colbourn, and D. R. Stinson. The computational complexity of recognizing critical sets. Lecture Notes in Mathematics 1073(1984), 248-253. (Graph theory, Singapore 1983.)
  14. S. Judah, R. C. Mullin, and D. R. Stinson. A note on the covering numbers g(1,3;v). Congressus Numerantium 45(1984), 305-310. (Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1984.)

Papers Published in 1983

  1. J. H. Dinitz and D. R. Stinson. MOLS with holes. Discrete Mathematics 44(1983), 145-154.
  2. D. R. Stinson. The non-existence of certain finite linear spaces. Geometriae Dedicata 13(1983), 429-434.
  3. P. Erdös, R. C. Mullin, V. Sós, and D. R. Stinson. Finite linear spaces and projective planes. Discrete Mathematics 47(1983), 49-62.
  4. D. R. Stinson and W. D. Wallis. Snappy constructions for triple systems. Gazette of the Australian Mathematical Society 10(1983), 84-88.
  5. D. R. Stinson and W. D. Wallis. Twofold triple systems without repeated blocks. Discrete Mathematics 47(1983), 125-128.
  6. J. H. Dinitz and D. R. Stinson. On non-isomorphic Room squares. Proceedings of the American Mathematical Society 89(1983), 175-181.
  7. J. H. Dinitz, D. R. Stinson, and W. D. Wallis. Room squares with holes of sides 3, 5, and 7. Discrete Mathematics 47(1983), 221-228.
  8. R. G. Stanton and D. R. Stinson. Perfect pair-coverings with block sizes 2, 3, and 4. Journal of Combinatorics, Information and Systems Sciences 8(1983), 21-25.
  9. C. C. Lindner, R. C. Mullin, and D. R. Stinson. On the spectrum of resolvable orthogonal arrays invariant under the Klein group K4. Aequationes Mathematicae 26(1983), 176-183.
  10. D. R. Stinson. A comparison of two invariants for Steiner triple systems: fragments and trains. Ars Combinatoria 16(1983), 69-76.
  11. D. R. Stinson. Room squares and subsquares. Lecture Notes in Mathematics 1036(1983), 86-95. (Combinatorial Mathematics X, Adelaide, 1982.)

Papers Published in 1982

  1. R. C. Mullin, D. R. Stinson, and S. A. Vanstone. Kirkman triple systems containing maximum subdesigns. Utilitas Mathematica 21C (1982), 283-300.
  2. D. R. Stinson. The existence of Howell designs of odd side. Journal of Combinatorial Theory A 32 (1982), 53-65.
  3. A. Hartman, R. C. Mullin, and D. R. Stinson. Exact covering configurations and Steiner systems. Journal of the London Mathematical Society 2 (1982), 193-200.
  4. D. R. Stinson. Applications and generalizations of the variance method in combinatorial designs. Utilitas Mathematica 22 (1982), 323-333.
  5. D. R. Stinson. A short proof of a theorem of de Witte. Ars Combinatoria 14 (1982), 79-86.
  6. D. R. Stinson. Determination of a covering number. Congressus Numerantium 34 (1982), 429-440 (Eleventh Manitoba Conference on Numerical Mathematics and Computing, 1981).
  7. D. R. Stinson and G. H. J. van Rees. Some large critical sets. Congressus Numerantium 34 (1982), 441-456 (Eleventh Manitoba Conference on Numerical Mathematics and Computing, 1981.)

Papers Published in 1981

  1. D. R. Stinson. A general construction for group-divisible designs. Discrete Mathematics 33 (1981), 89-94.
  2. J. H. Dinitz and D. R. Stinson. A fast algorithm for finding strong starters. SIAM Journal on Algebraic and Discrete Methods 2 (1981), 50-56.
  3. J. H. Dinitz and D. R. Stinson. The spectrum of Room cubes. European Journal of Combinatorics 2 (1981), 221-230.
  4. J. H. Dinitz and D. R. Stinson. Further results on frames. Ars Combinatoria 11 (1981), 275-288.
  5. D. R. Stinson. Some results concerning frames, Room squares, and subsquares. Journal of Australian Mathematical Society A 31 (1981), 376-384.
  6. P. J. Schellenberg, D. R. Stinson, S. A. Vanstone, and J. W. Yates. The existence of Howell designs of side n+1 and order 2n. Combinatorica 1 (1981), 289-301.
  7. A. Hartman and D. R. Stinson. A note on one-factorizations. Utilitas Mathematica 20 (1981), 155-162.
  8. D. R. Stinson. The spectrum of skew Room squares. Journal of Australian Mathematical Society A 31 (1981), 475-480.
  9. D. R. Stinson. The non-existence of a (2,4)-frame. Ars Combinatoria 11 (1981), 99-106.
  10. D. R. Stinson. Some constructions for frames, Room squares, and subsquares. Ars Combinatoria 12 (1981), 229-267.
  11. R. C. Mullin, R. G. Stanton, and D. R. Stinson. Perfect pair-coverings and an algorithm for certain 1-2 factorizations of the complete graph K2s+1. Ars Combinatoria 12 (1981), 73-80.
  12. D. R. Stinson. A generalization of Howell designs. Congressus Numerantium 33 (1981), 321-328. (Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1981.)

Papers Published in 1980

  1. J. H. Dinitz and D. R. Stinson. Boss block designs. Ars Combinatoria 9 (1980), 59-68.
  2. D. S. Archdeacon, J. H. Dinitz, D. R. Stinson, and T. W. Tillson. Some new row-complete Latin squares. Journal of Combinatorial Theory A 29 (1980), 395-398.
  3. J. H. Dinitz and D. R. Stinson. A note on Howell designs of odd side. Utilitas Mathematica 18 (1980), 207-216.
  4. D. R. Stinson. A skew Room square of order 129. Discrete Mathematics 31 (1980), 333-335.
  5. J. H. Dinitz and D. R. Stinson. The construction and uses of frames. Ars Combinatoria 10 (1980), 31-54.
  6. B. A. Anderson, R. C. Mullin, and D. R. Stinson. More skew Room squares. Utilitas Mathematica 18 (1980), 201-205.
  7. R. C. Mullin, P. J. Schellenberg, D. R. Stinson, and S. A. Vanstone. Some results on the existence of squares. In "Combinatorial Mathematics, Optimal Designs and their Applications", North-Holland, 1980, pp. 257-274. (Annals of Discrete Mathematics, vol. 6.)
  8. D. R. Stinson and W. D. Wallis. Some designs used in constructing skew Room squares. In "Combinatorics '79", North-Holland, 1980, pp. 171-175. (Annals of Discrete Mathematics, vol. 8.)

Papers Published in 1979

  1. D. R. Stinson. The existence of 30 mutually orthogonal Latin squares. Ars Combinatoria 7 (1979), 153-170.
  2. D. R. Stinson. The distance between units in rings — an algorithmic approach. Utilitas Mathematica 15 (1979), 281-292.
  3. D. R. Stinson. A generalization of Wilson's construction for mutually orthogonal Latin squares. Ars Combinatoria 8 (1979), 95-105.

Papers Published in 1978

  1. D. R. Stinson. A note on the existence of 7 and 8 mutually orthogonal Latin squares. Ars Combinatoria 6 (1978), 113-115.
  2. R. C. Mullin, D. R. Stinson, and W. D. Wallis. Concerning the spectrum of skew Room squares. Ars Combinatoria 6 (1978), 277-291.
  3. R. C. Mullin and D. R. Stinson. Near-self-complimentary designs and a method of mixed sums. Lecture Notes in Mathematics 686 (1978), 59-67. (International Conference on Combinatorial Theory, Canberra, 1977.)
  4. R. C. Mullin, D. R. Stinson, and W. D. Wallis. Skew squares of low order. Congressus Numerantium 23 (1978), 413-434. (Eighth Manitoba Conference on Numerical Mathematics and Computing, 1978.)

Papers Published in 1977

  1. D. R. Stinson. Determination of a packing number. Ars Combinatoria 3 (1977), 89-114.