| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan |
Quantum computation with write-only memory.  |
Natural Computing  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Multiple Usage of Random Bits in Finite Automata. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Hartmanis-Stearns Conjecture on Real Time and Transcendence. |
Computation, Physics and Beyond |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alina Vasilieva, Rusins Freivalds |
Nondeterministic Query Algorithms. |
J. UCS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Thomas Zeugmann |
On the Amount of Nonconstructivity in Learning Recursive Functions. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kaspars Balodis, Ilja Kucevalovs, Rusins Freivalds |
Frequency Prediction of Functions. |
MEMICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say |
A new family of nonstochastic languages. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Amount of nonconstructivity in deterministic finite automata. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan |
Quantum computation with devices whose contents are never read |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oksana Scegulnaja-Dubrovska, Lelde Lace, Rusins Freivalds |
Postselection Finite Quantum Automata. |
UC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan |
Quantum Computation with Devices Whose Contents Are Never Read. |
UC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruben Agadzanyan, Rusins Freivalds |
Finite State Transducers with Intuition. |
UC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Maris Ozols, Laura Mancinska |
Improved constructions of mixed state quantum automata. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruslans Tarasovs, Rusins Freivalds |
Group Input Machine. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Kazuo Iwama |
Quantum Queries on Permutations with a Promise. |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Amount of Nonconstructivity in Finite Automata. |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Richard F. Bonner |
Quantum inductive inference by finite automata. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Non-Constructive Methods for Finite Probabilistic Automata. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
Learning with belief levels. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Solvita Zarina, Rusins Freivalds |
Computer graphics for quantum computation. |
SIGGRAPH Posters |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Artin's Conjecture and Size of Finite Probabilistic Automata. |
Pillars of Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guntis Deksnis, Rusins Freivalds, Oksana Scegulnaja-Dubrovska, Ruslan Tarasov, Solvita Zarina |
A Quantum Algorithm for Real Time Rendering. |
FCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds |
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Liva Garkaje |
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory. |
ISMVL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Non-constructive Methods for Finite Probabilistic Automata. |
Developments in Language Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Hamming, Permutations and Automata. |
SAGA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruben Agadzanyan, Rusins Freivalds |
Size of Quantum Finite State Transducers. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Rusins Freivalds (eds.) |
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings |
SWAT |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds |
Knot Theory, Jones Polynomial and Quantum Computing. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Renate Praude, Lelde Lace |
Some Graph Problems with Equivalent Lower Bounds for Query Complexity. |
FCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane |
Combinatorial Block Designs for Quantum Computing Problems. |
FCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols |
Size of Nondeterministic and Deterministic Automata for Certain Languages. |
FCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds |
Languages Recognizable by Quantum Finite Automata. |
CIAA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja |
Quantum Query Complexity for Some Graph Problems. |
SOFSEM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lelde Lace, Rusins Freivalds |
Lower Bounds for Query Complexity of Some Graph Problems. |
VLSI |
2003 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg |
Complexity of Decision Trees for Boolean Functions. (PDF / PS) |
ISMVL |
2003 |
DBLP DOI BibTeX RDF |
deterministic and nondeter-ministic decision tree, complexity, Boolean function |
| 1 | Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen |
Learning by the Process of Elimination. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Carl H. Smith |
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger |
Foreword. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
Hierarchies of probabilistic and team FIN-learning. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs |
Closedness properties in ex-identification. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
Towards Axiomatic Basis of Inductive Inference. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds (eds.) |
Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings |
FCT |
2001 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Andreas Winter |
Quantum Finite State Transducers. |
SOFSEM |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev |
Quantum versus Probabilistic One-Way Finite Automata with Counter. |
SOFSEM |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
The functions of finite support: a canonical learning problem. |
J. Exp. Theor. Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith |
On the Inductive Inference of Recursive Real-Valued Functions. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Rusins Freivalds, Carl H. Smith |
Inductive Inference with Procrastination: Back to Definitions. |
Fundam. Inform. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts |
Probabilities to accept languages by quantum finite automata |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds |
How to Simulate Free Will in a Computational Device. |
ACM Comput. Surv. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts |
Probabilities to Accept Languages by Quantum Finite Automata. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski |
Quantum Finite Multitape Automata. |
SOFSEM |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Rusins Freivalds |
1-way quantum finite automata: strengths, weaknesses and generalizations |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen |
Identifying Nearly Minimal Gödel Numbers from Additional Information. |
Ann. Math. Artif. Intell. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska |
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs |
Closedness Properties in EX-Identification of Recursive Functions. |
ALT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Rusins Freivalds |
1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
quantum computation, finite automata |
| 1 | Rusins Freivalds |
Models of Computation, Riemann Hypothesis, and Classical Mathematics. |
SOFSEM |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
A Logic of Discovery. |
Discovery Science |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Sanjay Jain |
Kolmogorov Numberings and Minimal Identification. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith |
Learning Small Programs with Additional Information. |
LFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith |
Team Learning as a Game. |
ALT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Kaneps, Dainis Geidmanis, Rusins Freivalds |
Tally Languages Accepted by Monte Carlo Pushdown Automata. |
RANDOM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Rusins Freivalds, Marek Karpinski |
Weak and Strong Recognition by 2-way Randomized Automata. |
RANDOM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
Learning Formulae from Elementary Facts. |
EuroCOLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
Asymmetric Team Learning. |
COLT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
On Duality in Learning and the Selection of Learning Terms. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Thomas Zeugmann |
Co-Learning of Recursive Languages from Positive Data. |
Ershov Memorial Conference |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Barzdins, Rusins Freivalds, Carl H. Smith |
Learning with Confidence. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Rusins Freivalds, Carl H. Smith |
General Inductive Inference Types Based on Linearly-Ordered Sets. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Rusins Freivalds |
Transformations that Preserve Learnability. |
ALT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs |
Unions of identifiable families of languages. |
ICGI |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
On the Intrinsic Complexity of Learning. |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
How Inductive Inference Strategies Discover Their Errors |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
On the Impact of Forgetting on Learning Machines. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
memory limited learning, machine learning, Kolmogorov complexity, inductive inference, probabilistic automata, pumping lemma, recursion theorem |
| 1 | Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan |
Measure, Category and Learning Theory. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Marek Karpinski |
Lower Time Bounds for Randomized Computation. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
Probabilistic versus Deterministic Memory Limited Learning. |
GOSLER Final Report |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
Learning from Good Examples. |
GOSLER Final Report |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
Error Detecting in Inductive Inference. |
GOSLER Final Report |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
On the intrinsic complexity of learning. |
EuroCOLT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Sanjay Jain |
Kolmogorov numberings and minimal identification. |
EuroCOLT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
On the Inductive Inference of Real Valued Functions. |
COLT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Achim G. Hoffmann |
An inductive inference approach to classification. |
J. Exp. Theor. Artif. Intell. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Marek Karpinski |
Lower Space Bounds for Randomized Computation. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen |
Identifying Nearly Minimal Gödel Numbers From Additional Information. |
AII/ALT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith |
Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. |
AII/ALT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Marek Karpinski, Carl H. Smith |
Co-Learning of Total Recursive Functions. |
COLT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
Choosing a learning team: a topological approach. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen |
On the Power of Inductive Inference from Good Examples. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Carl H. Smith |
On the Role of Procrastination in Machine Learning |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
On the impact of forgetting on learing machines. |
Bulletin of the EATCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
On the impact of forgetting on learing machines. |
Bulletin of the EATCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | Rusins Freivalds, Carl H. Smith |
On the Duality Between Mechanistic Learners and What it is They Learn. |
ALT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Efim B. Kinber, Carl H. Smith |
On the Impact of Forgetting on Learning Machines. |
COLT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rusins Freivalds, Achim G. Hoffmann |
An Inductive Inference Appoach to Classification. |
AII |
1992 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")