Prikl. Diskr. Mat., 2018, Number 39

Prikladnaya Diskretnaya Matematika

RUS ENG

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

2018, Number 39

Theoretical Backgrounds of Applied Discrete Mathematics
	On extreme joint probabilities of $k$ events chosen from $n$ events Yu. A. Zuev	5–12
	On an invariant for the problem of underdetermined data decomposing L. A. Sholomov	13–32

Mathematical Methods of Cryptography
	EHE: nonce misuse-resistant message authentication S. V. Agievich	33–41

Mathematical Foundations of Computer Security
	Multilevel thematic-hierarchical access control (MLTHS-system) N. A. Gaydamakin	42–57
	The level of negative roles of the hierarchical representation of MROSL DP-model P. N. Devyanin	58–71

Applied Coding Theory
	List decoding of the biorthogonal wavelet code with predetermined code distance on a field of odd characteristic D. V. Litichevskiy	72–77

Applied Automata Theory
	On the local invertibility of finite state information lossless automata O. A. Logachev	78–93

Mathematical Backgrounds of Informatics and Programming
	On complexity of the satisfiability problem of systems over finite posets A. Y. Nikitin, A. N. Rybalov	94–98
	Index intervals in LYaPAS A. A. Pesnyak, D. A. Stefantsov	99–106

Computational Methods in Discrete Mathematics
	Convergence of an iterative algorithm for computing parameters of multi-valued threshold functions A. V. Burdelev	107–115
	Fast algorithm of cluster analysis $k$-medoids I. N. Dmitriev	116–127