|
|
2012, Volume 402
|
 |
|
 |
Combinatorics and graph theory. Part IV
RuFiDiM'11
|
Preface
Juhani Karhumäki, Yuri Matiyasevich
|
5–8 |
|
|
Primitive digraphs with large exponents and slowly synchronizing automata
D. S. Ananichev, M. V. Volkov, V. V. Gusev
|
9–39 |
|
|
Lower bounds for the number of keys in Zakrevskij cipher
D. S. Ananichev, D. D. Dublennykh
|
40–44 |
|
|
Efficient data compression by straight-line programs
I. S. Burmistrov, A. V. Kozlova, E. B. Kurpilyansky, A. A. Khvorost
|
45–68 |
|
|
Upper and lower bounds for Grigoriev's algorithm for solving integral tropical linear systems
A. P. Davydow
|
69–82 |
|
|
Synchronizing random automata on $4$-letter alphabet
Yu. I. Zaks, E. S. Skvortsov
|
83–90 |
|
|
A complete one-way function based on a free finite rank $\mathbb Z\times\mathbb Z$-module
S. I. Nikolenko, D. S. Tugaryov
|
91–107 |
|
|
Bases of schurian antisymmetric coherent configurations and isomorphism test for schurian tournaments
I. N. Ponomarenko
|
108–147 |
|
|
Function transformations with automata
T. Sallinen
|
148–169 |
|
|
On $k$-abelian avoidability
M. Huova, J. Karhumäki
|
170–182 |
|
|
Using relevance queries for identification of read-once functions
D. V. Chistikov
|
183–217 |
|
|
Contact us: