Rusins Freivalds
Rusins Freivalds
Professor of Computer Science, University of Latvia
Verified email at mii.lu.lv
TitleCited byYear
1-way quantum finite automata: strengths, weaknesses and generalizations
A Ambainis, R Freivalds
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
3231998
Probabilistic Two-Way Machines
R Freivalds
MFCS, 1981
1961981
Fast probabilistic algorithms
R Freivalds
Mathematical Foundations of Computer Science 1979, 57-69, 1979
1851979
On the prediction of general recursive functions
JM Barzdins
Soviet Mathematics Doklady 13, 1224-1228, 1972
1841972
Probabilistic Machines Can Use Less Running Time.
R Freivalds
IFIP congress 839, 842, 1977
1571977
ON THE ROLE OF PROCRASTINATION IN MACHINE LEARNING
CHS Rusins Freivalds
INFORMATION AND COMPUTATION, 1993
1221993
On the role of procrastination for machine learning
CHS Rusins Freivalds
COLT, 1992
122*1992
Inductive inference with additional information
RV Freivald, R Wiehagen
Elektronische Informationsverarbeitung und Kybernetik 15 (4), 179-185, 1979
851979
Inductive inference of recursive functions: Qualitative theory
R Freivalds
Lecture Notes in Computer Science 502, 77-110, 1991
651991
On the power of probabilistic strategies in inductive inference
R Wiehagen, R Freivalds, EB Kinber
Theoretical Computer Science 28 (1-2), 111-133, 1983
641983
Finite identification of general recursive functions by probabilistic strategies
R Freivalds
Proceedings of the Conference on Fundamentals of Computation Theory, 138-145, 1979
631979
On the intrinsic complexity of learning
R Freivalds, E Kinber, C Smith
Computational Learning Theory, 154-168, 1995
621995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
INFORMATION AND COMPUTATION 123 (1), 64-71, 1995
62*1995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
COLT, 1995
62*1995
Minimal Gödel numbers and their identification in the limit
R Freivald
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské …, 1975
611975
On the power of inductive inference from good examples
R Freivalds, EB Kinber, R Wiehagen
Theoretical Computer Science 110 (1), 131-144, 1993
601993
Lower Space Bounds for Randomized Computation
F Rusins
55*
Probabilities to accept languages by quantum finite automata
A Ambainis, R Bonner, R Freivalds, A Ķikusts
International Computing and Combinatorics Conference, 174-183, 1999
501999
Minimal nontrivial space complexity of probabilistic one-way Turing machines
J Kaņeps, R Freivalds
Mathematical Foundations of Computer Science 1990, 355-361, 1990
481990
Running time to recognize nonregular languages by 2-way probabilistic automata
J Kaņeps, R Freivalds
Automata, Languages and Programming, 174-185, 1991
451991
The system can't perform the operation now. Try again later.
Articles 1–20