default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris Ryabko
B. Ya. Ryabko – Boris Yakovlevich Ryabko
Person information
- affiliation: Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j56]Boris Ryabko
:
Linear hash functions and their applications to error detection and correction. Discret. Math. Algorithms Appl. 16(6): 2350070:1-2350070:20 (2024)- [j55]Boris Ryabko:
Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory. Entropy 26(6): 513 (2024) - [i57]Boris Ryabko:
Building test batteries based on analysing random number generator tests within the framework of algorithmic information theory. CoRR abs/2404.02708 (2024) - [i56]Boris Ryabko:
A general method for the development of constrained codes. CoRR abs/2405.14570 (2024) - 2023
- [j54]Boris Ryabko:
Unconditionally secure short key ciphers based on data compression and randomization. Des. Codes Cryptogr. 91(6): 2201-2212 (2023) - [j53]Boris Ryabko:
Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics. Entropy 25(10): 1406 (2023) - [i55]Boris Ryabko:
Unconditionally secure ciphers with a short key for a source with unknown statistics. CoRR abs/2303.15258 (2023) - [i54]Boris Ryabko:
Reduction of the secret key length in the perfect cipher by data compression and randomisation. CoRR abs/2307.09735 (2023) - [i53]Boris Ryabko:
Unconditionally secure ciphers with a short key for a source with unknown statistics. IACR Cryptol. ePrint Arch. 2023: 441 (2023) - [i52]Boris Ryabko:
Reduction of the secret key length in the perfect cipher by data compression and randomisation. IACR Cryptol. ePrint Arch. 2023: 1036 (2023) - 2022
- [j52]Boris Ryabko, Nadezhda Savina:
Information-Theoretic Method for Assessing the Quality of Translations. Entropy 24(12): 1739 (2022) - [c30]Boris Ryabko:
Using data compression and randomisation to build an unconditionally secure short key cipher. ITW 2022: 238-242 - [i51]Boris Ryabko:
Entropically secure cipher for messages generated by Markov chains with unknown statistics. CoRR abs/2205.03890 (2022) - [i50]Boris Ryabko:
Entropically secure cipher for messages generated by Markov chains with unknown statistics. IACR Cryptol. ePrint Arch. 2022: 571 (2022) - 2021
- [b3]Boris Ryabko, Andrey Fionov:
Cryptography in the Information Society. WorldScientific 2021, ISBN 9789811226151, pp. 1-288 - [j51]Boris Ryabko, Nadezhda Savina:
Using Data Compression to Build a Method for Statistically Verified Attribution of Literary Texts. Entropy 23(10): 1302 (2021) - [j50]Boris Ryabko:
A Pseudo-Random Generator Whose Output is a Normal Sequence. Int. J. Found. Comput. Sci. 32(8): 981-989 (2021) - [c29]Boris Ryabko, Viacheslav Zhuravlev:
Construction of a pseudo-random number generator whose output is a normal sequence. REDUNDANCY 2021: 1-4 - [c28]Boris Ryabko:
Application of algorithmic information theory to calibrate tests of random number generators. REDUNDANCY 2021: 61-65 - [c27]Boris Ryabko, Nadezhda Savina:
Development of an information-theoretical method of attribution of literary texts. REDUNDANCY 2021: 70-73 - [i49]Boris Ryabko:
Calibrating random number generator tests. CoRR abs/2105.06638 (2021) - [i48]Boris Ryabko:
Fast direct access to variable length codes. CoRR abs/2107.14577 (2021) - [i47]Boris Ryabko:
Using data compression and randomization to build an unconditionally secure short key cipher. CoRR abs/2112.10173 (2021) - [i46]Boris Ryabko:
Using data compression and randomization to build an unconditionally secure short key cipher. IACR Cryptol. ePrint Arch. 2021: 1667 (2021) - 2020
- [j49]Boris Ryabko:
Time-Adaptive Statistical Test for Random Number Generators. Entropy 22(6): 630 (2020) - [j48]Boris Ryabko, Anton Rakitskiy:
Application of the Computer Capacity to the Analysis of Processors Evolution. J. Circuits Syst. Comput. 29(8): 2050127:1-2050127:14 (2020) - [c26]Boris Ryabko, Viacheslav Zhuravlev:
The time-adaptive statistical testing for random number generators. ISITA 2020: 344-347 - [c25]Boris Ryabko:
Statistical Testing of Randomness. ISITA 2020: 578-581 - [i45]Boris Ryabko:
The time-adaptive statistical testing for random number generators. CoRR abs/2001.11838 (2020) - [i44]Anton Rakitskiy, Boris Ryabko:
Information Theory as a Means of Determining the Main Factors Affecting the Processors Architecture. CoRR abs/2002.07271 (2020) - [i43]Boris Ryabko:
Linear hash-functions and their applications to error detection and correction. CoRR abs/2008.08955 (2020)
2010 – 2019
- 2019
- [j47]Boris Ryabko:
Time-Universal Data Compression. Algorithms 12(6): 116 (2019) - [j46]Zhanna Reznikova, Jan Levenets, Sofia Panteleeva, Anna Novikovskaya, Boris Ryabko, Natalia Feoktistova, Anna Gureeva, Alexey S. Matveev:
Using the Data-Compression Method for Studying Hunting Behavior in Small Mammals. Entropy 21(4): 368 (2019) - [c24]Boris Ryabko, Andrey Fionov:
Linear Hash Functions as a Means of Distortion-Rate Optimization in Data Embedding. IH&MMSec 2019: 235-238 - [c23]Boris Ryabko:
Time-universal data compression and prediction. ISIT 2019: 562-566 - [c22]Anton Rakitskiy, Boris Ryabko:
Computer Capacity As a Tool For the Processors Development Analysis. REDUNDANCY 2019: 186-190 - [c21]Boris Ryabko, Alexander Soskov, Andrey Fionov:
Gradient Cryptanalysis of Block Cipher CHAM 64/128. REDUNDANCY 2019: 211-215 - [i42]K. S. Chirikhin, B. Ya. Ryabko:
Application of data compression techniques to time series forecasting. CoRR abs/1904.03825 (2019) - [i41]Boris Ryabko:
On asymptotically optimal tests for random number generators. CoRR abs/1912.06542 (2019) - [i40]Boris Ryabko:
On asymptotically optimal tests for random number generators. IACR Cryptol. ePrint Arch. 2019: 1426 (2019) - 2018
- [j45]Boris Ryabko:
Properties of two Shannon's ciphers. Des. Codes Cryptogr. 86(5): 989-995 (2018) - [j44]Boris Ryabko, Anton Rakitskiy:
Theoretical Approach to Performance Evaluation of Supercomputers. J. Circuits Syst. Comput. 27(4): 1850062:1-1850062:13 (2018) - [j43]B. Ya. Ryabko:
Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems. Probl. Inf. Transm. 54(2): 191-198 (2018) - [c20]Boris Ryabko, Anton Rakitskiy:
Investigation of the Processors Evolution Using the Computer Capacity. ISITA 2018: 404-408 - [i39]Boris Ryabko:
Time-universal data compression and prediction. CoRR abs/1809.02978 (2018) - [i38]Boris Ryabko, Aleksandr Soskov:
The distinguishing attack on Speck, Simon, Simeck, HIGHT and LEA. IACR Cryptol. ePrint Arch. 2018: 47 (2018) - 2017
- [j42]Boris Ryabko, Anton Rakitskiy:
An Analytic Method for Estimating the Computation Capacity of Computing Devices. J. Circuits Syst. Comput. 26(5): 1750086:1-1750086:13 (2017) - [j41]B. Ya. Ryabko, Andrey Guskov, Irina Selivanova:
Information-Theoretic method for classification of texts. Probl. Inf. Transm. 53(3): 294-304 (2017) - [c19]Boris Ryabko, Andrey Guskov, Irina Selivanova:
Using data-compressors for statistical analysis of problems on homogeneity testing and classification. ISIT 2017: 121-125 - [i37]Boris Ryabko, Andrey Guskov, Irina Selivanova:
Using data-compressors for statistical analysis of problems on homogeneity testing and classification. CoRR abs/1701.04028 (2017) - [i36]Boris Ryabko, Anton Rakitskiy:
Application of the Computer Capacity to the Analysis of Processors Evolution. CoRR abs/1705.07730 (2017) - 2016
- [b2]Boris Ryabko, Jaakko Astola, Mikhail Malyutov:
Compression-Based Methods of Statistical Analysis and Prediction of Time Series. Springer 2016, ISBN 978-3-319-32251-3, pp. 1-144 - [j40]A. S. Lysyak, B. Ya. Ryabko:
Time series prediction based on data compression methods. Probl. Inf. Transm. 52(1): 92-99 (2016) - [i35]Boris Ryabko:
Information-Theoretical Analysis of Two Shannon's Ciphers. CoRR abs/1605.00214 (2016) - [i34]Boris Ryabko:
Information-Theoretical Analysis of Two Shannon's Ciphers. IACR Cryptol. ePrint Arch. 2016: 429 (2016) - 2015
- [j39]Boris Ryabko:
Complexity of Approximating Functions on Real-Life Computers. Int. J. Found. Comput. Sci. 26(1): 153-158 (2015) - [j38]B. Ya. Ryabko:
The Vernam cipher is robust to small deviations from randomness. Probl. Inf. Transm. 51(1): 82-86 (2015) - [c18]Daniil Ryabko, Boris Ryabko:
Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible. ISIT 2015: 1204-1206 - [i33]Daniil Ryabko, Boris Ryabko:
Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible. CoRR abs/1509.07776 (2015) - [i32]Boris Ryabko:
Two-faced processes and random number generators. CoRR abs/1512.06961 (2015) - [i31]Boris Ryabko:
Two-faced processes and existence of RNG with proven properties. IACR Cryptol. ePrint Arch. 2015: 1217 (2015) - 2013
- [j37]Boris Ryabko, Zhanna Reznikova, Alexey Druzyaka, Sofia Panteleeva:
Using Ideas of Kolmogorov Complexity for Studying Biological Texts. Theory Comput. Syst. 52(1): 133-147 (2013) - [i30]Boris Ryabko:
The Vernam cipher is robust to small deviations from randomness. CoRR abs/1303.2219 (2013) - [i29]Boris Ryabko:
Using Information Theory to Study the Efficiency and Capacity of Caching in the Computer Networks. CoRR abs/1310.3482 (2013) - [i28]Boris Ryabko:
The Vernam cipher is robust to small deviations from randomness. IACR Cryptol. ePrint Arch. 2013: 184 (2013) - 2012
- [j36]Boris Ryabko:
On the efficiency and capacity of computers. Appl. Math. Lett. 25(3): 398-400 (2012) - [j35]Boris Ryabko:
An information-theoretic approach to estimate the capacity of processing units. Perform. Evaluation 69(6): 267-273 (2012) - 2011
- [j34]Boris Ryabko, Daniil Ryabko:
Constructing perfect steganographic systems. Inf. Comput. 209(9): 1223-1230 (2011) - [c17]Boris Ryabko, Daniil Ryabko:
Confidence sets in time-series filtering. ISIT 2011: 2509-2511 - [i27]Boris Ryabko, Pavel Pristavka:
Experimental Investigation of Forecasting Methods Based on Universal Measures. CoRR abs/1104.2239 (2011) - 2010
- [j33]Boris Ryabko:
Using Information Theory to Study Efficiency and Capacity of Computers and Similar Devices. Inf. 1(1): 3-12 (2010) - [j32]Yulia S. Medvedeva, B. Ya. Ryabko:
Fast enumeration algorithm for words with given constraints on run lengths of ones. Probl. Inf. Transm. 46(4): 390-399 (2010) - [j31]Daniil Ryabko, Boris Ryabko:
Nonparametric statistical inference for ergodic processes. IEEE Trans. Inf. Theory 56(3): 1430-1435 (2010) - [i26]Boris Ryabko:
Using Information Theory to Study the Efficiency and Capacity of Computers and Similar Devices. CoRR abs/1003.3619 (2010) - [i25]Boris Ryabko, Daniil Ryabko:
Confidence Sets in Time--Series Filtering. CoRR abs/1012.3059 (2010)
2000 – 2009
- 2009
- [j30]Natalya Usotskaya, Boris Ryabko:
Application of information-theoretic tests for the analysis of DNA sequences based on Markov chain models. Comput. Stat. Data Anal. 53(5): 1861-1872 (2009) - [j29]Boris Ryabko, Zhanna Reznikova:
The Use of Ideas of Information Theory for Studying "Language" and Intelligence in Ants. Entropy 11(4): 836-853 (2009) - [j28]B. Ya. Ryabko, Daniil Ryabko:
Asymptotically optimal perfect steganographic systems. Probl. Inf. Transm. 45(2): 184-190 (2009) - [j27]Boris Ryabko:
Compression-based methods for nonparametric prediction and estimation of some characteristics of time series. IEEE Trans. Inf. Theory 55(9): 4309-4315 (2009) - [c16]Boris Ryabko, Yulia S. Medvedeva:
Fast enumeration of run-length-limited words. ISIT 2009: 640-643 - [c15]Boris Ryabko, Daniil Ryabko:
Using Kolmogorov complexity for understanding some limitations on steganography. ISIT 2009: 2733-2736 - [i24]Boris Ryabko, Daniil Ryabko:
Using Kolmogorov Complexity for Understanding Some Limitations on Steganography. CoRR abs/0901.4023 (2009) - [i23]Boris Ryabko, Zhanna Reznikova:
The use of ideas of Information Theory for studying "language" and intelligence in ants. CoRR abs/0912.4649 (2009) - 2008
- [j26]Boris Ryabko:
Applications of Kolmogorov Complexity and Universal Codes to Nonparametric Estimation of Characteristics of Time Series. Fundam. Informaticae 83(1-2): 177-196 (2008) - [j25]Boris Ryabko, Jaakko Astola, Alex Gammerman:
Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets. IEEE Trans. Inf. Theory 54(8): 3808-3813 (2008) - [c14]Boris Ryabko, Natalie Usotskaya:
DNA-sequence analysis using Markov chain models. ITW 2008: 119-123 - [c13]Boris Ryabko:
Compression-based methods for nonparametric density estimation, on-line prediction, regression and classification for time series. ITW 2008: 271-275 - [c12]Daniil Ryabko, Boris Ryabko:
On hypotheses testing for ergodic processes. ITW 2008: 281-283 - [i22]Daniil Ryabko, Boris Ryabko:
Testing Statistical Hypotheses About Ergodic Processes. CoRR abs/0804.0510 (2008) - [i21]Boris Ryabko:
Applications of Universal Source Coding to Statistical Analysis of Time Series. CoRR abs/0809.1226 (2008) - [i20]Boris Ryabko, Daniil Ryabko:
Constructing Perfect Steganographic Systems. CoRR abs/0809.1593 (2008) - [i19]Boris Ryabko:
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms. CoRR abs/0809.4743 (2008) - 2007
- [j24]B. Ya. Ryabko:
Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes. Probl. Inf. Transm. 43(4): 367-379 (2007) - [c11]Boris Ryabko, Daniil Ryabko:
Information-Theoretic Approach to Steganographic Systems. ISIT 2007: 2461-2464 - [i18]Nikolay N. Ponomarenko, Vladimir V. Lukin, Karen O. Egiazarian, Jaakko Astola, Boris Ryabko:
Fast Recursive Coding Based on Grouping of Symbols. CoRR abs/0708.2893 (2007) - [i17]Boris Ryabko:
Compression-based methods for nonparametric density estimation, on-line prediction, regression and classification for time series. CoRR abs/cs/0701036 (2007) - 2006
- [j23]Boris Ryabko, Jaakko Astola, Alex Gammerman:
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series. Theor. Comput. Sci. 359(1-3): 440-448 (2006) - [i16]Boris Ryabko, Jaakko Astola, Alex Gammerman:
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.. Kolmogorov Complexity and Applications 2006 - [i15]Boris Ryabko:
Fast Enumeration of Combinatorial Objects. CoRR abs/cs/0601069 (2006) - [i14]Boris Ryabko, Jaakko Astola:
Universal Codes as a Basis for Time Series Testing. CoRR abs/cs/0602084 (2006) - [i13]Boris Ryabko, Daniil Ryabko:
Provably Secure Universal Steganographic Systems. CoRR abs/cs/0606085 (2006) - [i12]Boris Ryabko, Daniil Ryabko:
Provably Secure Universal Steganographic Systems. IACR Cryptol. ePrint Arch. 2006: 63 (2006) - [i11]Sergey Doroshenko, Boris Ryabko:
The experimental distinguishing attack on RC4. IACR Cryptol. ePrint Arch. 2006: 70 (2006) - [i10]Sergey Doroshenko, Andrei Fionov, A. Lubkin, V. A. Monarev, Boris Ryabko:
On ZK-Crypt, Book Stack, and Statistical Tests. IACR Cryptol. ePrint Arch. 2006: 196 (2006) - 2005
- [b1]Boris Ryabko, Andrei Fionov:
Basics of Contemporary Cryptography for IT Practitioners. Series on Coding Theory and Cryptology 1, WorldScientific 2005, ISBN 978-981-256-405-4, pp. 1-208 - [j22]B. Ya. Ryabko, V. A. Monarev:
Experimental investigation of forecasting methods based on data compression algorithms. Probl. Inf. Transm. 41(1): 65-69 (2005) - [j21]B. Ya. Ryabko, V. A. Monarev, Yu. I. Shokin:
A New Type of Attacks on Block Ciphers. Probl. Inf. Transm. 41(4): 385-394 (2005) - [c10]Boris Ryabko, Jaakko Astola:
Universal codes as a basis for nonparametric testing of serial independence for time series. ISIT 2005: 1573-1577 - [i9]Boris Ryabko, Jaakko Astola, Karen O. Egiazarian:
Fast Codes for Large Alphabets. CoRR abs/cs/0504005 (2005) - [i8]B. Ya. Ryabko, V. A. Monarev:
Using Information Theory Approach to Randomness Testing. CoRR abs/cs/0504006 (2005) - [i7]Boris Ryabko, Jaakko Astola:
Prediction of Large Alphabet Processes and Its Application to Adaptive Source Coding. CoRR abs/cs/0504079 (2005) - [i6]Boris Ryabko, Jaakko Astola, Alex Gammerman:
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series. CoRR abs/cs/0505079 (2005) - [i5]Boris Ryabko, Jaakko Astola:
Universal Codes as a Basis for Nonparametric Testing of Serial Independence for Time Series. CoRR abs/cs/0506094 (2005) - 2004
- [j20]B. Ya. Ryabko, Andrey Pestunov:
"Book Stack" as a New Statistical Test for Random Numbers. Probl. Inf. Transm. 40(1): 66-71 (2004) - [j19]Joe Suzuki, Boris Ryabko:
Coding combinatorial sources with costs. IEEE Trans. Inf. Theory 50(5): 925-928 (2004) - [c9]Boris Ryabko, Jaakko Astola:
Universal Coding of Function Spaces as a Model for Signal Compression. Data Compression Conference 2004: 382-388 - [c8]Boris Ryabko, Jaakko Astola:
Adaptive Coding and Prediction of Sources with Large and Infinite Alphabet. Data Compression Conference 2004: 560 - [c7]Boris Ryabko, Jaakko Astola:
Fast Codes for Large Alphabet Sources and Its Application to Block Encoding. Data Compression Conference 2004: 561 - [c6]Boris Ryabko, Jaakko Astola:
Prediction and adaptive coding of sources with large or infinite alphabet. ISIT 2004: 24 - [c5]Boris Ryabko, V. A. Monarev, Yu. I. Shokin:
Using universal coding approach to randomness testing. ISIT 2004: 302 - 2003
- [j18]Boris Ryabko, Jaakko Astola, Karen O. Egiazarian:
Fast codes for large alphabets. Commun. Inf. Syst. 3(2): 139-152 (2003) - [j17]Boris Ryabko, Jorma Rissanen:
Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions. IEEE Commun. Lett. 7(1): 33-35 (2003) - [j16]B. Ya. Ryabko, V. S. Stognienko, Yu. I. Shokin:
Adaptive χ2 Test for Discriminating between Close Hypotheses with a Large Number of Classes and Its Application to Some Cryptography Problems. Probl. Inf. Transm. 39(2): 207-215 (2003) - [c4]Boris Ryabko, G. Mrchokov, Karen O. Egiazarian, Jaakko Astola:
The fast algorithm for the block codes and its application to image compression. ICIP (2) 2003: 205-206 - [i4]B. Ya. Ryabko, V. A. Monarev:
Using Information Theory Approach to Randomness Testing. IACR Cryptol. ePrint Arch. 2003: 127 (2003) - 2002
- [j15]Boris Ryabko, Flemming Topsøe:
On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources. J. Complex. 18(1): 224-241 (2002) - [j14]B. Ya. Ryabko, Elena Matchikina:
An Efficient Generation Method for Uniformly Distributed Random Numbers. Probl. Inf. Transm. 38(1): 20-25 (2002) - [i3]Boris Ryabko:
The nonprobabilistic approach to learning the best prediction. Electron. Colloquium Comput. Complex. TR02 (2002) - [i2]Boris Ryabko:
Adaptive chi-square test and its application to some cryptographic problems. IACR Cryptol. ePrint Arch. 2002: 30 (2002) - 2001
- [j13]Boris Ryabko:
The nonprobabilistic approach to learning the best prediction. Electron. Trans. Artif. Intell. 5(B): 37-45 (2001) - [j12]Zhanna Reznikova, Boris Ryabko:
A Study of Ants' Numerical Competence. Electron. Trans. Artif. Intell. 5(B): 111-126 (2001) - [j11]Alexey Fedotov, Boris Ryabko:
The estimated cost of a search tree on binary words. IEEE Trans. Inf. Theory 47(1): 326-329 (2001) - [i1]Boris Ryabko:
The simple ideal cipher system. IACR Cryptol. ePrint Arch. 2001: 46 (2001) - 2000
- [j10]Boris Ryabko, Elena Matchikina:
Fast and efficient construction of an unbiased random sequence. IEEE Trans. Inf. Theory 46(3): 1090-1093 (2000)
1990 – 1999
- 1999
- [j9]Boris Ryabko, Andrei Fionov:
Efficient homophonic coding. IEEE Trans. Inf. Theory 45(6): 2083-2091 (1999) - [j8]Boris Ryabko, Marina P. Sharova:
Fast coding of low-entropy sources. IEEE Trans. Inf. Theory 45(7): 2612-2615 (1999) - [c3]Boris Ryabko, Andrei Fionov:
Fast and Space-Efficient Adaptive Arithmetic Coding. IMACC 1999: 270-279 - 1997
- [c2]Boris Ryabko, Andrei Fionov:
Homophonic Coding with Logarithmic Memory Size. ISAAC 1997: 253-262 - 1996
- [j7]Boris Ryabko, Zhanna Reznikova:
Using Shannon entropy and Kolmogorov complexity to study the communicative system and cognitive capacities in ants. Complex. 2(2): 37-42 (1996) - [c1]Boris Ryabko, Andrei Fionov:
A Fast and Efficient Homophonic Coding Algorithm. ISAAC 1996: 427-435 - 1994
- [j6]Boris Ryabko:
The Complexity and Effectiveness of Prediction Algorithms. J. Complex. 10(3): 281-295 (1994) - [j5]Boris Ryabko:
Fast and efficient coding of information sources. IEEE Trans. Inf. Theory 40(1): 96-99 (1994) - 1992
- [j4]Boris Ryabko:
A fast on-line adaptive code. IEEE Trans. Inf. Theory 38(4): 1400-1404 (1992)
1980 – 1989
- 1985
- [j3]R. E. Krichevsky, B. Ya. Ryabko:
Universal retrieval trees. Discret. Appl. Math. 12(3): 293-302 (1985) - 1981
- [j2]R. E. Krichevskii, B. Ya. Ryabko, A. Yu. Haritonov:
Optimal key for taxons ordered in accordance with their frequencies. Discret. Appl. Math. 3(1): 67-72 (1981) - [j1]Boris Ryabko:
Comments on 'A source matching approach to finding minimax codes' by L. D. Davisson and A. Leon-Garcia. IEEE Trans. Inf. Theory 27(6): 780-781 (1981)
Coauthor Index
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.
last updated on 2024-09-22 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
