| Publication | Date of Publication | Type |
|---|
| A Pseudo-Random Generator Whose Output is a Normal Sequence | 2023-08-15 | Paper |
| Unconditionally secure short key ciphers based on data compression and randomization | 2023-05-31 | Paper |
| Asymptotically most powerful tests for random number generators | 2021-12-14 | Paper |
| Cryptography in the Information Society | 2021-05-04 | Paper |
| Time-universal data compression | 2020-10-07 | Paper |
| Information-theoretic approach to estimating the capacity of distributed memory systems | 2019-07-19 | Paper |
| A confidence-set approach to signal denoising | 2019-03-13 | Paper |
| Information-theoretic method for classification of texts | 2018-05-24 | Paper |
| Properties of two Shannon's ciphers | 2018-04-16 | Paper |
| Compression-Based Methods for Nonparametric Prediction and Estimation of Some Characteristics of Time Series | 2017-08-08 | Paper |
| Nonparametric Statistical Inference for Ergodic Processes | 2017-07-27 | Paper |
| Time series prediction based on data compression methods | 2017-04-19 | Paper |
| Compression-Based Methods of Statistical Analysis and Prediction of Time Series | 2016-09-09 | Paper |
| Two-faced processes and random number generators | 2015-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3194832 | 2015-10-20 | Paper |
| The Vernam cipher is robust to small deviations from randomness | 2015-07-24 | Paper |
| Complexity of Approximating Functions on Real-Life Computers | 2015-05-19 | Paper |
| Using ideas of Kolmogorov complexity for studying biological texts | 2013-04-15 | Paper |
| Universal codes as a basis for time series testing | 2012-10-19 | Paper |
| On the efficiency and capacity of computers | 2012-06-14 | Paper |
| Fast enumeration algorithm for words with given constraints on run lengths of ones | 2012-03-13 | Paper |
| Constructing perfect steganographic systems | 2011-10-10 | Paper |
| Applications of Universal Source Coding to Statistical Analysis of Time Series | 2011-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3056681 | 2010-11-12 | Paper |
| Application of information-theoretic tests for the analysis of DNA sequences based on Markov chain models | 2010-03-30 | Paper |
| Asymptotically optimal perfect steganographic systems | 2009-10-20 | Paper |
| Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets | 2009-02-24 | Paper |
| Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes | 2008-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505896 | 2008-06-11 | Paper |
| A new type of attacks on block ciphers | 2006-10-26 | Paper |
| Universal codes as a basis for nonparametric testing of serial independence for time series | 2006-10-05 | Paper |
| Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series | 2006-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485306 | 2006-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3376059 | 2006-03-20 | Paper |
| Experimental investigation of forecasting methods based on data compression algorithms | 2005-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5693958 | 2005-09-28 | Paper |
| ``Book stack as a new statistical test for random numbers | 2005-09-14 | Paper |
| Fast codes for large alphabets | 2005-09-01 | Paper |
| Adaptive \(\chi^{2}\) test for discriminating between close hypotheses with a large number of classes and its application to some cryptography problems | 2005-08-17 | Paper |
| Using information theory approach to randomness testing | 2005-07-01 | Paper |
| Using information theory approach to randomness testing | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4830241 | 2004-12-06 | Paper |
| A new test for randomness and its application to some cryptographic problems | 2004-08-19 | Paper |
| Fast encoding of low-entropy sources | 2004-03-30 | Paper |
| An efficient generation method for uniformly distributed random numbers | 2004-01-21 | Paper |
| On asymptotically optimal methods of prediction and adaptive coding for Markov sources | 2002-09-20 | Paper |
| The estimated cost of a search tree on binary words | 2002-08-04 | Paper |
| Efficient method of adaptive arithmetic coding for sources with large alphabets | 2002-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945375 | 2002-03-18 | Paper |
| A simply realizable ideal cryptographic system | 2001-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714013 | 2001-06-10 | Paper |
| Fast enumeration of combinatorial objects | 2001-01-04 | Paper |
| A fast method to transform continued fractions to common fractions | 2001-01-04 | Paper |
| Efficient homophonic coding | 2000-09-07 | Paper |
| Fast coding of low-entropy sources | 2000-09-07 | Paper |
| Fast and efficient construction of an unbiased random sequence | 2000-09-07 | Paper |
| Efficient conversion of random sequences into equiprobable and independent sequences | 2000-06-26 | Paper |
| A fast method for complete randomization of messages. | 1998-11-20 | Paper |
| Application of formal grammars for encoding information sources | 1998-08-19 | Paper |
| Data compression using an ``imaginary sliding window | 1998-07-16 | Paper |
| Homophonic coding with logarithmic memory size | 1998-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4369611 | 1998-01-05 | Paper |
| Using ideas and methods of information theory in analyzing the flexibility of the language of ants and their aptitude to add and subtract small numbers | 1997-01-14 | Paper |
| An effective method for encoding information sources using the fast multiplication algorithm | 1996-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3364523 | 1995-01-01 | Paper |
| The complexity and effectiveness of prediction algorithms | 1994-11-22 | Paper |
| Fast and efficient coding of information sources | 1994-10-04 | Paper |
| Algorithmic approach to the prediction problem | 1994-03-14 | Paper |
| A universal search scheme for a single significant factor in a disjunctive model | 1994-03-08 | Paper |
| A fast on-line adaptive code | 1992-10-11 | Paper |
| Fast adaptive coding algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206688 | 1989-01-01 | Paper |
| Prediction of random sequences and universal coding | 1988-01-01 | Paper |
| Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity | 1986-01-01 | Paper |
| Analysis of the language of ants by information-theoretical methods | 1986-01-01 | Paper |
| Universal retrieval trees | 1985-01-01 | Paper |
| Twice-universal coding | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3705346 | 1984-01-01 | Paper |
| Optimal key for taxons ordered in accordance with their frequencies | 1981-01-01 | Paper |
| Comments on "A source matching approach to finding minimax codes" by Davisson, L. D. and Leon-Garcia, A. | 1981-01-01 | Paper |
| Data compression by means of a ``book stack | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337365 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893804 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3955267 | 1980-01-01 | Paper |
| Coding of a source with unknown but ordered probabilities | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858128 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3878659 | 1977-01-01 | Paper |
