Sledovať
Rusins Freivalds
Rusins Freivalds
Professor of Computer Science, University of Latvia
Overená e-mailová adresa na: mii.lu.lv
Názov
Citované v
Citované v
Rok
1-way quantum finite automata: strengths, weaknesses and generalizations
A Ambainis, R Freivalds
Proceedings 39th annual symposium on foundations of computer science (Cat …, 1998
3931998
Probabilistic Machines Can Use Less Running Time.
R Freivalds
IFIP congress 839, 842, 1977
2611977
Fast probabilistic algorithms
R Freivalds
Mathematical Foundations of Computer Science 1979, 57-69, 1979
2491979
Probabilistic Two-Way Machines
R Freivalds
MFCS, 1981
2281981
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
981979
On the intrinsic complexity of learning
R Freivalds, E Kinber, C Smith
Computational Learning Theory, 154-168, 1995
711995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
INFORMATION AND COMPUTATION 123 (1), 64-71, 1995
71*1995
On the intrinsic complexity of learning
CHS Rusins Freivalds, Efim B. Kinber
COLT, 1995
71*1995
Minimal Gödel numbers and their identification in the limit
R Freivald
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské …, 1975
691975
On the power of inductive inference from good examples
R Freivalds, EB Kinber, R Wiehagen
Theoretical Computer Science 110 (1), 131-144, 1993
681993
Inductive inference of recursive functions: Qualitative theory
R Freivalds
Lecture Notes in Computer Science 502, 77-110, 1991
681991
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 power of probabilistic strategies in inductive inference
R Wiehagen, R Freivalds, EB Kinber
Theoretical Computer Science 28 (1-2), 111-133, 1983
661983
Probabilities to accept languages by quantum finite automata
A Ambainis, R Bonner, R Freivalds, A Ķikusts
International computing and combinatorics conference, 174-183, 1999
631999
Lower Space Bounds for Randomized Computation
F Rusins
61*
Minimal nontrivial space complexity of probabilistic one-way Turing machines
J Kaņeps, R Freivalds
Mathematical Foundations of Computer Science 1990, 355-361, 1990
521990
Running time to recognize nonregular languages by 2-way probabilistic automata
J Kaņeps, R Freivalds
Automata, Languages and Programming, 174-185, 1991
481991
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
471966
Quantum query complexity for some graph problems
A Berzina, A Dubrovsky, R Freivalds, L Lace, O Scegulnaja
International Conference on Current Trends in Theory and Practice of …, 2004
462004
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20