Остановите войну!
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 34 matches
- 2017
- Tsonka Stefanova Baicheva, Svetlana Topalova:
Optimal conflict-avoiding codes for 3, 4 and 5 active users. Probl. Inf. Transm. 53(1): 42-50 (2017) - A. M. Balitskii, A. V. Savchik, R. F. Gafarov, Ivan A. Konovalenko:
On projectively invariant points of an oval with a distinguished exterior line. Probl. Inf. Transm. 53(3): 279-283 (2017) - Leonid A. Bassalygo, Victor A. Zinoviev:
Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes. Probl. Inf. Transm. 53(1): 51-54 (2017) - Leonid A. Bassalygo, Victor A. Zinoviev:
Erratum to: "Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes". Probl. Inf. Transm. 53(3): 305 (2017) - Evgeny Bespalov, Denis S. Krotov:
MDS codes in Doob graphs. Probl. Inf. Transm. 53(2): 136-154 (2017) - Evgeny Bespalov, Denis S. Krotov:
Erratum to: "MDS codes in Doob graphs". Probl. Inf. Transm. 53(3): 306 (2017) - A. V. Bessalov, O. V. Tsygankova:
Number of curves in the generalized Edwards form with minimal even cofactor of the curve order. Probl. Inf. Transm. 53(1): 92-101 (2017) - A. V. Bobu, A. E. Kupriyanov, Andrei M. Raigorodskii:
On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections. Probl. Inf. Transm. 53(4): 319-342 (2017) - Holger Boche, Ullrich J. Mönich:
Spaceability for sets of bandlimited input functions and stable linear time-invariant systems with finite time blowup behavior. Probl. Inf. Transm. 53(2): 164-182 (2017) - Andrei B. Bogatyrev, Sergei A. Goreinov, Sergei Yu. Lyamaev:
Analytical approach to multiband filter synthesis and comparison to other approaches. Probl. Inf. Transm. 53(3): 260-273 (2017) - Evgeny V. Burnaev, G. K. Golubev:
On One Problem in Multichannel Signal Detection. Probl. Inf. Transm. 53(4): 368-380 (2017) - Marat V. Burnashev:
Two comparison theorems for distributions of Gaussian quadratic forms. Probl. Inf. Transm. 53(3): 203-214 (2017) - Marat V. Burnashev:
On Detection of Gaussian Stochastic Sequences. Probl. Inf. Transm. 53(4): 349-367 (2017) - Marco Dalai:
A note on random coding bounds for classical-quantum channels. Probl. Inf. Transm. 53(3): 222-228 (2017) - Nikita Mikhailovich Derevyanko, S. G. Kiselev:
Independence Numbers of Random Subgraphs of Some Distance Graph. Probl. Inf. Transm. 53(4): 307-318 (2017) - Konstantin Yu. Gorbunov, Vassily A. Lyubetsky:
Linear algorithm for minimal rearrangement of structures. Probl. Inf. Transm. 53(1): 55-72 (2017) - B. M. Gurevich:
Entropy of a stationary process and entropy of a shift transformation in its sample space. Probl. Inf. Transm. 53(2): 103-113 (2017) - Fedor I. Ivanov:
A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices. Probl. Inf. Transm. 53(3): 229-241 (2017) - O. V. Kamlovskii:
Occurrence numbers for vectors in cycles of output sequences of binary combining generators. Probl. Inf. Transm. 53(1): 84-91 (2017) - S. N. Khoroshenkikh, A. B. Dainiak:
Model of a random geometric graph with attachment to the coverage area. Probl. Inf. Transm. 53(1): 73-83 (2017) - Vladimir S. Lebedev:
Adaptive search for one defective in the additive group testing model. Probl. Inf. Transm. 53(3): 274-278 (2017) - Alexey V. Lebedev:
Stochastic Operation Induced by Group Allocation of Particles and Generalized Branching Processes. Probl. Inf. Transm. 53(4): 381-390 (2017) - Vladimir K. Leont'ev:
On Spectra of Linear Codes. Probl. Inf. Transm. 53(4): 343-348 (2017) - Sergei Feodorovich Lukomskii, A. M. Vodolazov:
Fast discrete Fourier transform on local fields of positive characteristic. Probl. Inf. Transm. 53(2): 155-163 (2017) - Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Propelinear codes related to some classes of optimal codes. Probl. Inf. Transm. 53(3): 251-259 (2017) - Vyacheslav V. Prelov:
On coupling of probability distributions and estimating the divergence through variation. Probl. Inf. Transm. 53(3): 215-221 (2017) - B. Ya. Ryabko, Andrey Guskov, Irina Selivanova:
Information-Theoretic method for classification of texts. Probl. Inf. Transm. 53(3): 294-304 (2017) - I. S. Sergeev:
On the real complexity of a complex DFT. Probl. Inf. Transm. 53(3): 284-293 (2017) - S. A. Stepanov:
Nonlinear q-ary codes with large code distance. Probl. Inf. Transm. 53(3): 242-250 (2017) - Shashank Vatedka, Navin Kashyap:
Some "goodness" properties of LDA lattices. Probl. Inf. Transm. 53(1): 1-29 (2017)
skipping 4 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-05-07 07:40 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