
Search the dblp DataBase
Yury J. Ionin:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Yury J. Ionin
Applying Balanced Generalized Weighing Matrices to Construct Block Designs. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp: [Journal]
 Yury J. Ionin
New Symmetric Designs from Regular Hadamard Matrices. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1998, v:5, n:, pp: [Journal]
 Yury J. Ionin
Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:32, n:13, pp:227233 [Journal]
 Yury J. Ionin
A Technique for Constructing Symmetric Designs. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1998, v:14, n:2, pp:147158 [Journal]
 Yury J. Ionin
Building Symmetric Designs With Building Sets. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1999, v:17, n:13, pp:159175 [Journal]
 Yury J. Ionin, Hadi Kharaghani
A Recursive Construction for New Symmetric Designs. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2005, v:35, n:3, pp:303310 [Journal]
 Yury J. Ionin, Mohan S. Shrikhande
Strongly Regular Graphs and Designs with Three Intersection Numbers. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2000, v:21, n:1/3, pp:113125 [Journal]
 Yury J. Ionin, Mohan S. Shrikhande
Decomposable symmetric designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:14, pp:15571568 [Journal]
 Yury J. Ionin, Hadi Kharaghani
Doubly regular digraphs and symmetric designs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2003, v:101, n:1, pp:3548 [Journal]
 Yury J. Ionin, Mohan S. Shrikhande
5Designs with Three Intersection Numbers. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1995, v:69, n:1, pp:3650 [Journal]
 Yury J. Ionin, Mohan S. Shrikhande
On the lamda Design Conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:100114 [Journal]
Generalized conference matrices and projective planes. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
