Norbert Seifter, “Properties of graphs with polynomial growth”, Journal of Combinatorial Theory, Series B, 52:2 (1991), 222
Max Garzon, Yechezkel Zalcstein, “The complexity of Grigorchuk groups with application to cryptography”, Theoretical Computer Science, 88:1 (1991), 83
W. Imrich, N. Seifter, “A survey on graphs with polynomial growth”, Discrete Math., 95:1-3 (1991), 101–117
Old folk, Texts in Theoretical Computer Science. An EATCS Series, Models of Massive Parallelism, 1991, 199
John Rhodes, Lattices, Semigroups, and Universal Algebra, 1990, 243
Р. И. Григорчук, “О топологических и метрических типах поверхностей, регулярно накрывающих замкнутую поверхность”, Изв. АН СССР. Сер. матем., 53:3 (1989), 498–536 ; R. I. Grigorchuk, “On the topological and metric types of surfaces regularly covering a closed surface”, Math. USSR-Izv., 34:3 (1990), 517–553
Р. И. Григорчук, “О ряде Гильберта–Пуанкаре градуированных алгебр, ассоциированных с группами”, Матем. сб., 180:2 (1989), 207–225 ; R. I. Grigorchuk, “On the Hilbert–Poincaré series of graded algebras associated with groups”, Math. USSR-Sb., 66:1 (1990), 211–229
Jorma Jormakka, Deformations of Mathematical Structures, 1989, 33
Wolfgang Woess, “Amenable group actions on infinite graphs”, Math. Ann., 284:2 (1989), 251
Р. И. Григорчук, “Сверхаменабельность и проблема вхождения свободных полугрупп”, Функц. анализ и его прил., 21:1 (1987), 74–75 ; R. I. Grigorchuk, “Superamenability and the problem of occurrence of free semigroups”, Funct. Anal. Appl., 21:1 (1987), 64–66