Rusins Freivalds

Publication Activity (10 Years)

Years Active: 1977-2016
Publications (10 Years): 1

Top Venues

SOFSEM (Student Research Forum Papers / Posters)

TAMC

Computation, Physics and Beyond

Discrete Mathematics and Computer Science

Publications

Christopher Hanrui Chak, Rusins Freivalds, Frank Stephan, Henrietta Tan Wan Yik
On block pumpable languages. Theor. Comput. Sci. 609 (2016)
Cristian S. Calude, Rusins Freivalds, Sanjay Jain, Frank Stephan
Deterministic Frequency Pushdown Automata. J. Univers. Comput. Sci. 21 (12) (2015)
Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, Rusins Freivalds
Quantum Queries on Permutations. DCFS (2015)
Rusins Freivalds
Ultrametric Algorithms and Automata. UCNC (2015)
Kaspars Balodis, Janis Iraids, Rusins Freivalds
Structured Frequency Algorithms. TAMC (2015)
Valdis Adamsons, Karlis Jerins, Rihards Krislauks, Marta Lapina, Andris Pakulis, Rusins Freivalds
Advantages of Ultrametric Counter Automata. SOFSEM (Student Research Forum Papers / Posters) (2015)
Kristine Cipola, Andris Pakulis, Rusins Freivalds
Experiments in Complexity of Probabilistic and Ultrametric Automata. SOFSEM (Student Research Forum Papers / Posters) (2015)
Ilmars Puzulis, Rusins Freivalds
Frequency Pushdown Automata. SOFSEM (Student Research Forum Papers / Posters) (2015)
Anete Lace, Muntis Rudzitis, Eriks Gopaks, Rusins Freivalds
Superimposed Codes and Query Algorithms. SOFSEM (Student Research Forum Papers / Posters) (2015)
Ilja Kucevalovs, Ojars Krasts, Rusins Freivalds, Thomas Zeugmann
On the Influence of Technology on Learning Processes. Parallel Process. Lett. 24 (2) (2014)
Rusins Freivalds, Thomas Zeugmann
Active Learning of Recursive Functions by Ultrametric Algorithms. SOFSEM (2014)
Rusins Freivalds
Ultrametric Vs. Quantum Query Algorithms. TPNC (2014)
Rusins Freivalds, Solvita Zarina
Visual Representation of von Koch Fractals. Discrete Mathematics and Computer Science (2014)
Rusins Freivalds
Ultrametric Finite Automata and Turing Machines. Developments in Language Theory (2013)
Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider
Preface. Fundam. Informaticae 123 (1) (2013)
Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan
On the Size Complexity of Deterministic Frequency Automata. LATA (2013)
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
Quantum computation with write-only memory. Nat. Comput. 11 (1) (2012)
Rusins Freivalds
Multiple Usage of Random Bits in Finite Automata. TAMC (2012)
Rusins Freivalds
Hartmanis-Stearns Conjecture on Real Time and Transcendence. Computation, Physics and Beyond (2012)
Rusins Freivalds
Ultrametric automata and Turing machines. Turing-100 (2012)
Rusins Freivalds
Algorithmic Information Theory and Computational Complexity. Algorithmic Probability and Friends (2011)
Alina Vasilieva, Rusins Freivalds
Nondeterministic Query Algorithms. J. Univers. Comput. Sci. 17 (6) (2011)
Rusins Freivalds, Thomas Zeugmann
On the Amount of Nonconstructivity in Learning Recursive Functions. TAMC (2011)
Kaspars Balodis, Ilja Kucevalovs, Rusins Freivalds
Frequency Prediction of Functions. MEMICS (2011)
Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say
A new family of nonstochastic languages. Inf. Process. Lett. 110 (10) (2010)
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
Quantum computation with devices whose contents are never read CoRR (2010)
Oksana Scegulnaja-Dubrovska, Lelde Lace, Rusins Freivalds
Postselection Finite Quantum Automata. UC (2010)
Rusins Freivalds
Amount of nonconstructivity in deterministic finite automata. Theor. Comput. Sci. 411 (38-39) (2010)
Ruben Agadzanyan, Rusins Freivalds
Finite State Transducers with Intuition. UC (2010)
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
Quantum Computation with Devices Whose Contents Are Never Read. UC (2010)
Rusins Freivalds, Maris Ozols, Laura Mancinska
Improved constructions of mixed state quantum automata. Theor. Comput. Sci. 410 (20) (2009)
Ruslans Tarasovs, Rusins Freivalds
Group Input Machine. SOFSEM (2009)
Rusins Freivalds, Kazuo Iwama
Quantum Queries on Permutations with a Promise. CIAA (2009)
Rusins Freivalds
Amount of Nonconstructivity in Finite Automata. CIAA (2009)
Janis Barzdins, Rusins Freivalds, Carl H. Smith
Learning with belief levels. J. Comput. Syst. Sci. 74 (4) (2008)
Solvita Zarina, Rusins Freivalds
Computer graphics for quantum computation. SIGGRAPH Posters (2008)
Rusins Freivalds, Richard F. Bonner
Quantum inductive inference by finite automata. Theor. Comput. Sci. 397 (1-3) (2008)
Rusins Freivalds
Non-Constructive Methods for Finite Probabilistic Automata. Int. J. Found. Comput. Sci. 19 (3) (2008)
Rusins Freivalds
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. ISAAC (2008)
Rusins Freivalds
Artin's Conjecture and Size of Finite Probabilistic Automata. Pillars of Computer Science (2008)
Guntis Deksnis, Rusins Freivalds, Oksana Scegulnaja-Dubrovska, Ruslan Tarasov, Solvita Zarina
A Quantum Algorithm for Real Time Rendering. FCS (2008)
Rusins Freivalds
Non-constructive Methods for Finite Probabilistic Automata. Developments in Language Theory (2007)
Rusins Freivalds
Hamming, Permutations and Automata. SAGA (2007)
Rusins Freivalds, Liva Garkaje
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory. ISMVL (2007)
Ruben Agadzanyan, Rusins Freivalds
Size of Quantum Finite State Transducers. SOFSEM (1) (2007)
Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane
Combinatorial Block Designs for Quantum Computing Problems. FCS (2005)
Rusins Freivalds
Knot Theory, Jones Polynomial and Quantum Computing. MFCS (2005)
Rusins Freivalds, Renate Praude, Lelde Lace
Some Graph Problems with Equivalent Lower Bounds for Query Complexity. FCS (2005)
Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols
Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS (2005)
Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina
Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. SOFSEM (2005)
Rusins Freivalds
Languages Recognizable by Quantum Finite Automata. CIAA (2005)
Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja
Quantum Query Complexity for Some Graph Problems. SOFSEM (2004)
Lelde Lace, Rusins Freivalds
Lower Bounds for Query Complexity of Some Graph Problems. VLSI (2003)
Andris Ambainis, Uldis Barbans, Agnese Belousova, Aleksandrs Belovs, Ilze Dzelme, Girts Folkmanis, Rusins Freivalds, Peteris Ledins, Rihards Opmanis, Agnis Skuskovniks
Size of Quantum Versus Deterministic Finite Automata. VLSI (2003)
Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg
Complexity of Decision Trees for Boolean Functions. ISMVL (2003)
Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
Learning by the Process of Elimination. Inf. Comput. 176 (1) (2002)
Rusins Freivalds, Carl H. Smith
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. LATIN (2002)
Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
Hierarchies of probabilistic and team FIN-learning. Theor. Comput. Sci. 261 (1) (2001)
Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev
Quantum versus Probabilistic One-Way Finite Automata with Counter. SOFSEM (2001)
Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
Closedness properties in ex-identification. Theor. Comput. Sci. 268 (2) (2001)
Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
Foreword. Theor. Comput. Sci. 264 (1) (2001)
Rusins Freivalds, Andreas J. Winter
Quantum Finite State Transducers. SOFSEM (2001)
Janis Barzdins, Rusins Freivalds, Carl H. Smith
Towards Axiomatic Basis of Inductive Inference. FCT (2001)
Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski
Quantum Finite Multitape Automata. SOFSEM (1999)
Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith
On the Inductive Inference of Recursive Real-Valued Functions. Theor. Comput. Sci. 219 (1-2) (1999)
Rusins Freivalds
How to Simulate Free Will in a Computational Device. ACM Comput. Surv. 31 (3es) (1999)
Rusins Freivalds, Efim B. Kinber, Carl H. Smith
The functions of finite support: a canonical learning problem. J. Exp. Theor. Artif. Intell. 11 (4) (1999)
Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
Probabilities to Accept Languages by Quantum Finite Automata. COCOON (1999)
Andris Ambainis, Rusins Freivalds, Carl H. Smith
Inductive Inference with Procrastination: Back to Definitions. Fundam. Informaticae 40 (1) (1999)
Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
Probabilities to accept languages by quantum finite automata CoRR (1999)
Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
Closedness Properties in EX-Identification of Recursive Functions. ALT (1998)
Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. 23 (1-2) (1998)
Janis Barzdins, Rusins Freivalds, Carl H. Smith
A Logic of Discovery. Discovery Science (1998)
Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. MFCS (1998)
Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
On the Relative Sizes of Learnable Sets. Theor. Comput. Sci. 197 (1-2) (1998)
Andris Ambainis, Rusins Freivalds
1-way quantum finite automata: strengths, weaknesses and generalizations CoRR (1998)
Rusins Freivalds
Models of Computation, Riemann Hypothesis, and Classical Mathematics. SOFSEM (1998)
Andris Ambainis, Rusins Freivalds
1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. FOCS (1998)
Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs
Effects of Kolmogorov Complexity Present in Inductive Inference as Well. ALT (1997)
Andris Ambainis, Rusins Freivalds, Marek Karpinski
Weak and Strong Recognition by 2-way Randomized Automata. RANDOM (1997)
Janis Kaneps, Dainis Geidmanis, Rusins Freivalds
Tally Languages Accepted by Monte Carlo Pushdown Automata. RANDOM (1997)
Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith
Team Learning as a Game. ALT (1997)
Janis Barzdins, Rusins Freivalds, Carl H. Smith
Learning Formulae from Elementary Facts. EuroCOLT (1997)
Rusins Freivalds, Sanjay Jain
Kolmogorov Numberings and Minimal Identification. Theor. Comput. Sci. 188 (1-2) (1997)
Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith
Learning Small Programs with Additional Information. LFCS (1997)
Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
Asymmetric Team Learning. COLT (1997)
Janis Barzdins, Rusins Freivalds, Carl H. Smith
Learning with Confidence. STACS (1996)
Andris Ambainis, Rusins Freivalds, Carl H. Smith
General Inductive Inference Types Based on Linearly-Ordered Sets. STACS (1996)
Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
Unions of identifiable families of languages. ICGI (1996)
Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
On Duality in Learning and the Selection of Learning Terms. Inf. Comput. 129 (1) (1996)
Andris Ambainis, Rusins Freivalds
Transformations that Preserve Learnability. ALT (1996)
Rusins Freivalds, Thomas Zeugmann
Co-Learning of Recursive Languages from Positive Data. Ershov Memorial Conference (1996)
Rusins Freivalds, Efim B. Kinber, Carl H. Smith
On the intrinsic complexity of learning. EuroCOLT (1995)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Learning from Good Examples. GOSLER Final Report (1995)
Rusins Freivalds, Efim B. Kinber, Carl H. Smith
On the Intrinsic Complexity of Learning. Inf. Comput. 123 (1) (1995)
Rusins Freivalds, Marek Karpinski
Lower Time Bounds for Randomized Computation. ICALP (1995)
Rusins Freivalds, Efim B. Kinber, Carl H. Smith
Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report (1995)
Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
Measure, Category and Learning Theory. ICALP (1995)
Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
On the Inductive Inference of Real Valued Functions. COLT (1995)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
How Inductive Inference Strategies Discover Their Errors Inf. Comput. 118 (2) (1995)

Rusins Freivalds.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rusins Freivalds