The following pages link to Andrei Romashchenko (Q235580):
Displayed 40 items.
- Fixed-point tile sets and their applications (Q439933) (← links)
- Item:Q235580 (redirect page) (← links)
- Stability of properties of Kolmogorov complexity under relativization (Q619517) (← links)
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Inequalities for Shannon entropy and Kolmogorov complexity (Q1567410) (← links)
- Pairs of words with nonmaterializable mutual information (Q1582931) (← links)
- Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts (Q2136854) (← links)
- Clustering with respect to the information distance (Q2166746) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Topological arguments for Kolmogorov complexity (Q2354581) (← links)
- The axiomatic power of Kolmogorov complexity (Q2453066) (← links)
- A criterion for extractability of mutual information for a triple of strings (Q2487083) (← links)
- A new class of non-Shannon-type inequalities for entropies (Q2493516) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Quasiperiodicity and Non-computability in Tilings (Q2946338) (← links)
- Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem (Q2946394) (← links)
- Fixed Point and Aperiodic Tilings (Q3533018) (← links)
- Effective Closed Subshifts in 1D Can Be Implemented in 2D (Q3586005) (← links)
- A Random Oracle Does Not Help Extract the Mutual Information (Q3599155) (← links)
- High Complexity Tilings with Sparse Errors (Q3638051) (← links)
- (Q4636642) (← links)
- On the Combinatorial Version of the Slepian–Wolf Problem (Q4682895) (← links)
- The expressiveness of quasiperiodic and minimal shifts of finite type (Q4964767) (← links)
- (Q4986310) (← links)
- (Q5002777) (← links)
- Inequalities for space-bounded Kolmogorov complexity (Q5061387) (← links)
- (Q5089211) (← links)
- (Q5090471) (← links)
- (Q5111219) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- An Operational Characterization of Mutual Information in Algorithmic Information Theory (Q5215467) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311121) (← links)
- Conditional Information Inequalities for Entropic and Almost Entropic Points (Q5346245) (← links)
- A Conditional Information Inequality and Its Combinatorial Applications (Q5375537) (← links)
- Reliable Computations Based on Locally Decodable Codes (Q5449828) (← links)
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)'' (Q5958283) (← links)
- Combinatorial interpretation of Kolmogorov complexity (Q5958285) (← links)
- Sequences of binary strings with relation of conditional simplicity (Q5960250) (← links)
- Conditional and unconditional information inequalities: an algebraic example (Q6230595) (← links)
- On the Non-robustness of Essentially Conditional Information Inequalities (Q6234593) (← links)