Douglas R. Stinson

From MaRDI portal
Revision as of 14:09, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:218816

Available identifiers

zbMath Open stinson.douglas-rWikidataQ3038041 ScholiaQ3038041MaRDI QIDQ218816

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61775852024-01-17Paper
Rectangular, range, and restricted AONTs: three generalizations of all-or-nothing transforms2023-12-14Paper
Circular external difference families, graceful labellings and cyclotomy2023-10-04Paper
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes2023-09-12Paper
Bounds on data limits for all-to-all comparison from combinatorial designs2023-08-31Paper
https://portal.mardi4nfdi.de/entity/Q61725792023-07-20Paper
Some new results on skew frame starters in cyclic groups2023-05-31Paper
Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families2023-05-16Paper
Constructions and bounds for codes with restricted overlaps2022-11-18Paper
Orthogonal and strong frame starters, revisited2022-08-19Paper
On resolvable Golomb rulers, symmetric configurations and progressive dinner parties2022-03-15Paper
On security properties of all-or-nothing transforms2021-11-11Paper
https://portal.mardi4nfdi.de/entity/Q49594762021-09-13Paper
Techniques for Designing and Analyzing Algorithms2021-09-02Paper
An Analysis and Critique of the Scoring Method Used for Sport Climbing at the 2020 Tokyo Olympics2021-08-28Paper
On the equivalence of authentication codes and robust (2, 2)-threshold schemes2021-06-17Paper
New results on modular Golomb rulers, optical orthogonal codes and related structures2021-06-11Paper
Asymmetric All-or-nothing Transforms2021-05-31Paper
On partial parallel classes in partial Steiner triple systems2021-03-25Paper
A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design2021-03-19Paper
https://portal.mardi4nfdi.de/entity/Q51336602020-11-10Paper
Block-avoiding point sequencings of arbitrary length in Steiner triple systems2020-07-29Paper
Looking back -- my life as a mathematician and cryptographer2020-07-21Paper
Designing Progressive Dinner Parties2020-07-10Paper
Block-avoiding point sequencings of Mendelsohn triple systems2020-03-20Paper
Block-avoiding point sequencings of directed triple systems2020-02-20Paper
Nonsequenceable Steiner triple systems2019-10-14Paper
Block-avoiding sequencings of points in Steiner triple systems2019-09-19Paper
A network reliability approach to the analysis of combinatorial repairable threshold schemes2019-09-19Paper
Good sequencings for small Mendelsohn triple systems2019-09-13Paper
Good sequencings for small directed triple systems2019-07-25Paper
Constructions of optimal orthogonal arrays with repeated rows2019-07-18Paper
Bounds for orthogonal arrays with repeated rows2019-05-16Paper
Multi-prover proof of retrievability2019-01-11Paper
https://portal.mardi4nfdi.de/entity/Q53764242018-09-17Paper
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets2018-07-09Paper
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks2018-06-12Paper
A survey and refinement of repairable threshold schemes2018-04-10Paper
Combinatorial repairability for threshold schemes2018-01-26Paper
Ideal ramp schemes and related combinatorial objects2017-12-20Paper
https://portal.mardi4nfdi.de/entity/Q45956432017-12-06Paper
A tight bound on the size of certain separating hash families2017-11-29Paper
Some Nonexistence Results for Strong External Difference Families Using Character Theory2017-10-06Paper
Localised multisecret sharing2017-04-03Paper
https://portal.mardi4nfdi.de/entity/Q29609612017-02-17Paper
On Partial Sums in Cyclic Groups2016-12-20Paper
All or nothing at all2016-12-06Paper
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families2016-08-16Paper
Cryptography2016-07-05Paper
An application of ramp schemes to broadcast encryption2016-06-16Paper
Unconditionally secure signature schemes revisited2016-04-18Paper
On encoding symbol degrees of array BP-XOR codes2016-04-11Paper
On Symmetric Designs and Binary 3-Frameproof Codes2016-01-25Paper
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs2015-12-07Paper
Linear approaches to resilient aggregation in sensor networks2015-12-07Paper
Extended results on privacy against coalitions of users in user-private information retrieval protocols2015-11-19Paper
Universal Hashing and Multiple Authentication2015-11-11Paper
Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution2015-11-11Paper
On tight bounds for binary frameproof codes2015-10-26Paper
Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes2015-10-01Paper
Additional constructions to solve the generalized Russian cards problem using combinatorial designs2014-09-09Paper
Is extracting data the same as possessing data?2014-06-30Paper
Combinatorial solutions providing improved security for the generalized Russian cards problem2014-06-27Paper
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs2014-05-06Paper
A unified approach to combinatorial key predistribution schemes for sensor networks2014-04-29Paper
Extended combinatorial constructions for peer-to-peer user-private information retrieval2014-01-28Paper
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes2013-11-14Paper
A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage2013-11-12Paper
On dealer-free dynamic threshold schemes2013-05-06Paper
Socio-Rational Secret Sharing as a New Direction in Rational Cryptography2013-03-13Paper
Nonincident points and blocks in designs2013-03-01Paper
Constructions for retransmission permutation arrays2012-11-28Paper
Packing Costas Arrays2012-07-02Paper
On the complexity of the herding attack and some related attacks on hash functions2012-05-22Paper
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures2012-02-21Paper
Short one-time signatures2011-11-03Paper
A Problem Concerning Nonincident Points and Blocks in Steiner Triple Systems2011-09-18Paper
A Problem Concerning Nonincident Points and Lines in Projective Planes2011-09-07Paper
https://portal.mardi4nfdi.de/entity/Q30891732011-08-24Paper
Unconditionally Secure Signature Schemes Revisited2011-05-19Paper
On message recognition protocols: recoverability and explicit confirmation2011-04-05Paper
Unconditionally secure chaffing and winnowing with short authentication tags2011-03-10Paper
Honeycomb arrays2010-12-16Paper
Group Testing and Batch Verification2010-09-29Paper
Anonymity in shared symmetric key primitives2010-09-16Paper
Yet another hat game2010-06-16Paper
Practical unconditionally secure two-channel message authentication2010-05-19Paper
An efficient identification protocol secure against concurrent-reset attacks2010-05-06Paper
Combinatorial batch codes2010-03-10Paper
Attack on a concast signature scheme2009-07-21Paper
A Highly Scalable RFID Authentication Protocol2009-06-25Paper
A critical analysis and improvement of advanced access content system drive-host authentication2009-05-12Paper
Generalized mix functions and orthogonal equitable rectangles2009-03-31Paper
On orthogonal generalized equitable rectangles2009-03-31Paper
https://portal.mardi4nfdi.de/entity/Q36158062009-03-24Paper
Two attacks on a sensor network key distribution scheme of Cheng and Agrawal2009-03-03Paper
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families2009-02-24Paper
Key Refreshing in Wireless Sensor Networks2009-01-09Paper
Multicollision Attacks on Some Generalized Sequential Hash Functions2008-12-21Paper
A bound on the size of separating hash families2008-12-08Paper
A Critical Analysis and Improvement of AACS Drive-Host Authentication2008-07-08Paper
https://portal.mardi4nfdi.de/entity/Q54425112008-02-22Paper
An efficient and secure two-flow zero-knowledge identification protocol2008-02-21Paper
Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols2008-02-21Paper
On generalized separating hash families2008-02-04Paper
Tree-Based Key Distribution Patterns2007-11-15Paper
On unconditionally secure distributed oblivious transfer2007-08-20Paper
https://portal.mardi4nfdi.de/entity/Q52949342007-07-26Paper
https://portal.mardi4nfdi.de/entity/Q34294812007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34247172007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34247212007-03-05Paper
Constructions and bounds for \((m,t)\)-splitting systems2007-02-02Paper
Selected Areas in Cryptography2006-10-10Paper
Visual cryptography for general access structures2006-10-10Paper
Fault‐tolerant routings with minimum optical index2006-09-12Paper
On the low Hamming weight discrete logarithm problem for nonadjacent representations2006-09-12Paper
Common intersection designs2006-09-06Paper
Optimum Secret Sharing Scheme Secure against Cheating2006-06-01Paper
Some observations on the theory of cryptographic hash functions2006-05-29Paper
A new characterization of semi-bent and bent functions on finite fields2006-05-29Paper
Properties and constraints of cheating-immune secret sharing schemes2006-04-28Paper
Selected Areas in Cryptography2005-12-27Paper
Minimality and other properties of the width-𝑤 nonadjacent form2005-12-12Paper
Topics in Cryptology – CT-RSA 20052005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q57104332005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q57025552005-11-02Paper
Alternative Digit Sets for Nonadjacent Representations2005-09-16Paper
https://portal.mardi4nfdi.de/entity/Q30236562005-07-05Paper
Sequentially perfect and uniform one-factorizations of the complete graph2005-04-25Paper
On the maximum number of different ordered pairs of symbols in sets of latin squares2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48188542004-09-24Paper
The Lovász local lemma and its applications to some combinatorial arrays2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q47364242004-08-09Paper
New combinatorial designs and their applications to authentication codes and secret sharing schemes.2004-03-29Paper
Generalized cover-free families.2004-03-29Paper
Contrast Optimal Threshold Visual Cryptography Schemes2004-01-08Paper
Combinatorial Designs2003-12-30Paper
https://portal.mardi4nfdi.de/entity/Q44185422003-08-10Paper
https://portal.mardi4nfdi.de/entity/Q47933122003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44138692003-07-21Paper
On Unconditionally Secure Robust Distributed Key Distribution Centers2003-07-16Paper
https://portal.mardi4nfdi.de/entity/Q47885692003-05-19Paper
https://portal.mardi4nfdi.de/entity/Q47958362003-04-06Paper
https://portal.mardi4nfdi.de/entity/Q47923132003-03-31Paper
New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups2003-03-25Paper
Slope packings and coverings, and generic algorithms for the discrete logarithm problem2003-03-19Paper
Quorum systems constructed from combinatorial designs2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q31497612002-09-26Paper
https://portal.mardi4nfdi.de/entity/Q49493372002-09-19Paper
https://portal.mardi4nfdi.de/entity/Q45522602002-08-29Paper
Constructions and bounds for unconditionally secure non-interactive commitment schemes2002-08-21Paper
Combinatorial properties of frameproof and traceability codes2002-08-04Paper
Efficient metering schemes with pricing2002-08-04Paper
Something about all or nothing (transforms)2002-06-02Paper
Orthogonal arrays of strength three from regular 3-wise balanced designs2002-05-20Paper
Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels2002-04-11Paper
https://portal.mardi4nfdi.de/entity/Q27704622002-02-10Paper
https://portal.mardi4nfdi.de/entity/Q27627502002-01-09Paper
Almost \(k\)-wise independent sample spaces and their cryptologic applications2002-01-02Paper
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem2001-12-10Paper
https://portal.mardi4nfdi.de/entity/Q42636582001-11-22Paper
https://portal.mardi4nfdi.de/entity/Q27082462001-04-17Paper
https://portal.mardi4nfdi.de/entity/Q44870822001-03-12Paper
https://portal.mardi4nfdi.de/entity/Q45221022000-12-19Paper
Extended capabilities for visual cryptography2000-12-12Paper
On the contrast in visual cryptography schemes2000-09-24Paper
Anonymous secret sharing schemes2000-09-05Paper
Some new bounds for cover-free families2000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49493252000-05-08Paper
https://portal.mardi4nfdi.de/entity/Q49407002000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42430572000-02-04Paper
https://portal.mardi4nfdi.de/entity/Q42508132000-02-01Paper
Secure frameproof codes, key distribution patterns, group testing algorithms and related structures2000-01-01Paper
A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets1999-12-05Paper
Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets1999-10-05Paper
https://portal.mardi4nfdi.de/entity/Q42349891999-03-17Paper
Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution1999-01-20Paper
https://portal.mardi4nfdi.de/entity/Q42218791998-12-02Paper
Some new results on key distribution patterns and broadcast encryption1998-11-08Paper
On the maximum number of fixed points in automorphisms of prime order of 2-\((v,k,\text 1)\) designs1998-08-03Paper
https://portal.mardi4nfdi.de/entity/Q43932451998-06-08Paper
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes1998-05-11Paper
More thwarts in transversal designs1998-04-26Paper
https://portal.mardi4nfdi.de/entity/Q43657251998-04-22Paper
On the dealer's randomness required in secret sharing schemes1998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q43797361998-03-04Paper
On some methods for unconditionally secure key distribution and broadcast encryption1998-01-27Paper
Small group-divisible designs with block size four1997-07-28Paper
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds1997-03-17Paper
A simple analysis of the error probability of two-point based sampling1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48769451996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48769951996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48769961996-07-17Paper
An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions1996-07-04Paper
https://portal.mardi4nfdi.de/entity/Q48769701996-06-23Paper
Combinatorial characterizations of authentication codes. II1996-06-04Paper
https://portal.mardi4nfdi.de/entity/Q48745951996-01-01Paper
Three characterizations of non-binary correlation-immune and resilient functions1995-09-25Paper
https://portal.mardi4nfdi.de/entity/Q48391491995-07-16Paper
Graph decompositions and secret sharing schemes1995-07-16Paper
Universal hashing and authentication codes1995-05-20Paper
On the sprectra of certain classes of Room frames1995-04-06Paper
https://portal.mardi4nfdi.de/entity/Q43186921995-03-30Paper
Combinatorial techniques for universal hashing1995-02-13Paper
https://portal.mardi4nfdi.de/entity/Q43091211994-10-12Paper
Decomposition constructions for secret-sharing schemes1994-10-04Paper
https://portal.mardi4nfdi.de/entity/Q43043411994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42795771994-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42796561994-02-22Paper
https://portal.mardi4nfdi.de/entity/Q31424171993-12-12Paper
A note on a conjecture concerning symmetric resilient functions1993-11-15Paper
https://portal.mardi4nfdi.de/entity/Q42015621993-08-25Paper
Towards the spectrum of Room squares with subsquares1993-05-23Paper
https://portal.mardi4nfdi.de/entity/Q40357071993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40357081993-05-18Paper
Further results on large sets of disjoint group-divisible designs1993-05-16Paper
Some improved bounds on the information rate of perfect secret sharing schemes1993-04-22Paper
https://portal.mardi4nfdi.de/entity/Q40261431993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40261471993-02-21Paper
An explication of secret sharing schemes1993-02-18Paper
A parallelization of Miller's \(n^{\log n}\) isomorphism technique1993-01-16Paper
Combinatorial characterizations of authentication codes1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171681993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40172001993-01-16Paper
Frames with Block Size Four1993-01-12Paper
A note on a conjecture concerning symmetric resilient functions1993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31369881993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40144221992-10-13Paper
https://portal.mardi4nfdi.de/entity/Q40143201992-10-06Paper
Nesting directed cycle systems of even length1992-09-27Paper
Pairwise Balanced Designs with Block Sizes Three and Four1992-09-27Paper
Steiner triple systems of order 19 with nontrivial automorphism group1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40007781992-09-26Paper
A survey of Kirkman triple systems and related designs1992-06-28Paper
Designs constructed from maximal arcs1992-06-28Paper
On bit-serial multiplication and dual bases in GF(2/sup m/)1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39912601992-06-28Paper
The Detection of Cheaters in Thershold Schemes1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39805591992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39813441992-06-26Paper
Spanning sets and scattering sets in Steiner triple systems1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33530291991-01-01Paper
On the number of blocks in a perfect covering of v points1990-01-01Paper
A construction for authentication/secrecy codes from 3-homogeneous permutation groups1990-01-01Paper
The combinatorics of authentication and secrecy codes1990-01-01Paper
Pairwise balanced designs with odd block sizes exceeding five1990-01-01Paper
Small embeddings for partial cycle systems of odd length1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33602171990-01-01Paper
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34873541990-01-01Paper
Nesting of cycle systems of odd length1989-01-01Paper
On combinatorial designs with subdesigns1989-01-01Paper
The existence of simple \(S_ 3(3,4,\nu)\)1989-01-01Paper
The Oberwolfach problem and factors of uniform odd length cycles1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31978331989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800511989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38294721989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340591989-01-01Paper
Some new perfect one-factorizations from starters in finite fields1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47324921989-01-01Paper
Some constructions and bounds for authentication codes1988-01-01Paper
Edge-coloured designs with block size four1988-01-01Paper
A construction for authentication/secrecy codes from certain combinatorial designs1988-01-01Paper
A perfect one-factorization for \(K_{36}\)1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800461988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37926221988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37926231988-01-01Paper
On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38072551988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38122701988-01-01Paper
A Combinatorial Approach to Threshold Schemes1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38354621988-01-01Paper
On the existence of MOLS with equal-sized holes1987-01-01Paper
Frames for Kirkman triple systems1987-01-01Paper
Pairwise balanced designs with block sizes \(6t+1\)1987-01-01Paper
A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490831987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37579231987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817641987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37832021987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911851987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37941961987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38015931987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38031531987-01-01Paper
Some NP-complete problems for hypergraph degree sequences1986-01-01Paper
Orthogonal packings in PG(5,2)1986-01-01Paper
Concerning the spectrum of perpendicular arrays of triple systems1986-01-01Paper
284457 Steiner Triple Systems of Order 19 Contain a Subsystem of Order 91986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37458491986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588371986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37689131986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153421986-01-01Paper
A Kirkman square of order 51 and block size 31985-01-01Paper
On sets of three mols with holes1985-01-01Paper
On strong starters in cyclic groups1985-01-01Paper
The spectrum of nested Steiner triple systems1985-01-01Paper
2000000 Steiner Triple Systems of Order 191985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36928651985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935341985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37054621985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37080321985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187241985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187251985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37206431985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37357171985-01-01Paper
The existence of Howell designs of even side1984-01-01Paper
The equivalence of certain equidistant binary codes and symmetric BIBDS1984-01-01Paper
A short proof of the nonexistence of a pair of orthogonal Latin squares of order six1984-01-01Paper
An even side analogue of Room squares1984-01-01Paper
Steiner pentagon systems1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222041984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32228551984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33330541984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33358051984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33408711984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33440021984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463391984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761761984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673511984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873011983-01-01Paper
Room squares with holes of sides 3, 5, and 71983-01-01Paper
Finite linear spaces and projective planes1983-01-01Paper
The non-existence of certain finite linear spaces1983-01-01Paper
Two-fold triple systems without repeated blocks1983-01-01Paper
Mols with holes1983-01-01Paper
On the spectrum of resolvable orthogonal arrays invariant under the Klein group \(K_ 4\)1983-01-01Paper
On Nonisomorphic Room Squares1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33122421983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33439951983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746761983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37657831983-01-01Paper
The existence of Howell designs of odd side1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221171982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33285541982-01-01Paper
Exact Covering Configurations and Steiner Systems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39630181982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47427901982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47428021982-01-01Paper
The spectrum of Room cubes1981-01-01Paper
A general construction for group-divisible designs1981-01-01Paper
The spectrum of room cubes1981-01-01Paper
The existence of Howell designs of side n+1 and order 2n1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39090621981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297521981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39329901981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367461981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367471981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39374481981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39476751981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521101981-01-01Paper
A Fast Algorithm for Finding Strong Starters1981-01-01Paper
A skew Room square of order 1291980-01-01Paper
Some new row-complete latin squares1980-01-01Paper
Some Designs Used in Constructing Skew Room Squares1980-01-01Paper
Some Results on the Existence of Squares1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38939401980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38985081980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105361980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39126021980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38582771979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38614151979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38874761979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39000831979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38639011978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41892871978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41906551977-01-01Paper
On min-base palindromic representations of powers of 20001-01-03Paper
A method of constructing pairwise balanced designs containing parallel classes0001-01-03Paper
Nestings of BIBDs with block size four0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Douglas R. Stinson