Prikl. Diskr. Mat., 2011, Number 4(14)

Prikladnaya Diskretnaya Matematika

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2011, Number 4(14)

Theoretical Foundations of Applied Discrete Mathematics
	Construction of maximal clones in the set of point functions on interval semilattice N. G. Parvatov	5–10
	Locally invertible Boolean functions S. V. Smyshlyaev	11–21
	Homomorphic stability of pairs of small order groups I. A. Shilin, V. V. Kityukov	22–27

Mathematical Methods of Cryptography
	Almost perfect ciphers and authentication codes A. U. Zubov	28–33

Applied Graph Theory
	On minimal vertex 1-extensions of special type graph union M. B. Abrosimov	34–41
	Multiplicities of sums in the explicit formulae for counting fixed length cycles in undirected graphs A. N. Voropaev	42–55
	Some prefractal graph's connectivity characteristics estimations A. A. Kochkarov, L. I. Sennikova	56–61

Logical Design of Discrete Automata
	State assignment in a discrete automaton targeting an implementing low power circuit Yu. V. Pottosin	62–71

Computational Methods in Discrete Mathematics
	Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform I. S. Sergeev	72–88

Discrete Models for Real Processes
	Populations of interacting automata Yu. V. Berezovsky, V. A. Vorob'ev	89–104

Analytic Rewies
	SIBECRYPT'11 review G. P. Agibalov	105–120