| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A complete one-way function based on a finite rank free $ \mathbb{Z}\times \mathbb{Z} $-module
|
Nikolenko, S. I.
|
|
2013
|
192 |
3 |
p. 307-315
|
artikel
|
| 2 |
Bases of schurian antisymmetric coherent configurations and an isomorphism test for schurian tournaments
|
Ponomarenko, I. N.
|
|
2013
|
192 |
3 |
p. 316-338
|
artikel
|
| 3 |
Function transformations with automata
|
Sallinen, T.
|
|
2013
|
192 |
3 |
p. 339-351
|
artikel
|
| 4 |
Lower bounds for the number of keys in a Zakrevskij cipher
|
Ananichev, D. S.
|
|
2013
|
192 |
3 |
p. 279-281
|
artikel
|
| 5 |
On k-abelian avoidability
|
Huova, M.
|
|
2013
|
192 |
3 |
p. 352-358
|
artikel
|
| 6 |
Primitive digraphs with large exponents and slowly synchronizing automata
|
Ananichev, D. S.
|
|
2013
|
192 |
3 |
p. 263-278
|
artikel
|
| 7 |
Straight-line programs: a practical test (extended abstract)
|
Burmistrov, I. S.
|
|
2013
|
192 |
3 |
p. 282-294
|
artikel
|
| 8 |
Synchronizing random automata on a 4-letter alphabet
|
Zaks, Yu. I.
|
|
2013
|
192 |
3 |
p. 303-306
|
artikel
|
| 9 |
Upper and lower bounds for Grigoriev’s algorithm for solving integral tropical linear systems
|
Davydov, A. P.
|
|
2013
|
192 |
3 |
p. 295-302
|
artikel
|
| 10 |
Using relevance queries for identification of read-once functions
|
Chistikov, D. V.
|
|
2013
|
192 |
3 |
p. 359-374
|
artikel
|
Tijdschrift beschrijving