The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Do stronger definitions of randomness exist?
Theoretical Computer Science
Kolmogorov-Loveland stochasticity for finite strings
Information Processing Letters
Effective Randomness for Computable Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests
Problems of Information Transmission
The complexity of stochastic sequences
Journal of Computer and System Sciences
Comparing notions of randomness
Theoretical Computer Science
Kolmogorov-Loveland stochasticity and Kolmogorov complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
How powerful are integer-valued martingales?
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Algorithmic randomness and monotone complexity on product space
Information and Computation
Exact learning algorithms, betting games, and circuit lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Constructive equivalence relations on computable probability measures
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Kolmogorov-Loveland randomness and stochasticity
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Randomness, computation and mathematics
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
How much randomness is needed for statistics?
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Strong reductions in effective randomness
Theoretical Computer Science
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |