| 2015 | SOFSEM | Advantages of Ultrametric Counter Automata. | Valdis Adamsons, Karlis Jerins, Rihards Krislauks, Marta Lapina, Andris Pakulis, Rusins Freivalds |
| 2015 | SOFSEM | Experiments in Complexity of Probabilistic and Ultrametric Automata. | Kristine Cipola, Andris Pakulis, Rusins Freivalds |
| 2015 | SOFSEM | Superimposed Codes and Query Algorithms. | Anete Lace, Muntis Rudzitis, Eriks Gopaks, Rusins Freivalds |
| 2015 | SOFSEM | Frequency Pushdown Automata. | Ilmars Puzulis, Rusins Freivalds |
| 2015 | TAMC | Structured Frequency Algorithms. | Kaspars Balodis, Janis Iraids, Rusins Freivalds |
| 2015 | UC | Ultrametric Algorithms and Automata. | Rusins Freivalds |
| 2014 | SOFSEM | Active Learning of Recursive Functions by Ultrametric Algorithms. | Rusins Freivalds, Thomas Zeugmann |
| 2013 | DLT | Ultrametric Finite Automata and Turing Machines. | Rusins Freivalds |
| 2013 | LATA | On the Size Complexity of Deterministic Frequency Automata. | Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan |
| 2012 | TAMC | Multiple Usage of Random Bits in Finite Automata. | Rusins Freivalds |
| 2011 | TAMC | On the Amount of Nonconstructivity in Learning Recursive Functions. | Rusins Freivalds, Thomas Zeugmann |
| 2010 | UC | Finite State Transducers with Intuition. | Ruben Agadzanyan, Rusins Freivalds |
| 2010 | UC | Postselection Finite Quantum Automata. | Oksana Scegulnaja-Dubrovska, Lelde Lace, Rusins Freivalds |
| 2010 | UC | Quantum Computation with Devices Whose Contents Are Never Read. | Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan |
| 2009 | SOFSEM | Group Input Machine. | Ruslans Tarasovs, Rusins Freivalds |
| 2008 | ISAAC | Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. | Rusins Freivalds |
| 2008 | SIGGRAPH | Computer graphics for quantum computation. | Solvita Zarina, Rusins Freivalds |
| 2007 | DLT | Non-constructive Methods for Finite Probabilistic Automata. | Rusins Freivalds |
| 2007 | SOFSEM | Size of Quantum Finite State Transducers. | Ruben Agadzanyan, Rusins Freivalds |
| 2005 | MFCS | Knot Theory, Jones Polynomial and Quantum Computing. | Rusins Freivalds |
| 2005 | SOFSEM | 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 |
| 2004 | SOFSEM | Quantum Query Complexity for Some Graph Problems. | Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja |
| 2002 | LATIN | Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. | Rusins Freivalds, Carl H. Smith |
| 2001 | FCT | Towards Axiomatic Basis of Inductive Inference. | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
| 2001 | SOFSEM | Quantum versus Probabilistic One-Way Finite Automata with Counter. | Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev |
| 2001 | SOFSEM | Quantum Finite State Transducers. | Rusins Freivalds, Andreas J. Winter |
| 1999 | COCOON | Probabilities to Accept Languages by Quantum Finite Automata. | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts |
| 1999 | SOFSEM | Quantum Finite Multitape Automata. | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski |
| 1998 | ALT | Closedness Properties in EX-Identification of Recursive Functions. | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs |
| 1998 | DIS | A Logic of Discovery. | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
| 1998 | FOCS | 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. | Andris Ambainis, Rusins Freivalds |
| 1998 | MFCS | Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. | Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska |
| 1998 | SOFSEM | Models of Computation, Riemann Hypothesis, and Classical Mathematics. | Rusins Freivalds |
| 1997 | ALT | 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 |
| 1997 | ALT | Team Learning as a Game. | Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith |
| 1997 | COLT | Asymmetric Team Learning. | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
| 1997 | LFCS | Learning Small Programs with Additional Information. | Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith |
| 1996 | ALT | Transformations that Preserve Learnability. | Andris Ambainis, Rusins Freivalds |
| 1996 | STACS | General Inductive Inference Types Based on Linearly-Ordered Sets. | Andris Ambainis, Rusins Freivalds, Carl H. Smith |
| 1996 | STACS | Learning with Confidence. | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
| 1995 | COLT | On the Inductive Inference of Real Valued Functions. | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
| 1995 | ICALP | Measure, Category and Learning Theory. | Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan |
| 1995 | ICALP | Lower Time Bounds for Randomized Computation. | Rusins Freivalds, Marek Karpinski |
| 1994 | ALT | Identifying Nearly Minimal Gdel Numbers From Additional Information. | Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen |
| 1994 | ALT | Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. | Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith |
| 1994 | COLT | Co-Learning of Total Recursive Functions. | Rusins Freivalds, Marek Karpinski, Carl H. Smith |
| 1994 | ICALP | Lower Space Bounds for Randomized Computation. | Rusins Freivalds, Marek Karpinski |
| 1994 | STOC | Choosing a learning team: a topological approach. | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
| 1993 | ALT | On the Duality Between Mechanistic Learners and What it is They Learn. | Rusins Freivalds, Carl H. Smith |
| 1993 | COLT | On the Impact of Forgetting on Learning Machines. | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
| 1992 | COLT | On the Role of Procrastination for Machine Learning. | Rusins Freivalds, Carl H. Smith |
| 1991 | ICALP | Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. | Janis Kaneps, Rusins Freivalds |
| 1990 | COLT | Inductive Inference of Minimal Programs. | Rusins Freivalds |
| 1990 | MFCS | Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. | Janis Kaneps, Rusins Freivalds |
| 1986 | MFCS | Why Sometimes Probabilistic Algorithms Can Be More Effective. | Farid M. Ablayev, Rusins Freivalds |
| 1983 | FCT | Space and Reversal Complexity of Probabilistic One-Way Turing Machines. | Rusins Freivalds |
| 1981 | MFCS | Probabilistic Two-Way Machines. | Rusins Freivalds |
| 1979 | MFCS | Fast Probabilistic Algorithms. | Rusins Freivalds |