The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Behruz Tayfeh-Rezaie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ziba Eslami, Gholamreza B. Khosrovshahi, M. Mohammad-Noori, Behruz Tayfeh-Rezaie
    Some New 4-Designs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  2. Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
    Some Indecomposable t-Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:32, n:1-3, pp:235-238 [Journal]
  3. Behruz Tayfeh-Rezaie
    On the Existence of Large Sets of t-designs of Prime Sizes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:1, pp:143-149 [Journal]
  4. Hadi Kharaghani, Behruz Tayfeh-Rezaie
    Some new orthogonal designs in orders 32 and 40. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:317-324 [Journal]
  5. Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
    Root cases of large sets of t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:143-155 [Journal]
  6. Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie
    3-Designs from PSL(2, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3063-3073 [Journal]
  7. Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
    Large sets of t-designs through partitionable sets: A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:2993-3004 [Journal]
  8. G. R. Omidi, M. R. Pournaki, Behruz Tayfeh-Rezaie
    3-Designs with block size 6 from PSL(2, q) and their large sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:13, pp:1580-1588 [Journal]
  9. Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
    A New Proof of a Classical Theorem in Design Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:2, pp:391-396 [Journal]
  10. Behruz Tayfeh-Rezaie
    Some Infinite Families of Large Sets of t-Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:87, n:1, pp:239-245 [Journal]

  11. 3-Designs from PGL(2, q). [Citation Graph (, )][DBLP]


  12. Williamson matrices up to order 59. [Citation Graph (, )][DBLP]


  13. All triples for orthogonal designs of order 40. [Citation Graph (, )][DBLP]


  14. Classification of simple 2-(11, 3, 3) designs. [Citation Graph (, )][DBLP]


  15. A short proof of a theorem of Bang and Koolen. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002