Search

Your search keyword '"Stinson, Douglas R."' showing total 227 results

Search Constraints

Start Over You searched for: Author "Stinson, Douglas R." Remove constraint Author: "Stinson, Douglas R." Search Limiters Full Text Remove constraint Search Limiters: Full Text
227 results on '"Stinson, Douglas R."'

Search Results

1. Daniel Litt's Probability Puzzle

2. Strong External Difference Families and Classification of $\alpha$-valuations

3. Weak and Strong Nestings of BIBDs

4. Nestings of BIBDs with block size four

5. A method of constructing pairwise balanced designs containing parallel classes

7. Circular external difference families, graceful labellings and cyclotomy

8. Bounds on data limits for all-to-all comparison from combinatorial designs

9. Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families

11. Dispersed graph labellings

12. Some new results on skew frame starters in cyclic groups

13. Constructions and bounds for codes with restricted overlaps

14. In the Frame

15. Orthogonal and strong frame starters, revisited

16. On maximum parallel classes in packings

17. An Analysis and Critique of the Scoring Method Used for Sport Climbing at the 2020 Tokyo Olympics

18. Asymmetric All-or-nothing Transforms

19. Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes

20. On Security Properties of All-or-nothing Transforms

21. On partial parallel classes in partial Steiner triple systems

22. New Results on Modular Golomb Rulers, Optical Orthogonal Codes and Related Structures

23. On Resolvable Golomb Rulers, Symmetric Configurations and Progressive Dinner Parties

24. Designing Progressive Dinner Parties

25. On the equivalence of authentication codes and robust (2,2)-threshold schemes

26. Block-avoiding point sequencings of Mendelsohn triple systems

27. Good sequencings for small Mendelsohn triple systems

28. Block-avoiding point sequencings of directed triple systems

29. Good sequencings for small directed triple systems

30. Block-avoiding point sequencings of arbitrary length in Steiner triple systems

31. Nonsequenceable Steiner triple systems

32. Block-avoiding sequencings of points in Steiner triple systems

33. Constructions of optimal orthogonal arrays with repeated rows

34. Bounds for orthogonal arrays with repeated rows

35. A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes

36. A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later

37. A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design

38. Optimal Ramp Schemes and Related Combinatorial Objects

39. Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets

40. Some Nonexistence Results for Strong External Difference Families Using Character Theory

41. Combinatorial Repairability for Threshold Schemes

42. Multi-prover Proof-of-Retrievability

43. All or Nothing at All

44. A tight bound on the size of certain separating hash families

45. Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families

46. On the equivalence of authentication codes and robust (2, 2)-threshold schemes

47. On tight bounds for binary frameproof codes

48. Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs

49. Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs

50. A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

Catalog

Books, media, physical & digital resources