Probabilistic Machines Can Use Less Running Time. - Rusins Freivalds (IFIP Congress, 1977)

Fast Probabilistic Algorithms. - Rusins Freivalds (MFCS, 1979)

Probabilistic Two-Way Machines. - Rusins Freivalds (MFCS, 1981)

Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata. - Rusins Freivalds (Inf. Process. Lett., 1981)

Inductive Inference and Computable One-One Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Math. Log. Q., 1982)

Space and Reversal Complexity of Probabilistic One-Way Turing Machines. - Rusins Freivalds (FCT, 1983)

Methods and Languages to Prove the Power of Probabilistic Machines. - Rusins Freivalds (IFIP Congress, 1983)

An answer to an open problem. - Rusins Freivalds (Bull. EATCS, 1984)

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Math. Log. Q., 1984)

On the Power of Probabilistic Strategies in Inductive Inference. - Rolf Wiehagen; Rusins Freivalds; Efim B. Kinber (Theor. Comput. Sci., 1984)

Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets. - Rusins Freivalds (Bull. EATCS, 1985)

Why Sometimes Probabilistic Algorithms Can Be More Effective. - Farid M. Ablayev; Rusins Freivalds (MFCS, 1986)

Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions. - Masahiro Miyakawa; Ivan Stojmenovic; Teruo Hikita; Hajime Machida; Rusins Freivalds (J. Inf. Process. Cybern., 1988)

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Math. Log. Q., 1988)

Inductive Inference from Good Examples. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (AII, 1989)

Inductive Inference up to Immune Sets. - Rusins Freivalds; Juris Viksna (AII, 1989)

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (J. Inf. Process. Cybern., 1989)

Trade-Off among Parameters Effecting Inductive Inference - Rusins Freivalds; Carl H. Smith; Mahendran Velauthapillai (Inf. Comput., 1989)

Inductive Inference of Minimal Programs. - Rusins Freivalds (COLT, 1990)

Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. - Janis Kaneps; Rusins Freivalds (MFCS, 1990)

Inductive Inference of Recursive Functions: Qualitative Theory. - Rusins Freivalds (Baltic Computer Science, 1991)

Complexity of Probabilistic Versus Deterministic Automata. - Rusins Freivalds (Baltic Computer Science, 1991)

Inductive Inference of Recursive Functions: Complexity Bounds. - Rusins Freivalds; Janis Barzdins; Karlis Podnieks (Baltic Computer Science, 1991)

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. - Janis Kaneps; Rusins Freivalds (ICALP, 1991)

Dual Types of Hypotheses in Inductive Inference. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Nonmonotonic and Inductive Logic, 1991)

Unions of Identifiable Classes of Total Recursive Functions. - Kalvis Apsitis; Rusins Freivalds; Martins Krikis; Raimonds Simanovskis; Juris Smotrovs (AII, 1992)

An Inductive Inference Appoach to Classification. - Rusins Freivalds; Achim G. Hoffmann (AII, 1992)

Memory Limited Inductive Inference Machines. - Rusins Freivalds; Carl H. Smith (SWAT, 1992)

On the Duality Between Mechanistic Learners and What it is They Learn. - Rusins Freivalds; Carl H. Smith (ALT, 1993)

On the impact of forgetting on learing machines. - Rusins Freivalds; Efim B. Kinber; Carl H. Smith (Bull. EATCS, 1993)

On the Power of Inductive Inference from Good Examples. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Theor. Comput. Sci., 1993)

On the Role of Procrastination in Machine Learning - Rusins Freivalds; Carl H. Smith (Inf. Comput., 1993)

Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. - Rusins Freivalds; Dace Gobleja; Marek Karpinski; Carl H. Smith (AII/ALT, 1994)

Co-Learning of Total Recursive Functions. - Rusins Freivalds; Marek Karpinski; Carl H. Smith (COLT, 1994)

Lower Space Bounds for Randomized Computation. - Rusins Freivalds; Marek Karpinski (ICALP, 1994)

Choosing a learning team: a topological approach. - Kalvis Apsitis; Rusins Freivalds; Carl H. Smith (STOC, 1994)

An inductive inference approach to classification. - Rusins Freivalds; Achim G. Hoffmann (J. Exp. Theor. Artif. Intell., 1994)

On the Inductive Inference of Real Valued Functions. - Kalvis Apsitis; Rusins Freivalds; Carl H. Smith (COLT, 1995)

Probabilistic versus Deterministic Memory Limited Learning. - Rusins Freivalds; Efim B. Kinber; Carl H. Smith (GOSLER Final Report, 1995)

Error Detecting in Inductive Inference. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (GOSLER Final Report, 1995)

Learning from Good Examples. - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (GOSLER Final Report, 1995)

Measure, Category and Learning Theory. - Lance Fortnow; Rusins Freivalds; William I. Gasarch; Martin Kummer; Stuart A. Kurtz; Carl H. Smith; Frank Stephan 001 (ICALP, 1995)

Lower Time Bounds for Randomized Computation. - Rusins Freivalds; Marek Karpinski (ICALP, 1995)

On the Intrinsic Complexity of Learning. - Rusins Freivalds; Efim B. Kinber; Carl H. Smith (Inf. Comput., 1995)

On the Impact of Forgetting on Learning Machines. - Rusins Freivalds; Efim B. Kinber; Carl H. Smith (J. ACM, 1995)

How Inductive Inference Strategies Discover Their Errors - Rusins Freivalds; Efim B. Kinber; Rolf Wiehagen (Inf. Comput., 1995)

Transformations that Preserve Learnability. - Andris Ambainis; Rusins Freivalds (ALT, 1996)

Co-Learning of Recursive Languages from Positive Data. - Rusins Freivalds; Thomas Zeugmann (Ershov Memorial Conference, 1996)

Unions of identifiable families of languages. - Kalvis Apsitis; Rusins Freivalds; Raimonds Simanovskis; Juris Smotrovs (ICGI, 1996)

General Inductive Inference Types Based on Linearly-Ordered Sets. - Andris Ambainis; Rusins Freivalds; Carl H. Smith (STACS, 1996)

Learning with Confidence. - Janis Barzdins; Rusins Freivalds; Carl H. Smith (STACS, 1996)

On Duality in Learning and the Selection of Learning Terms. - Kalvis Apsitis; Rusins Freivalds; Carl H. Smith (Inf. Comput., 1996)

Effects of Kolmogorov Complexity Present in Inductive Inference as Well. - Andris Ambainis; Kalvis Apsitis; Cristian Calude; Rusins Freivalds; Marek Karpinski; Tomas Larfeldt; Iveta Sala; Juris Smotrovs (ALT, 1997)

Team Learning as a Game. - Andris Ambainis; Kalvis Apsitis; Rusins Freivalds; William I. Gasarch; Carl H. Smith (ALT, 1997)

Asymmetric Team Learning. - Kalvis Apsitis; Rusins Freivalds; Carl H. Smith (COLT, 1997)

Learning Formulae from Elementary Facts. - Janis Barzdins; Rusins Freivalds; Carl H. Smith (EuroCOLT, 1997)

Learning Small Programs with Additional Information. - Rusins Freivalds; Gints Tervits; Rolf Wiehagen; Carl H. Smith (LFCS, 1997)

Weak and Strong Recognition by 2-way Randomized Automata. - Andris Ambainis; Rusins Freivalds; Marek Karpinski (RANDOM, 1997)

Tally Languages Accepted by Monte Carlo Pushdown Automata. - Janis Kaneps; Dainis Geidmanis; Rusins Freivalds (RANDOM, 1997)

Kolmogorov Numberings and Minimal Identification. - Rusins Freivalds; Sanjay Jain 001 (Theor. Comput. Sci., 1997)

Closedness Properties in EX-Identification of Recursive Functions. - Kalvis Apsitis; Rusins Freivalds; Raimonds Simanovskis; Juris Smotrovs (ALT, 1998)

A Logic of Discovery. - Janis Barzdins; Rusins Freivalds; Carl H. Smith (Discovery Science, 1998)

1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. - Andris Ambainis; Rusins Freivalds (FOCS, 1998)

Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. - Richard F. Bonner; Rusins Freivalds; Janis Lapins; Antra Lukjanska (MFCS, 1998)

Models of Computation, Riemann Hypothesis, and Classical Mathematics. - Rusins Freivalds (SOFSEM, 1998)

Identifying Nearly Minimal Gödel Numbers from Additional Information. - Rusins Freivalds; Ognian Botuscharov; Rolf Wiehagen (Ann. Math. Artif. Intell., 1998)

On the Relative Sizes of Learnable Sets. - Lance Fortnow; Rusins Freivalds; William I. Gasarch; Martin Kummer; Stuart A. Kurtz; Carl H. Smith; Frank Stephan 001 (Theor. Comput. Sci., 1998)

Probabilities to Accept Languages by Quantum Finite Automata. - Andris Ambainis; Richard F. Bonner; Rusins Freivalds; Arnolds Kikusts (COCOON, 1999)

Quantum Finite Multitape Automata. - Andris Ambainis; Richard F. Bonner; Rusins Freivalds; Marats Golovkins; Marek Karpinski (SOFSEM, 1999)

How to Simulate Free Will in a Computational Device. - Rusins Freivalds (ACM Comput. Surv., 1999)

Inductive Inference with Procrastination: Back to Definitions. - Andris Ambainis; Rusins Freivalds; Carl H. Smith (Fundam. Informaticae, 1999)

The functions of finite support: a canonical learning problem. - Rusins Freivalds; Efim B. Kinber; Carl H. Smith (J. Exp. Theor. Artif. Intell., 1999)

On the Inductive Inference of Recursive Real-Valued Functions. - Kalvis Apsitis; Setsuo Arikawa; Rusins Freivalds; Eiju Hirowatari; Carl H. Smith (Theor. Comput. Sci., 1999)

Towards Axiomatic Basis of Inductive Inference. - Janis Barzdins; Rusins Freivalds; Carl H. Smith (FCT, 2001)

Quantum versus Probabilistic One-Way Finite Automata with Counter. - Richard F. Bonner; Rusins Freivalds; Maksim Kravtsev (SOFSEM, 2001)

Quantum Finite State Transducers. - Rusins Freivalds; Andreas J. Winter 002 (SOFSEM, 2001)

Hierarchies of probabilistic and team FIN-learning. - Andris Ambainis; Kalvis Apsitis; Rusins Freivalds; Carl H. Smith (Theor. Comput. Sci., 2001)

Closedness properties in ex-identification. - Kalvis Apsitis; Rusins Freivalds; Raimonds Simanovskis; Juris Smotrovs (Theor. Comput. Sci., 2001)

Foreword. - Rusins Freivalds; Juraj Hromkovic; Gheorghe Paun; Walter Unger (Theor. Comput. Sci., 2001)

Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. - Rusins Freivalds; Carl H. Smith (LATIN, 2002)

Learning by the Process of Elimination. - Rusins Freivalds; Marek Karpinski; Carl H. Smith; Rolf Wiehagen (Inf. Comput., 2002)

Complexity of Decision Trees for Boolean Functions. - Rusins Freivalds; Masahiro Miyakawa; Ivo G. Rosenberg (ISMVL, 2003)

Size of Quantum Versus Deterministic Finite Automata. - Andris Ambainis; Uldis Barbans; Agnese Belousova; Aleksandrs Belovs; Ilze Dzelme; Girts Folkmanis; Rusins Freivalds; Peteris Ledins; Rihards Opmanis; Agnis Skuskovniks (VLSI, 2003)

Lower Bounds for Query Complexity of Some Graph Problems. - Lelde Lace; Rusins Freivalds (VLSI, 2003)

Quantum Query Complexity for Some Graph Problems. - Aija Berzina; Andrej Dubrovsky; Rusins Freivalds; Lelde Lace; Oksana Scegulnaja (SOFSEM, 2004)

Combinatorial Block Designs for Quantum Computing Problems. - Rusins Freivalds; Elina Kalnina; Rihards Opmanis; Agnese Zalcmane (FCS, 2005)

Some Graph Problems with Equivalent Lower Bounds for Query Complexity. - Rusins Freivalds; Renate Praude; Lelde Lace (FCS, 2005)

Size of Nondeterministic and Deterministic Automata for Certain Languages. - Raitis Ozols; Rusins Freivalds; Laura Mancinska; Maris Ozols (FCS, 2005)

Knot Theory, Jones Polynomial and Quantum Computing. - Rusins Freivalds (MFCS, 2005)

Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. - Raitis Ozols; Rusins Freivalds; Jevgenijs Ivanovs; Elina Kalnina; Lelde Lace; Masahiro Miyakawa; Hisayuki Tatsumi; Daina Taimina (SOFSEM, 2005)

Languages Recognizable by Quantum Finite Automata. - Rusins Freivalds (CIAA, 2005)

Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory. - Rusins Freivalds; Liva Garkaje (ISMVL, 2007)

Hamming, Permutations and Automata. - Rusins Freivalds (SAGA, 2007)

Size of Quantum Finite State Transducers. - Ruben Agadzanyan; Rusins Freivalds (SOFSEM (1), 2007)

Artin's Conjecture and Size of Finite Probabilistic Automata. - Rusins Freivalds (Pillars of Computer Science, 2008)

A Quantum Algorithm for Real Time Rendering. - Guntis Deksnis; Rusins Freivalds; Oksana Scegulnaja-Dubrovska; Ruslan Tarasov; Solvita Zarina (FCS, 2008)

Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. - Rusins Freivalds (ISAAC, 2008)

Computer graphics for quantum computation. - Solvita Zarina; Rusins Freivalds (SIGGRAPH Posters, 2008)

Non-Constructive Methods for Finite Probabilistic Automata. - Rusins Freivalds (Int. J. Found. Comput. Sci., 2008)

Learning with belief levels. - Janis Barzdins; Rusins Freivalds; Carl H. Smith (J. Comput. Syst. Sci., 2008)

Quantum inductive inference by finite automata. - Rusins Freivalds; Richard F. Bonner (Theor. Comput. Sci., 2008)

Group Input Machine. - Ruslans Tarasovs; Rusins Freivalds (SOFSEM, 2009)

Amount of Nonconstructivity in Finite Automata. - Rusins Freivalds (CIAA, 2009)

Quantum Queries on Permutations with a Promise. - Rusins Freivalds; Kazuo Iwama (CIAA, 2009)

Improved constructions of mixed state quantum automata. - Rusins Freivalds; Maris Ozols; Laura Mancinska (Theor. Comput. Sci., 2009)

Finite State Transducers with Intuition. - Ruben Agadzanyan; Rusins Freivalds (UC, 2010)

Postselection Finite Quantum Automata. - Oksana Scegulnaja-Dubrovska; Lelde Lace; Rusins Freivalds (UC, 2010)

Quantum Computation with Devices Whose Contents Are Never Read. - Abuzer Yakaryilmaz; Rusins Freivalds; A. C. Cem Say; Ruben Agadzanyan (UC, 2010)

A new family of nonstochastic languages. - Rusins Freivalds; Abuzer Yakaryilmaz; A. C. Cem Say (Inf. Process. Lett., 2010)

Amount of nonconstructivity in deterministic finite automata. - Rusins Freivalds (Theor. Comput. Sci., 2010)

Algorithmic Information Theory and Computational Complexity. - Rusins Freivalds (Algorithmic Probability and Friends, 2011)

Frequency Prediction of Functions. - Kaspars Balodis; Ilja Kucevalovs; Rusins Freivalds (MEMICS, 2011)

On the Amount of Nonconstructivity in Learning Recursive Functions. - Rusins Freivalds; Thomas Zeugmann (TAMC, 2011)

Nondeterministic Query Algorithms. - Alina Vasilieva; Rusins Freivalds (J. Univers. Comput. Sci., 2011)

Hartmanis-Stearns Conjecture on Real Time and Transcendence. - Rusins Freivalds (Computation, Physics and Beyond, 2012)

Ultrametric automata and Turing machines. - Rusins Freivalds (Turing-100, 2012)

Multiple Usage of Random Bits in Finite Automata. - Rusins Freivalds (TAMC, 2012)

Quantum computation with write-only memory. - Abuzer Yakaryilmaz; Rusins Freivalds; A. C. Cem Say; Ruben Agadzanyan (Nat. Comput., 2012)

Ultrametric Finite Automata and Turing Machines. - Rusins Freivalds (Developments in Language Theory, 2013)

On the Size Complexity of Deterministic Frequency Automata. - Rusins Freivalds; Thomas Zeugmann; Grant R. Pogosyan (LATA, 2013)

Preface. - Agata Ciabattoni; Rusins Freivalds; Antonín Kucera 001; Igor Potapov; Stefan Szeider (Fundam. Informaticae, 2013)

Visual Representation of von Koch Fractals. - Rusins Freivalds; Solvita Zarina (Discrete Mathematics and Computer Science, 2014)

Active Learning of Recursive Functions by Ultrametric Algorithms. - Rusins Freivalds; Thomas Zeugmann (SOFSEM, 2014)

Ultrametric Vs. Quantum Query Algorithms. - Rusins Freivalds (TPNC, 2014)

On the Influence of Technology on Learning Processes. - Ilja Kucevalovs; Ojars Krasts; Rusins Freivalds; Thomas Zeugmann (Parallel Process. Lett., 2014)

Quantum Queries on Permutations. - Taisia Mischenko-Slatenkova; Alina Vasilieva; Ilja Kucevalovs; Rusins Freivalds (DCFS, 2015)

Advantages of Ultrametric Counter Automata. - Valdis Adamsons; Karlis Jerins; Rihards Krislauks; Marta Lapina; Andris Pakulis; Rusins Freivalds (SOFSEM (Student Research Forum Papers / Posters), 2015)

Experiments in Complexity of Probabilistic and Ultrametric Automata. - Kristine Cipola; Andris Pakulis; Rusins Freivalds (SOFSEM (Student Research Forum Papers / Posters), 2015)

Superimposed Codes and Query Algorithms. - Anete Lace; Muntis Rudzitis; Eriks Gopaks; Rusins Freivalds (SOFSEM (Student Research Forum Papers / Posters), 2015)

Frequency Pushdown Automata. - Ilmars Puzulis; Rusins Freivalds (SOFSEM (Student Research Forum Papers / Posters), 2015)

Structured Frequency Algorithms. - Kaspars Balodis; Janis Iraids; Rusins Freivalds (TAMC, 2015)

Ultrametric Algorithms and Automata. - Rusins Freivalds (UCNC, 2015)

Deterministic Frequency Pushdown Automata. - Cristian S. Calude; Rusins Freivalds; Sanjay Jain 001; Frank Stephan 001 (J. Univers. Comput. Sci., 2015)

Rūsiņš Mārtiņš Freivalds: Academic Genealogy and Selected Publications. - Rusins Martins Freivalds; Solvita Zarina (Balt. J. Mod. Comput., 2016)

On block pumpable languages. - Christopher Hanrui Chak; Rusins Freivalds; Frank Stephan 001; Henrietta Tan Wan Yik (Theor. Comput. Sci., 2016)