Geodesic

Tome (2009) no. 2

Sommaire

Foreword
p. 5-8
Programming language LYaPAS
p. 9-25
Discrete automata on semilattices
p. 26-49
Realization of functions on semilattices by switching networks
p. 50-55
Completeness problems for descrete functions
p. 56-78
Algorithms for constructing the shortest allowable partitions of finite sets
p. 79-95
Design and research of the parallel combinatorial algorithms
p. 96-103
50 years of cryptography in Tomsk State University
p. 104-126
The method for messages automatic encryption
p. 127-137