Folgen
Rusins Freivalds
Rusins Freivalds
Professor of Computer Science, University of Latvia
Bestätigte E-Mail-Adresse bei mii.lu.lv
Titel
Zitiert von
Zitiert von
Jahr
1-way quantum finite automata: strengths, weaknesses and generalizations
A Ambainis, R Freivalds
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
3571998
Probabilistic Machines Can Use Less Running Time.
R Freivalds
IFIP congress 839, 842, 1977
2161977
Probabilistic Two-Way Machines
R Freivalds
MFCS, 1981
213*1981
Fast probabilistic algorithms
R Freivalds
Mathematical Foundations of Computer Science 1979, 57-69, 1979
2131979
On the role of procrastination for machine learning
CHS Rusins Freivalds
COLT, 1992
133*1992
Inductive inference with additional information
RV Freivald, R Wiehagen
Elektronische Informationsverarbeitung und Kybernetik 15 (4), 179-185, 1979
931979
On the power of probabilistic strategies in inductive inference
R Wiehagen, R Freivalds, EB Kinber
Theoretical Computer Science 28 (1-2), 111-133, 1983
691983
Finite identification of general recursive functions by probabilistic strategies
R Freivalds
Proceedings of the Conference on Fundamentals of Computation Theory, 138-145, 1979
681979
On the intrinsic complexity of learning
R Freivalds, E Kinber, C Smith
Computational Learning Theory, 154-168, 1995
661995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
INFORMATION AND COMPUTATION 123 (1), 64-71, 1995
66*1995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
COLT, 1995
66*1995
Inductive inference of recursive functions: Qualitative theory
R Freivalds
Lecture Notes in Computer Science 502, 77-110, 1991
651991
Minimal Gödel numbers and their identification in the limit
R Freivald
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské …, 1975
651975
On the power of inductive inference from good examples
R Freivalds, EB Kinber, R Wiehagen
Theoretical Computer Science 110 (1), 131-144, 1993
631993
Probabilities to accept languages by quantum finite automata
A Ambainis, R Bonner, R Freivalds, A Ķikusts
Computing and Combinatorics: 5th Annual International Conference, COCOON’99 …, 1999
581999
Lower Space Bounds for Randomized Computation
F Rusins
57*
Minimal nontrivial space complexity of probabilistic one-way Turing machines
J Kaņeps, R Freivalds
Mathematical Foundations of Computer Science 1990, 355-361, 1990
541990
Completeness criteria for partial functions of the algebra of logic and many-valued logics
RV Freivald
Dokl. Akad. Nauk. SSSR 167 (6), 1249-1250, 1966
491966
On the impact of forgetting on learning machines
R Freivalds, E Kinber, CH Smith
Journal of the ACM (JACM) 42 (6), 1146-1168, 1995
471995
Running time to recognize nonregular languages by 2-way probabilistic automata
J Kaņeps, R Freivalds
Automata, Languages and Programming, 174-185, 1991
471991
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20