Lista de artigos

Edição Título Arquivo
Volume 52, Nº 3 (2016) Estimates for discontinuity jumps of information characteristics of quantum systems and channels
Shirokov M.
Volume 54, Nº 4 (2018) Exponentially Ramsey Sets
Sagdeev A.
Volume 53, Nº 2 (2017) Fast discrete Fourier transform on local fields of positive characteristic
Lukomskii S., Vodolazov A.
Volume 53, Nº 2 (2017) Fast protocols for leader election and spanning tree construction in a distributed network
Vyalyi M., Khuziev I.
Volume 54, Nº 1 (2018) Gaussian Two-Armed Bandit and Optimization of Batch Data Processing
Kolnogorov A.
Volume 54, Nº 1 (2018) General Independence Sets in Random Strongly Sparse Hypergraphs
Semenov A., Shabanov D.
Volume 55, Nº 3 (2019) Generalization of IPP Codes and IPP Set Systems
Egorova E.
Volume 53, Nº 2 (2017) Generalized error-locating codes with component codes over the same alphabet
Zhilin I., Zyablov V.
Volume 52, Nº 2 (2016) Generalized Preparata codes and 2-resolvable Steiner quadruple systems
Zinoviev V., Zinoviev D.
Volume 55, Nº 2 (2019) Geometry of Translations on a Boolean Cube
Vyalyi M., Leontiev V.
Volume 54, Nº 2 (2018) Improved Frankl–Rödl Theorem and Some of Its Geometric Consequences
Sagdeev A.
Volume 53, Nº 4 (2017) Independence Numbers of Random Subgraphs of Some Distance Graph
Derevyanko N., Kiselev S.
Volume 54, Nº 3 (2018) Infinite Spectra of First-Order Properties for Random Hypergraphs
Popova S.
Volume 54, Nº 2 (2018) Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems
Ryabko B.
Volume 53, Nº 3 (2017) Information-Theoretic method for classification of texts
Ryabko B., Gus’kov A., Selivanova I.
Volume 52, Nº 1 (2016) Interactive function computation via polar coding
Gülcü T., Barg A.
Volume 52, Nº 1 (2016) Lattice flows in networks
Shmatkov V.
Volume 53, Nº 1 (2017) Linear algorithm for minimal rearrangement of structures
Gorbunov K., Lyubetsky V.
Volume 52, Nº 4 (2016) List decoding for a multiple access hyperchannel
Shchukin V.
Volume 54, Nº 2 (2018) Maximum Remaining Service Time in Infinite-Server Queues
Lebedev A.
Volume 53, Nº 2 (2017) MDS codes in Doob graphs
Bespalov E., Krotov D.
Volume 53, Nº 1 (2017) Model of a random geometric graph with attachment to the coverage area
Khoroshenkikh S., Dainiak A.
Volume 54, Nº 1 (2018) Mollard Code as a Robust Nonlinear Code
Kovalevskaya D.
Volume 52, Nº 3 (2016) Multicomponent codes with maximum code distance
Gabidulin E., Pilipchuk N.
Volume 54, Nº 3 (2018) New Good’s Type Kronecker Power Expansions
Bespalov M.
26 - 50 de 115 resultados << < 1 2 3 4 5 > >>