- How to Use Expert Advice in the Case when Actual Values of Estimated Events Remain Unknown
- On strong definition of information distance Mikhail V. Vyugin \Lambda
- Do stronger de nitions of randomness exist ? Bruno Durand Vladimir Kanovei y
- Kolmogorov Complexity Conditional to Large Nikolai K. Vereshchagin
- [6, 4]. , - [1]. , -
- Descriptive complexity of computable sequences Bruno Durand ? , Alexander Shen ?? , and Nikolai Vereshchagin ? ? ?
- A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes
- LIMIT COMPLEXITIES REVISITED LAURENT BIENVENU 1
- Algorithmic Rate-Distortion Theory Nikolai Vereshchagin
- Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP
- A computably enumerable undecidable set with low pre x complexity: a simpli ed proof
- Individual Communication Complexity Harry Buhrman y Hartmut Klauck z Nikolai Vereshchagin x Paul Vit anyi {
- Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles
- Kolmogorov|Loveland stochasticity for nite Bruno Durand
- Submitted to Statistical Science Test martingales, Bayes factors,
- On game semantics of the affine and intuitionistic logics (Extended abstract)
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
- Logical operations and Kolmogorov complexity II Andrei A. Muchnik
- ORACLE SEPARATION OF COMPLEXITY CLASSES AND LOWER BOUNDS FOR PERCEPTRONS
- Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of
- Inequalities for Shannon entropy and Kolmogorov complexity
- A new proof Ahlswede | G acs | Korner theorem on common information
- A New class of non Shannon type inequalities for entropies
- Shannon entropy vs. Kolmogorov complexity An. Muchnik 1 and N. Vereshchagin 2?
- High Entropy Random Selection Protocols [Extended Abstract]
- Insuring against loss of evidence in game-theoretic probability A. Philip Dawida
- NP-sets are Co-NP-immune Relative to a Random Oracle
- Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection
- Randomised Individual Communication Complexity Harry Buhrman
- Logical operations and Kolmogorov complexity Alexander Shen
- \Ecologic" Computations B. Durand, N. K. Vereshchagin, M. A. Ushakov
- On Computation and Communication with Small Bias Harry Buhrman
- Increasing Kolmogorov Complexity Harry Buhrman Lance Fortnow y Ilan Newman z Nikolai Vereshchagin x
- NP, Co-NP- (Co-NP- NP-).
- On abstract resource semantics and computabilty Ilya Mezhirov
- Kolmogorov Complexity and Model Selection Nikolay Vereshchagin
- Algorithmic Minimal Sufficient Statistics: a New Definition
- Algorithmic Minimal Sufficient Statistic Nikolay Vereshchagin
- On-line probability, complexity and randomness Alexey Chernov1
- Non-reducible descriptions for conditional Kolmogorov Andrej Muchnik
- Rate Distortion and Denoising of Individual Data Using Kolmogorov complexity
- On the Power of PP Nikolai K.Vereshchagin
- On Algorithmic RateDistortion Function Nikolai Vereshchagin
- Upper semi-lattice of binary strings with the relation \x is simple conditional to y"
- One Property of Cross-Intersecting Families Alexander A. Razborov
- Kolmogorov complexity of enumerating nite sets Nikolai K. Vereshchagin
- , [5] 1.
- Inequalities for Shannon entropies and Kolmogorov complexities Technische Universitat, Berlin
- Kolmogorov Complexity with Error Lance Fortnow
- A General Method to Construct Oracles Realizing Given Relationships between Complexity Classes
- B. Durand, . . , . . June 29, 2002
- Randomized Boolean Decision Trees: Several Nikolai K. Vereshchagin y
- Independent minimum length programs to translate between given Nikolai K. Vereshchagin
- Partitioning multi-dimensional sets in a small number of \uniform" parts
- Combinatorial meaning of Kolmogorov complexity A. Romashchenko, A. Shen, N. Vereshchagin
- Arthur-Merlin Games in Boolean Decision Trees