How to construct random functions
Journal of the ACM (JACM)
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Machine Learning - Special issue on inductive transfer
Learning Team Strategies: Soccer Case Studies
Machine Learning
Information and Computation
Kolmogorov complexity and non-determnism
Theoretical Computer Science
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Genetic Programming and Evolvable Machines
Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Sequential Decision Making Based on Direct Search
Sequence Learning - Paradigms, Algorithms, and Applications
Towards an Algorithmic Statistics
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Random elements in effective topological spaces with measure
Information and Computation
Optimality of universal Bayesian sequence prediction for general loss and alphabet
The Journal of Machine Learning Research
Optimal Ordered Problem Solver
Machine Learning
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
Effective prediction and its computational complexity
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Probabilistic incremental program evolution
Evolutionary Computation
Computability and information in models of randomness and chaos†
Mathematical Structures in Computer Science
Algorithmically Independent Sequences
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
Algorithmically independent sequences
Information and Computation
Sequential predictions based on algorithmic complexity
Journal of Computer and System Sciences
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Generation complexity versus distinction complexity
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Can Machines Think? An Old Question Reformulated
Minds and Machines
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
SIGACT news complexity theory column 68
ACM SIGACT News
Completely self-referential optimal reinforcement learners
ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
On the polynomial depth of various sets of random strings
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Proceedings of the 2011 workshop on New security paradigms workshop
Impugning Randomness, Convincingly
Studia Logica
On empirical meaning of randomness with respect to a real parameter
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
On the polynomial depth of various sets of random strings
Theoretical Computer Science
Journal of the ACM (JACM)
| Hi-index | 0.00 |