|
|
|
Publications in Math-Net.Ru |
Citations |
|
2012 |
| 1. |
A. È. Frid, “Fine and Wilf’s theorem for permutations”, Sib. Èlektron. Mat. Izv., 9 (2012), 377–381  |
1
|
|
2011 |
| 2. |
J. Cassaigne, F. V. Petrov, A. E. Frid, “On possible growths of Toeplitz languages”, Sibirsk. Mat. Zh., 52:1 (2011), 81–94  ; Siberian Math. J., 52:1 (2011), 63–73   |
|
2007 |
| 3. |
A. E. Frid, “Canonical decomposition of catenation of factorial languages”, Sib. Èlektron. Mat. Izv., 4 (2007), 12–19  |
3
|
|
2005 |
| 4. |
A. È. Frid, “A lower bound for the arithmetical complexity of Sturmian words”, Sib. Èlektron. Mat. Izv., 2 (2005), 14–22 |
7
|
|
2001 |
| 5. |
S. V. Avgustinovich, O. V. Borodin, A. È. Frid, “Distributive colorings of plane triangulations of minimum degree five”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001), 3–16 |
7
|
|
1999 |
| 6. |
A. È. Frid, “On graphs of subwords of DOL-sequences”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999), 92–103 |
1
|
|
1998 |
| 7. |
A. È. Frid, “The frequency of the occurrence of words in a DOL sequence”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:1 (1998), 82–87 |
|
1997 |
| 8. |
A. È. Frid, “On the combinatorial complexity of iteratively generated symbol sequences”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997), 53–59 |
5
|
|
| Organisations |
|
| |
|
|
Contact us: