Prikl. Diskr. Mat., 2015, Number 2(28)

Prikladnaya Diskretnaya Matematika

RUS ENG

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

2015, Number 2(28)

Theoretical Foundations of Applied Discrete Mathematics
	Statistical methods of search for coordinate set on which a random vector has bans O. V. Denisov	5–20
	Compound Poisson approximation of the number distribution for monotone strings of fixed length in a random sequence A. A. Minakov	21–29
	Almost nilpotent varieties of Leibniz algebras Yu. Yu. Frolova, O. V. Shulezhko	30–36
	Functional decomposability criteria for quadratic threshold Boolean functions A. N. Shurupov	37–45

Mathematical Methods of Cryptography
	Cryptanalysis of Ushakov–Shpilrain's authentication protocol based on the twisted conjugacy problem M. N. Gornova, E. G. Kukina, V. A. Romankov	46–53
	On generic complexity of the quadratic residuosity problem A. N. Rybalov	54–58

Mathematical Foundations of Computer Security
	Developing safe protocol for distributed task-based CTF holding system N. I. Anisenya	59–70
	Covert timing channels over HTTP cache-control headers D. N. Kolegov, O. V. Broslavsky, N. E. Oleksov	71–85

Applied Graph Theory
	Properties of minimal primitive digraphs V. M. Fomichev	86–96

Computational Methods in Discrete Mathematics
	On the complexity of discrete logarithm problem in an interval in a finite cyclic group with efficient inversion M. V. Nikolaev	97–102

Discrete Models for Real Processes
	Cellular automaton simulation of the fracture process for brittle materials D. V. Alekseev, G. A. Kazunina, A. V. Cherednichenko	103–117