The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mitsugu Hirasaka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mitsugu Hirasaka
    On Meta-Thin Association Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:187-201 [Journal]
  2. Mitsugu Hirasaka, Mikhail E. Muzychuk
    Association schemes generated by a non-symmetric relation of valency 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:109-135 [Journal]
  3. Sejeong Bang, Mitsugu Hirasaka
    Construction of association schemes from difference sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:1, pp:59-74 [Journal]
  4. Mitsugu Hirasaka
    Upper bounds given by equitable partitions of a primitive association scheme. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:6, pp:841-849 [Journal]
  5. Mitsugu Hirasaka, Hanguk Kang, Kijung Kim
    Characterization of association schemes by equitable partitions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:2, pp:139-152 [Journal]
  6. Mitsugu Hirasaka
    Primitive Commutative Association Schemes with a Non-symmetric Relation of Valency 3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:90, n:1, pp:27-48 [Journal]
  7. Mitsugu Hirasaka, Mikhail E. Muzychuk
    An Elementary Abelian Group of Rank 4 Is a CI-Group. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:2, pp:339-362 [Journal]
  8. Mitsugu Hirasaka, Mikhail E. Muzychuk
    On Quasi-thin Association Schemes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:98, n:1, pp:17-32 [Journal]
  9. Mitsugu Hirasaka, Paul-Hermann Zieschang
    Sufficient conditions for a scheme to originate from a group. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:1, pp:17-27 [Journal]

  10. Preface. [Citation Graph (, )][DBLP]


  11. Nilpotent closed subsets of association schemes. [Citation Graph (, )][DBLP]


  12. On imprimitive multiplicity-free permutation groups the degree of which is the product of two distinct primes. [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