Geodesic

Combinatorics and graph theory. Part IV

Preface
p. 5-8
Primitive digraphs with large exponents and slowly synchronizing automata
p. 9-39
Lower bounds for the number of keys in Zakrevskij cipher
p. 40-44
Efficient data compression by straight-line programs
p. 45-68
Upper and lower bounds for Grigoriev's algorithm for solving integral tropical linear systems
p. 69-82
Synchronizing random automata on $4$-letter alphabet
p. 83-90
A complete one-way function based on a~free finite rank $\mathbb Z\times\mathbb Z$-module
p. 91-107
Bases of schurian antisymmetric coherent configurations and isomorphism test for schurian tournaments
p. 108-147
Function transformations with automata
p. 148-169
On $k$-abelian avoidability
p. 170-182
Using relevance queries for identification of read-once functions
p. 183-217