Rusins Freivalds - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On the Amount of Nonconstructivity in Learning Recursive FunctionsRusins Freivalds, Thomas Zeugmann. tamc 2011: 332-343 [doi]

Nondeterministic Query AlgorithmsAlina Vasilieva, Rusins Freivalds. jucs, 17(6):859-873, 2011. [doi]

2010

2009

2008

2007

Size of Quantum Finite State TransducersRuben Agadzanyan, Rusins Freivalds. sofsem 2007: 155-163 [doi]

Boolean Functions of Low Polynomial Degree for Quantum Query Complexity TheoryRusins Freivalds, Liva Garkaje. ismvl 2007: 17 [doi]

Hamming, Permutations and AutomataRusins Freivalds. saga 2007: 18-29 [doi]

Non-constructive Methods for Finite Probabilistic AutomataRusins Freivalds. dlt 2007: 169-180 [doi]

2006

Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, ProceedingsLars Arge, Rusins Freivalds, editors, Volume 4059 of Lecture Notes in Computer Science, Springer, 2006.

2005

2004

Quantum Query Complexity for Some Graph ProblemsAija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja. sofsem 2004: 140-150 [doi]

2003

2002

Learning by the Process of EliminationRusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen. iandc, 176(1):37-50, 2002. [doi]

Category, Measure, Inductive Inference: A Triality Theorem and Its ApplicationsRusins Freivalds, Carl H. Smith. latin 2002: 386-399 [doi]

2001

Hierarchies of probabilistic and team FIN-learningAndris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith. TCS, 261(1):91-117, 2001. [doi]

Closedness properties in ex-identificationKalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs. TCS, 268(2):367-393, 2001. [doi]

Towards Axiomatic Basis of Inductive InferenceJanis Barzdins, Rusins Freivalds, Carl H. Smith. fct 2001: 1-13 [doi]

Quantum versus Probabilistic One-Way Finite Automata with CounterRichard F. Bonner, Rusins Freivalds, Maksim Kravtsev. sofsem 2001: 181-190 [doi]

Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, ProceedingsRusins Freivalds, editor, Volume 2138 of Lecture Notes in Computer Science, Springer, 2001.

ForewordRusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger. TCS, 264(1):1-2, 2001. [doi]

Quantum Finite State TransducersRusins Freivalds, Andreas Winter. sofsem 2001: 233-242 [doi]

1999

Inductive Inference with Procrastination: Back to DefinitionsAndris Ambainis, Rusins Freivalds, Carl H. Smith. FUIN, 40(1):1-16, 1999.

Probabilities to Accept Languages by Quantum Finite AutomataAndris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts. cocoon 1999: 174-183 [doi]

Quantum Finite Multitape AutomataAndris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski. sofsem 1999: 340-348 [doi]

On the Inductive Inference of Recursive Real-Valued FunctionsKalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith. TCS, 219(1-2):3-17, 1999. [doi]

The functions of finite support: a canonical learning problemRusins Freivalds, Efim B. Kinber, Carl H. Smith. jetai, 11(4):543-552, 1999.

How to Simulate Free Will in a Computational DeviceRusins Freivalds. ACM Comput. Surv., 31(3es):15, 1999. [doi]

1998

1-Way Quantum Finite Automata: Strengths, Weaknesses and GeneralizationsAndris Ambainis, Rusins Freivalds. focs 1998: 332-341 [doi]

Closedness Properties in EX-Identification of Recursive FunctionsKalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs. alt 1998: 46-60 [doi]

A Logic of DiscoveryJanis Barzdins, Rusins Freivalds, Carl H. Smith. dis 1998: 401-402 [doi]

Nonstochastic Languages as Projections of 2-Tape Quasideterministic LanguagesRichard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska. mfcs 1998: 213-219 [doi]

On the Relative Sizes of Learnable SetsLance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan. TCS, 197(1-2):139-156, 1998. [doi]

Identifying Nearly Minimal Gödel Numbers from Additional InformationRusins Freivalds, Ognian Botuscharov, Rolf Wiehagen. AMAI, 23(1-2):199-209, 1998.

Models of Computation, Riemann Hypothesis, and Classical MathematicsRusins Freivalds. sofsem 1998: 89-106 [doi]

1997

Weak and Strong Recognition by 2-way Randomized AutomataAndris Ambainis, Rusins Freivalds, Marek Karpinski. random 1997: 175-185

Team Learning as a GameAndris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith. alt 1997: 2-17

Effects of Kolmogorov Complexity Present in Inductive Inference as WellAndris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs. alt 1997: 244-259

Asymmetric Team LearningKalvis Apsitis, Rusins Freivalds, Carl H. Smith. colt 1997: 90-95 [doi]

Learning Formulae from Elementary FactsJanis Barzdins, Rusins Freivalds, Carl H. Smith. eurocolt 1997: 272-285

Kolmogorov Numberings and Minimal IdentificationRusins Freivalds, Sanjay Jain. TCS, 188(1-2):175-194, 1997. [doi]

Learning Small Programs with Additional InformationRusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith. lfcs 1997: 102-112

Tally Languages Accepted by Monte Carlo Pushdown AutomataJanis Kaneps, Dainis Geidmanis, Rusins Freivalds. random 1997: 187-195

1996

1995

On the Inductive Inference of Real Valued FunctionsKalvis Apsitis, Rusins Freivalds, Carl H. Smith. colt 1995: 170-177 [doi]

Measure, Category and Learning TheoryLance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan. icalp 1995: 558-569

How Inductive Inference Strategies Discover Their ErrorsRusins Freivalds, Efim B. Kinber, Rolf Wiehagen. iandc, 118(2):208-226, May 1995.

On the Intrinsic Complexity of LearningRusins Freivalds, Efim B. Kinber, Carl H. Smith. iandc, 123(1):64-71, 1995.

Error Detecting in Inductive InferenceRusins Freivalds, Efim B. Kinber, Rolf Wiehagen. gosler 1995: 25-48

Learning from Good ExamplesRusins Freivalds, Efim B. Kinber, Rolf Wiehagen. gosler 1995: 49-62

Lower Time Bounds for Randomized ComputationRusins Freivalds, Marek Karpinski. icalp 1995: 183-195

Kolmogorov numberings and minimal identificationRusins Freivalds, Sanjay Jain. eurocolt 1995: 182-195

On the intrinsic complexity of learningRusins Freivalds, Efim B. Kinber, Carl H. Smith. eurocolt 1995: 154-168

Probabilistic versus Deterministic Memory Limited LearningRusins Freivalds, Efim B. Kinber, Carl H. Smith. gosler 1995: 155-161

On the Impact of Forgetting on Learning MachinesRusins Freivalds, Efim B. Kinber, Carl H. Smith. JACM, 42(6):1146-1168, 1995. [doi]

1994

1993

On the impact of forgetting on learing machinesRusins Freivalds, Efim B. Kinber, Carl H. Smith. eatcs, 51:212-225, 1993.

On the impact of forgetting on learing machinesRusins Freivalds, Efim B. Kinber, Carl H. Smith. eatcs, 49:212-225, 1993.

On the Power of Inductive Inference from Good ExamplesRusins Freivalds, Efim B. Kinber, Rolf Wiehagen. TCS, 110(1):131-144, 1993.

On the Duality Between Mechanistic Learners and What it is They LearnRusins Freivalds, Carl H. Smith. alt 1993: 137-149

On the Role of Procrastination in Machine LearningRusins Freivalds, Carl H. Smith. iandc, 107(2):237-271, December 1993.

On the Impact of Forgetting on Learning MachinesRusins Freivalds, Efim B. Kinber, Carl H. Smith. colt 1993: 165-174 [doi]

1992

1991

PreviousNext