The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergey V. Avgustinovich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergey V. Avgustinovich, Anna E. Frid
    Canonical Decomposition of a Regular Factorial Language. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:18-22 [Conf]
  2. Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva
    Testing Sets for 1-Perfect Code. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:938-940 [Conf]
  3. Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov
    Vector Summation within Minimal Angle. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:235-239 [Journal]
  4. Sergey V. Avgustinovich
    Perfect binary (n, 3) codes: the structure of graphs of minimum distances. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:9-11 [Journal]
  5. Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva
    The Classification of Some Perfect Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:3, pp:313-318 [Journal]
  6. Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass
    Cartesian Products of Graphs and Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:7, pp:847-851 [Journal]
  7. Sergey V. Avgustinovich, Anna E. Frid
    A Unique Decomposition Theorem for Factorial Languages. [Citation Graph (0, 0)][DBLP]
    IJAC, 2005, v:15, n:1, pp:149-160 [Journal]
  8. Sergey V. Avgustinovich, Anna E. Frid
    Words Avoiding Abelian Inclusions. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:3-9 [Journal]
  9. Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva
    Intersection matrices for partitions by binary perfect codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1621-1624 [Journal]

  10. Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). [Citation Graph (, )][DBLP]


  11. On mobile sets in the binary hypercube [Citation Graph (, )][DBLP]


  12. Embedding in a perfect code [Citation Graph (, )][DBLP]


  13. On shortest crucial words avoiding abelian powers. [Citation Graph (, )][DBLP]


  14. On uniquely k-determined permutations. [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