![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 31 matches
- 2011
- Maxim A. Babenko, Tatiana Starikovskaya:
Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47(1): 28-33 (2011) - Maxim A. Babenko, Timofey A. Urbanovich:
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph. Probl. Inf. Transm. 47(3): 269 (2011) - Tsonka Baicheva
, Svetlana Topalova
:
Classification of optimal (v, 4, 1) binary cyclically permutable constant-weight codes and cyclic 2-(v, 4, 1) designs with v ≤ 76. Probl. Inf. Transm. 47(3): 224 (2011) - Vladimir M. Blinovsky:
Intersection theorem for finite permutations. Probl. Inf. Transm. 47(1): 34 (2011) - Vladimir M. Blinovsky:
Remark on the reliability function of a symmetric channel under list decoding. Probl. Inf. Transm. 47(2): 85-88 (2011) - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Woven convolutional graph codes with large free distances. Probl. Inf. Transm. 47(1): 1-14 (2011) - A. L. Chmora:
Key masking using biometry. Probl. Inf. Transm. 47(2): 201-215 (2011) - Pao-Liu Chow, Rafail Z. Khasminskii:
Method of Lyapunov functions for analysis of absorption and explosion in Markov chains. Probl. Inf. Transm. 47(3): 232 (2011) - Rumen N. Daskalov
, Elena Metodieva:
New (n, r)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23). Probl. Inf. Transm. 47(3): 217 (2011) - Sergey A. Dudin
, Olga S. Dudina
:
Call center operation model as a MAP/PH/N/R-N system with impatient customers. Probl. Inf. Transm. 47(4): 364-377 (2011) - Alexey A. Frolov
, Victor V. Zyablov
:
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs. Probl. Inf. Transm. 47(4): 327-341 (2011) - Konstantin Yu. Gorbunov
, Vassily A. Lyubetsky
:
The tree nearest on average to a given set of trees. Probl. Inf. Transm. 47(3): 274 (2011) - Darya I. Kovalevskaya:
On metric rigidity for some classes of codes. Probl. Inf. Transm. 47(1): 15-27 (2011) - Alexey Kreshchuk
, Alexander A. Davydov
, Victor V. Zyablov
:
Codes for MIMO transmission based on orthogonal sequences. Probl. Inf. Transm. 47(4): 305-326 (2011) - Oleg F. Kurmaev:
Enumeration of constant-weight run-length limited binary sequences. Probl. Inf. Transm. 47(1): 64-80 (2011) - Vadim A. Malyshev:
Critical states of strongly interacting many-particle systems on a circle. Probl. Inf. Transm. 47(2): 190-200 (2011) - G. A. Margulis:
Random minkowski theorem. Probl. Inf. Transm. 47(4): 398-402 (2011) - Vyacheslav V. Prelov:
Generalization of a Pinsker problem. Probl. Inf. Transm. 47(2): 98-116 (2011) - Vladimir R. Sidorenko
, Georg Schmidt:
A linear algebraic approach to multisequence shift-register synthesis. Probl. Inf. Transm. 47(2): 149-165 (2011) - A. N. Starovoitov:
On conditions for a product-form stationary probability distribution of states of a multimode service network. Probl. Inf. Transm. 47(1): 46-56 (2011) - G. Sh. Tsitsiashvili
, M. A. Osipova:
A zero-or-one law in aggregated closed queueing networks. Probl. Inf. Transm. 47(1): 57-63 (2011) - Boris S. Tsybakov:
On a model and capacity of MIMO channels. Probl. Inf. Transm. 47(2): 89-97 (2011) - Nikita D. Vvedenskaya:
Configuration of overloaded servers with dynamic routing. Probl. Inf. Transm. 47(3): 289 (2011) - Mikhail N. Vyalyi
:
On regular realizability problems. Probl. Inf. Transm. 47(4): 342-352 (2011) - Vladimir V. V'yugin:
On universal algorithms for adaptive forecasting. Probl. Inf. Transm. 47(2): 166-189 (2011) - Antonia Wachter, Vladimir R. Sidorenko
, Martin Bossert, Victor V. Zyablov
:
On (Partial) unit memory codes based on Gabidulin codes. Probl. Inf. Transm. 47(2): 117-129 (2011) - Anna Wierzbicka
:
Common language of all people: The innate language of thought. Probl. Inf. Transm. 47(4): 378-397 (2011) - Iosif Abramovich Ovseevich: In memoriam. Probl. Inf. Transm. 47(1): 81-84 (2011)
- Alexander V. Zhozhikashvili, Vadim L. Stefanuk:
Properties of a folded category constructed from a category and a lattice. Probl. Inf. Transm. 47(4): 353-363 (2011) - Maksim E. Zhukovskii:
On a sequence of random distance graphs subject to the zero-one law. Probl. Inf. Transm. 47(3): 251 (2011)
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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 2025-02-17 19:56 CET 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