Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2006
- Grigori G. Amosov:
Remark on the additivity conjecture for a quantum depolarizing channel. Probl. Inf. Transm. 42(2): 69-76 (2006) - Maxim A. Babenko:
On flows in simple bidirected and skew-symmetric networks. Probl. Inf. Transm. 42(4): 356-370 (2006) - Alexander M. Barg, Dmitry Yu. Nogin:
Spectral approach to linear programming bounds on codes. Probl. Inf. Transm. 42(2): 77-89 (2006) - Leonid A. Bassalygo, Stefan M. Dodunekov, Victor A. Zinoviev, Tor Helleseth:
The Grey-Rankin bound for nonbinary codes. Probl. Inf. Transm. 42(3): 197-203 (2006) - Michael L. Blank:
On raw coding of chaotic dynamics. Probl. Inf. Transm. 42(1): 64-68 (2006) - I. M. Boyarinov:
Two-dimensional array codes correcting rectangular burst errors. Probl. Inf. Transm. 42(2): 90-105 (2006) - Marat V. Burnashev:
Code spectrum and the reliability function: Binary symmetric channel. Probl. Inf. Transm. 42(4): 263-281 (2006) - Pao-Liu Chow, Rafail Z. Khasminskii:
On-line estimation of smooth signals with partial observation. Probl. Inf. Transm. 42(4): 330-339 (2006) - Arkadii G. D'yachkov, Pavel A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, Anthony J. Macula, David C. Torney, Scott White:
Remark on "On DNA Codes" published in Probl. Peredachi Inf., 2005, no. 4. Probl. Inf. Transm. 42(2): 166 (2006) - V. R. Fatalov:
Exact asymptotics of large deviations of stationary Ornstein-Uhlenbeck processes for L p-functionals, p > 0. Probl. Inf. Transm. 42(1): 46-63 (2006) - Sergei V. Fedorenko:
A method for computation of the discrete Fourier transform over a finite field. Probl. Inf. Transm. 42(2): 139-151 (2006) - Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Remark on "Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging" published in Probl. Peredachi Inf., 2005, no. 4. Probl. Inf. Transm. 42(3): 262 (2006) - Andrei N. Kolmogorov:
Contemporary debates on the nature of mathematics. Probl. Inf. Transm. 42(4): 379-389 (2006) - Evgeny Lakshtanov, E. S. Langvagen:
Entropy of multidimensional cellular automata. Probl. Inf. Transm. 42(1): 38-45 (2006) - Ivan N. Landjev, Assya Rousseva:
An extension theorem for arcs and linear codes. Probl. Inf. Transm. 42(4): 319-329 (2006) - Vladimir K. Leont'ev, S. A. Mukhina:
On fragments of words. Probl. Inf. Transm. 42(3): 230-233 (2006) - A. V. Los':
Construction of perfect q-ary codes by switchings of simple components. Probl. Inf. Transm. 42(1): 30-37 (2006) - A. G. Malyshkin:
Limit dynamics for stochastic models of data exchange in parallel computation networks. Probl. Inf. Transm. 42(3): 234-250 (2006) - Carlos Medina, Vladimir R. Sidorenko, Victor V. Zyablov:
Error exponents for product convolutional codes. Probl. Inf. Transm. 42(3): 167-182 (2006) - Yakir Ovadia, Shraga I. Bross:
On the reliability exponent of the additive exponential noise channel. Probl. Inf. Transm. 42(4): 298-318 (2006) - Maksim E. Shirokov:
On the structure of optimal sets for a quantum channel. Probl. Inf. Transm. 42(4): 282-297 (2006) - A. N. Starovoitov:
Invariance of the stationary distribution of states of multimode service policy networks. Probl. Inf. Transm. 42(4): 371-378 (2006) - S. A. Stepanov:
A new class of quaternary codes. Probl. Inf. Transm. 42(1): 1-9 (2006) - S. A. Stepanov:
A new class of nonlinear sensary codes. Probl. Inf. Transm. 42(2): 114-122 (2006) - S. A. Stepanov:
A new class of nonlinear Q-ary codes. Probl. Inf. Transm. 42(3): 204-216 (2006) - V. V. Tarasov:
To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements. Probl. Inf. Transm. 42(2): 152-157 (2006) - V. V. Tarasov:
Construction of virus-free switching circuits. Probl. Inf. Transm. 42(4): 340-343 (2006) - G. Sh. Tsitsiashvili, M. A. Osipova:
Probability distribution in varying-structure queueing networks. Probl. Inf. Transm. 42(2): 158-165 (2006) - Boris S. Tsybakov:
A different approach to finding the capacity of a Gaussian vector channel. Probl. Inf. Transm. 42(3): 183-196 (2006) - Alexander A. Vladimirov, Alexandre N. Rybko, Senya B. Shlosman:
Self-averaging property of queuing systems. Probl. Inf. Transm. 42(4): 344-355 (2006)
skipping 5 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-28 05:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint