alexander shen
alexander shen
Directeur de recherche 2 cl., LIRMM, CNRS, University of Montpellier 2, France
Dirección de correo verificada de lirmm.fr - Página principal
Título
Citado por
Citado por
Año
Classical and quantum computation
AY Kitaev, A Shen, MN Vyalyi, MN Vyalyi
American Mathematical Soc., 2002
13202002
Inequalities for Shannon entropy and Kolmogorov complexity
D Hammer, A Romashchenko, A Shen, N Vereshchagin
Journal of Computer and System Sciences 60 (2), 442-464, 2000
2062000
Can and individual sequence of zeros and ones be random
VA Uspenskil, AL Semenov, AK Shen
Russian Mathematical Surveys 45 (1), 121-189, 1990
1391990
Relations between varieties of Kolmogorov complexities
VA Uspensky, A Shen
Mathematical systems theory 29 (3), 271-292, 1996
1041996
Kolmogorov complexity and algorithmic randomness
A Shen, VA Uspensky, N Vereshchagin
American Mathematical Soc., 2017
982017
Test martingales, Bayes factors and p-values
G Shafer, A Shen, N Vereshchagin, V Vovk
Statistical Science 26 (1), 84-101, 2011
912011
IP= SPACE: simplified proof
A Shen
Journal of the ACM (JACM) 39 (4), 878-880, 1992
901992
Complex tilings
B Durand, LA Levin, A Shen
The Journal of Symbolic Logic 73 (2), 593-613, 2008
832008
On the history of martingales in the study of randomness
L Bienvenu, G Shafer, A Shen
Electronic Journal for History of Probability and Statistics 5 (1), 1-40, 2009
752009
Языки и исчисления
Н Верещагин, А Шень
74*2000
Fixed-point tile sets and their applications
B Durand, A Romashchenko, A Shen
Journal of Computer and System Sciences 78 (3), 731-764, 2012
672012
The concept of (α, β)-stochasticity in the Kolmogorov sense, and its properties
AK Shen
Soviet Math. Dokl 28 (1), 295-299, 1983
621983
On relations between different algorithmic definitions of randomness
AK Shen
Soviet Mathematics Doklady 38, 316-319, 1989
601989
Upper semi-lattice of binary strings with the relation “x is simple conditional to y”
A Chernov, A Muchnik, A Romashchenko, A Shen, N Vereshchagin
Theoretical Computer Science 271 (1-2), 69-95, 2002
46*2002
Logical operations and Kolmogorov complexity
A Shen, N Vereshchagin
Theoretical Computer Science 271 (1-2), 125-129, 2002
452002
A constructive version of Birkhoffʼs ergodic theorem for Martin-Löf random points
L Bienvenu, AR Day, M Hoyrup, I Mezhirov, A Shen
Information and Computation 210, 21-30, 2012
432012
Effective closed subshifts in 1D can be implemented in 2D
B Durand, A Romashchenko, A Shen
Fields of logic and computation, 208-226, 2010
432010
Basic set theory
A Shen, NK Vereshchagin
American Mathematical Society, 2002
432002
Algorithmic tests and randomness with respect to a class of measures
L Bienvenu, P Gács, M Hoyrup, C Rojas, A Shen
Proceedings of the Steklov Institute of Mathematics 274 (1), 34-89, 2011
382011
Algorithmic information theory and Kolmogorov complexity
A Shen
Lecture notes of an introductory course. Uppsala University Technical Report …, 2000
372000
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20