IP = PSPACE: Simplified Proof. - Alexander Shen 001 (J. ACM, 1992)

Algebra. - Israel M. Gelfand; Alexander Shen 001 (Birkhäuser, 1993)

Low-degree Tests. - Katalin Friedl; Zsolt Hátsági; Alexander Shen 001 (SODA, 1994)

Relations Between Varieties of Kolmogorov Complexities. - Vladimir A. Uspensky; Alexander Shen 001 (Math. Syst. Theory, 1996)

Algorithms and programming - problems and solutions. - Alexander Shen 001 (Birkhäuser, 1997)

Inequalities for Shannon entropies and Kolmogorov complexities. - Daniel Hammer; Andrei E. Romashchenko; Alexander Shen 001; Nikolai K. Vereshchagin (CCC, 1997)

A Strange Application of Kolmogorov Complexity. - Daniel Hammer; Alexander Shen 001 (Theory Comput. Syst., 1998)

Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y". - Andrei A. Muchnik; Andrei E. Romashchenko; Alexander Shen 001; Nikolai K. Vereshchagin (CCC, 1999)

Discussion on Kolmogorov Complexity and Statistical Analysis. - Alexander Shen 001 (Comput. J., 1999)

Inequalities for Shannon Entropy and Kolmogorov Complexity. - Daniel Hammer; Andrei E. Romashchenko; Alexander Shen 001; Nikolai K. Vereshchagin (J. Comput. Syst. Sci., 2000)

Basic set theory. - Alexander Shen 001; Nikolai K. Vereshchagin (American Mathematical Society, 2002)

Upper semi-lattice of binary strings with the relation "x is simple conditional to y". - Alexey V. Chernov; Andrei A. Muchnik; Andrei E. Romashchenko; Alexander Shen 001; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2002)

Descriptive complexity of computable sequences. - Bruno Durand 001; Alexander Shen 001; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2002)

Combinatorial interpretation of Kolmogorov complexity. - Andrei E. Romashchenko; Alexander Shen 001; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2002)

Logical operations and Kolmogorov complexity. - Alexander Shen 001; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2002)

Non-reducible descriptions for conditional Kolmogorov complexity - Andrei A. Muchnik; Alexander Shen 001; Nikolai K. Vereshchagin; Michael V. Vyugin (Electron. Colloquium Comput. Complex., 2004)

Partitioning multi-dimensional sets in a small number of "uniform" parts - Noga Alon; Ilan Newman; Alexander Shen 001; Gábor Tardos; Nikolai K. Vereshchagin (Electron. Colloquium Comput. Complex., 2005)

Combinatorial proof of Muchnik's theorem. - Alexander Shen 001 (Kolmogorov Complexity and Applications, 2006)

Multisource algorithmic information theory - Alexander Shen 001 (Electron. Colloquium Comput. Complex., 2006)

Non-reducible descriptions for conditional Kolmogorov complexity. - Andrej Muchnik; Alexander Shen 001; Mikhail Ustinov; Nikolai K. Vereshchagin; Michael V. Vyugin (Theor. Comput. Sci., 2007)

On-Line Probability, Complexity and Randomness. - Alexey V. Chernov; Alexander Shen 001; Nikolai K. Vereshchagin; Vladimir Vovk (ALT, 2008)

Prequential Randomness. - Vladimir Vovk; Alexander Shen 001 (ALT, 2008)

Sparse sets. - Laurent Bienvenu; Andrei E. Romashchenko; Alexander Shen 001 (JAC, 2008)

Limit complexities revisited. - Laurent Bienvenu; Andrej Muchnik; Alexander Shen 001; Nikolay Veraschagin (STACS, 2008)

Algorithmic randomness and splitting of supermartingales - Andrej Muchnik; Alexey V. Chernov; Alexander Shen 001 (CoRR, 2008)

Fixed Point and Aperiodic Tilings. - Bruno Durand 001; Alexander Shen 001; Andrei E. Romashchenko (Electron. Colloquium Comput. Complex., 2008)

A Simple Proof of Miller-Yu Theorem. - Laurent Bienvenu; Wolfgang Merkle; Alexander Shen 001 (Fundam. Informaticae, 2008)

Complex tilings. - Bruno Durand 001; Leonid A. Levin; Alexander Shen 001 (J. Symb. Log., 2008)

High Complexity Tilings with Sparse Errors. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (ICALP (1), 2009)

Algorithmic Information Theory and Foundations of Probability. - Alexander Shen 001 (RP, 2009)

Fixed Point Theorem and Aperiodic Tilings. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (Bull. EATCS, 2009)

Algorithms and Programming - Problems and Solutions, Second Edition. - Alexander Shen 001 (Springer, 2010)

Effective Closed Subshifts in 1D Can Be Implemented in 2D. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (Fields of Logic and Computation, 2010)

Ergodic-Type Characterizations of Algorithmic Randomness. - Laurent Bienvenu; Adam R. Day; Ilya Mezhirov; Alexander Shen 001 (CiE, 2010)

1D Effectively Closed Subshifts and 2D Tilings. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (JAC, 2010)

Decomposition Complexity. - Alexander Shen 001 (JAC, 2010)

Game interpretation of Kolmogorov complexity - Andrej Muchnik; Ilya Mezhirov; Alexander Shen 001; Nikolai K. Vereshchagin (CoRR, 2010)

Sets of k-Independent Strings. - Yen-Wu Ti; Ching-Lueh Chang; Yuh-Dauh Lyuu; Alexander Shen 001 (Int. J. Found. Comput. Sci., 2010)

Limit Complexities Revisited. - Laurent Bienvenu; Andrej Muchnik; Alexander Shen 001; Nikolai K. Vereshchagin (Theory Comput. Syst., 2010)

Prequential randomness and probability. - Vladimir Vovk; Alexander Shen 001 (Theor. Comput. Sci., 2010)

Kolmogorov Complexity as a Language. - Alexander Shen 001 (CSR, 2011)

Algorithmic tests and randomness with respect to a class of measures - Laurent Bienvenu; Péter Gács; Mathieu Hoyrup; Cristobal Rojas; Alexander Shen 001 (CoRR, 2011)

Are random axioms useful? - Alexander Shen 001 (CoRR, 2011)

An additivity theorem for plain complexity - Bruno Bauwens; Alexander Shen 001 (CoRR, 2011)

Variations on Muchnik's Conditional Complexity Theorem. - Daniil Musatov; Andrei E. Romashchenko; Alexander Shen 001 (Theory Comput. Syst., 2011)

Not every domain of a plain decompressor contains the domain of a prefix-free one. - Mikhail Andreev; Ilya P. Razenshteyn; Alexander Shen 001 (Theor. Comput. Sci., 2011)

Random Semicomputable Reals Revisited. - Laurent Bienvenu; Alexander Shen 001 (Computation, Physics and Beyond, 2012)

Game Arguments in Computability Theory and Algorithmic Information Theory. - Alexander Shen 001 (CiE, 2012)

Limit complexities revisited [once more] - Laurent Bienvenu; Andrej Muchnik; Alexander Shen 001; Nikolai K. Vereshchagin (CoRR, 2012)

Topological arguments for Kolmogorov complexity - Alexander Shen 001; Andrei E. Romashchenko (AUTOMATA & JAC, 2012)

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points. - Laurent Bienvenu; Adam R. Day; Mathieu Hoyrup; Ilya Mezhirov; Alexander Shen 001 (Inf. Comput., 2012)

Fixed-point tile sets and their applications. - Bruno Durand 001; Andrei E. Romashchenko; Alexander Shen 001 (J. Comput. Syst. Sci., 2012)

An Additivity Theorem for Plain Kolmogorov Complexity. - Bruno Bauwens; Alexander Shen 001 (Theory Comput. Syst., 2013)

Algorithmic Identification of Probabilities Is Hard. - Laurent Bienvenu; Benoit Monin; Alexander Shen 001 (ALT, 2014)

The axiomatic power of Kolmogorov complexity. - Laurent Bienvenu; Andrei E. Romashchenko; Alexander Shen 001; Antoine Taveneaux; Stijn Vermeeren (Ann. Pure Appl. Log., 2014)

K-trivial, K-low and MLR-low sequences: a tutorial. - Laurent Bienvenu; Alexander Shen 001 (CoRR, 2014)

Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma. - Andrei Yu. Rumyantsev; Alexander Shen 001 (Fundam. Informaticae, 2014)

Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity. - Bruno Bauwens; Alexander Shen 001 (J. Symb. Log., 2014)

K-trivial, K-low and MLR-low Sequences: A Tutorial. - Laurent Bienvenu; Alexander Shen 001 (Fields of Logic and Computation II, 2015)

What Percentage of Programs Halt? - Laurent Bienvenu; Damien Desfontaines; Alexander Shen 001 (ICALP (1), 2015)

Around Kolmogorov complexity: basic notions and results. - Alexander Shen 001 (CoRR, 2015)

Algorithmic statistics revisited. - Nikolai K. Vereshchagin; Alexander Shen 001 (CoRR, 2015)

Geometry in Problems. - Alexander Shen 001 (American Mathematical Society, 2016)

Generic algorithms for halting problem and optimal machines revisited. - Laurent Bienvenu; Damien Desfontaines; Alexander Shen 001 (Log. Methods Comput. Sci., 2016)

Algorithmic Statistics: Forty Years Later. - Nikolay K. Vereshchagin; Alexander Shen 001 (Computability and Complexity, 2017)

Compressibility and Probabilistic Proofs. - Alexander Shen 001 (CiE, 2017)

Automatic Kolmogorov Complexity and Normality Revisited. - Alexander Shen 001 (FCT, 2017)

Conditional Probabilities and van Lambalgen's Theorem Revisited. - Bruno Bauwens; Alexander Shen 001; Hayato Takahashi 001 (Theory Comput. Syst., 2017)

Layerwise Computability and Image Randomness. - Laurent Bienvenu; Mathieu Hoyrup; Alexander Shen 001 (Theory Comput. Syst., 2017)

Algorithms and Geometric Constructions. - Vladimir Uspenskiy; Alexander Shen 001 (CiE, 2018)

Plain Stopping Time and Conditional Complexities Revisited. - Mikhail Andreev; Gleb Posobin; Alexander Shen 001 (MFCS, 2018)

Information Distance Revisited. - Bruno Bauwens; Alexander Shen 001 (CoRR, 2018)

Axiomatic approach to the theory of algorithms and relativized computability. - Alexander Shen 001 (CoRR, 2018)

Algorithmic identification of probabilities is hard. - Laurent Bienvenu; Santiago Figueira; Benoit Monin; Alexander Shen 001 (J. Comput. Syst. Sci., 2018)

Dimension 1 sequences are close to randoms. - Noam Greenberg; Joseph S. Miller; Alexander Shen 001; Linda Brown Westrick (Theor. Comput. Sci., 2018)

Two Characterizations of Finite-State Dimension. - Alexander Kozachinskiy; Alexander Shen 001 (FCT, 2019)

Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. - Gleb Posobin; Alexander Shen 001 (STACS, 2019)

Randomness Tests: Theory and Practice. - Alexander Shen 001 (Fields of Logic and Computation III, 2020)

Complexity of majorants. - Alexander Shen 001 (CoRR, 2020)

Inequalities for space-bounded Kolmogorov complexity. - Péter Gács; Andrei E. Romashchenko; Alexander Shen 001 (CoRR, 2020)

On the Structure of Ammann A2 Tilings. - Bruno Durand 001; Alexander Shen 001; Nikolai K. Vereshchagin (Discret. Comput. Geom., 2020)

Gács-Kučera's Theorem Revisited by Levin. - Alexander Shen 001 (CoRR, 2021)

Automatic Kolmogorov complexity, normality, and finite-state dimension revisited. - Alexander Kozachinskiy; Alexander Shen 001 (J. Comput. Syst. Sci., 2021)

27 Open Problems in Kolmogorov Complexity. - Andrei E. Romashchenko; Alexander Shen 001; Marius Zimand (SIGACT News, 2021)

Inequalities for space-bounded Kolmogorov complexity. - Bruno Bauwens; Péter Gács; Andrei E. Romashchenko; Alexander Shen 001 (Comput., 2022)

Individual codewords. - Alexander Shen 001 (Theor. Comput. Sci., 2022)

Inequalities for Entropies and Dimensions. - Alexander Shen 001 (CiE, 2023)

Approximating Kolmogorov complexity. - Ruslan Ishkuvatov; Daniil Musatov; Alexander Shen 001 (Comput., 2023)

The Kraft-Barmpalias-Lewis-Pye lemma revisited. - Alexander Shen 001 (CoRR, 2023)

The Kučera-Gács theorem revisited by Levin. - George Barmpalias; Alexander Shen 001 (Theor. Comput. Sci., 2023)

Taming randomness and complexity - Essays in honour of Professor Péter Gács. - Ilir Çapuni; Jarkko Kari; Alexander Shen 001 (Theor. Comput. Sci., 2023)

Kolmogorov Complexity as a Combinatorial Tool. - Alexander Shen 001 (CiE, 2024)

Conditional normality and finite-state dimensions revisited. - Alexander Shen 001 (CoRR, 2024)

Optimal Bounds for Dissatisfaction in Perpetual Voting. - Alexander Kozachinskiy; Alexander Shen 001; Tomasz Steifer (AAAI, 2025)

Local obstructions in sequences revisited. - Matthieu Rosenfeld; Alexander Shen 001 (CoRR, 2025)

All Kolmogorov complexity functions are optimal, but are some more optimal? - Bruno Bauwens; Alexander Kozachinskiy; Alexander Shen 001 (CoRR, 2025)