Rusins Freivalds

149 papers A* 12A 2B 25C 12Misc 2Journal 45Unranked 44

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	On block pumpable languages. Theor. Comput. Sci. Christopher Hanrui Chak, Rusins Freivalds, Frank Stephan, Henrietta Tan Wan Yik
2015	—	`conf`	Advantages of Ultrametric Counter Automata. SOFSEM (Student Research Forum Papers / Posters) Valdis Adamsons, Karlis Jerins, Rihards Krislauks, Marta Lapina, Andris Pakulis, Rusins Freivalds
2015	J	`jnl`	Deterministic Frequency Pushdown Automata. J. Univers. Comput. Sci. Cristian S. Calude, Rusins Freivalds, Sanjay Jain, Frank Stephan
2015	—	`conf`	Experiments in Complexity of Probabilistic and Ultrametric Automata. SOFSEM (Student Research Forum Papers / Posters) Kristine Cipola, Andris Pakulis, Rusins Freivalds
2015	—	`conf`	Frequency Pushdown Automata. SOFSEM (Student Research Forum Papers / Posters) Ilmars Puzulis, Rusins Freivalds
2015	—	`conf`	Quantum Queries on Permutations. DCFS Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, Rusins Freivalds
2015	C	`conf`	Structured Frequency Algorithms. TAMC Kaspars Balodis, Janis Iraids, Rusins Freivalds
2015	—	`conf`	Superimposed Codes and Query Algorithms. SOFSEM (Student Research Forum Papers / Posters) Anete Lace, Muntis Rudzitis, Eriks Gopaks, Rusins Freivalds
2015	—	`conf`	Ultrametric Algorithms and Automata. UCNC Rusins Freivalds
2014	B	`conf`	Active Learning of Recursive Functions by Ultrametric Algorithms. SOFSEM Rusins Freivalds, Thomas Zeugmann
2014	—	`ed.`	Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday Computing with New Resources Cristian S. Calude, Rusins Freivalds, Kazuo Iwama
2014	J	`jnl`	On the Influence of Technology on Learning Processes. Parallel Process. Lett. Ilja Kucevalovs, Ojars Krasts, Rusins Freivalds, Thomas Zeugmann
2014	—	`conf`	Ultrametric Vs. Quantum Query Algorithms. TPNC Rusins Freivalds
2014	—	`conf`	Visual Representation of von Koch Fractals. Discrete Mathematics and Computer Science Rusins Freivalds, Solvita Zarina
2013	—	`ed.`	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I ICALP (1) Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
2013	—	`ed.`	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II ICALP (2) Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
2013	C	`conf`	On the Size Complexity of Deterministic Frequency Automata. LATA Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan
2013	J	`jnl`	Preface. Fundam. Informaticae Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider
2013	C	`conf`	Ultrametric Finite Automata and Turing Machines. Developments in Language Theory Rusins Freivalds
2012	—	`conf`	Hartmanis-Stearns Conjecture on Real Time and Transcendence. Computation, Physics and Beyond Rusins Freivalds
2012	C	`conf`	Multiple Usage of Random Bits in Finite Automata. TAMC Rusins Freivalds
2012	J	`jnl`	Quantum computation with write-only memory. Nat. Comput. Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2012	—	`conf`	Ultrametric automata and Turing machines. Turing-100 Rusins Freivalds
2011	—	`conf`	Algorithmic Information Theory and Computational Complexity. Algorithmic Probability and Friends Rusins Freivalds
2011	—	`conf`	Frequency Prediction of Functions. MEMICS Kaspars Balodis, Ilja Kucevalovs, Rusins Freivalds
2011	J	`jnl`	Nondeterministic Query Algorithms. J. Univers. Comput. Sci. Alina Vasilieva, Rusins Freivalds
2011	C	`conf`	On the Amount of Nonconstructivity in Learning Recursive Functions. TAMC Rusins Freivalds, Thomas Zeugmann
2010	J	`jnl`	A new family of nonstochastic languages. Inf. Process. Lett. Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say
2010	J	`jnl`	Amount of nonconstructivity in deterministic finite automata. Theor. Comput. Sci. Rusins Freivalds
2010	C	`conf`	Finite State Transducers with Intuition. UC Ruben Agadzanyan, Rusins Freivalds
2010	C	`conf`	Postselection Finite Quantum Automata. UC Oksana Scegulnaja-Dubrovska, Lelde Lace, Rusins Freivalds
2010	C	`conf`	Quantum Computation with Devices Whose Contents Are Never Read. UC Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2010	J	`jnl`	Quantum computation with devices whose contents are never read CoRR Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan
2009	C	`conf`	Amount of Nonconstructivity in Finite Automata. CIAA Rusins Freivalds
2009	B	`conf`	Group Input Machine. SOFSEM Ruslans Tarasovs, Rusins Freivalds
2009	J	`jnl`	Improved constructions of mixed state quantum automata. Theor. Comput. Sci. Rusins Freivalds, Maris Ozols, Laura Mancinska
2009	C	`conf`	Quantum Queries on Permutations with a Promise. CIAA Rusins Freivalds, Kazuo Iwama
2008	—	`conf`	A Quantum Algorithm for Real Time Rendering. FCS Guntis Deksnis, Rusins Freivalds, Oksana Scegulnaja-Dubrovska, Ruslan Tarasov, Solvita Zarina
2008	—	`conf`	Artin's Conjecture and Size of Finite Probabilistic Automata. Pillars of Computer Science Rusins Freivalds
2008	—	`conf`	Computer graphics for quantum computation. SIGGRAPH Posters Solvita Zarina, Rusins Freivalds
2008	J	`jnl`	Learning with belief levels. J. Comput. Syst. Sci. Janis Barzdins, Rusins Freivalds, Carl H. Smith
2008	J	`jnl`	Non-Constructive Methods for Finite Probabilistic Automata. Int. J. Found. Comput. Sci. Rusins Freivalds
2008	J	`jnl`	Quantum inductive inference by finite automata. Theor. Comput. Sci. Rusins Freivalds, Richard F. Bonner
2008	B	`conf`	Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. ISAAC Rusins Freivalds
2007	—	`conf`	Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory. ISMVL Rusins Freivalds, Liva Garkaje
2007	—	`conf`	Hamming, Permutations and Automata. SAGA Rusins Freivalds
2007	C	`conf`	Non-constructive Methods for Finite Probabilistic Automata. Developments in Language Theory Rusins Freivalds
2007	—	`conf`	Size of Quantum Finite State Transducers. SOFSEM (1) Ruben Agadzanyan, Rusins Freivalds
2006	—	`ed.`	Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings SWAT Lars Arge, Rusins Freivalds
2005	B	`conf`	Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms. SOFSEM Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina
2005	—	`conf`	Combinatorial Block Designs for Quantum Computing Problems. FCS Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane
2005	B	`conf`	Knot Theory, Jones Polynomial and Quantum Computing. MFCS Rusins Freivalds
2005	C	`conf`	Languages Recognizable by Quantum Finite Automata. CIAA Rusins Freivalds
2005	—	`conf`	Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols
2005	—	`conf`	Some Graph Problems with Equivalent Lower Bounds for Query Complexity. FCS Rusins Freivalds, Renate Praude, Lelde Lace
2004	B	`conf`	Quantum Query Complexity for Some Graph Problems. SOFSEM Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja
2003	—	`conf`	Complexity of Decision Trees for Boolean Functions. ISMVL Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg
2003	—	`conf`	Lower Bounds for Query Complexity of Some Graph Problems. VLSI Lelde Lace, Rusins Freivalds
2003	—	`conf`	Size of Quantum Versus Deterministic Finite Automata. VLSI Andris Ambainis, Uldis Barbans, Agnese Belousova, Aleksandrs Belovs, Ilze Dzelme, Girts Folkmanis, Rusins Freivalds, Peteris Ledins, Rihards Opmanis, Agnis Skuskovniks
2002	B	`conf`	Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. LATIN Rusins Freivalds, Carl H. Smith
2002	J	`jnl`	Learning by the Process of Elimination. Inf. Comput. Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
2001	J	`jnl`	Closedness properties in ex-identification. Theor. Comput. Sci. Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
2001	J	`jnl`	Foreword. Theor. Comput. Sci. Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
2001	B	`ed.`	Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings FCT Rusins Freivalds
2001	J	`jnl`	Hierarchies of probabilistic and team FIN-learning. Theor. Comput. Sci. Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
2001	B	`conf`	Quantum Finite State Transducers. SOFSEM Rusins Freivalds, Andreas J. Winter
2001	B	`conf`	Quantum versus Probabilistic One-Way Finite Automata with Counter. SOFSEM Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev
2001	B	`conf`	Towards Axiomatic Basis of Inductive Inference. FCT Janis Barzdins, Rusins Freivalds, Carl H. Smith
1999	J	`jnl`	How to Simulate Free Will in a Computational Device. ACM Comput. Surv. Rusins Freivalds
1999	J	`jnl`	Inductive Inference with Procrastination: Back to Definitions. Fundam. Informaticae Andris Ambainis, Rusins Freivalds, Carl H. Smith
1999	J	`jnl`	On the Inductive Inference of Recursive Real-Valued Functions. Theor. Comput. Sci. Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith
1999	Misc	`conf`	Probabilities to Accept Languages by Quantum Finite Automata. COCOON Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
1999	J	`jnl`	Probabilities to accept languages by quantum finite automata CoRR Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
1999	B	`conf`	Quantum Finite Multitape Automata. SOFSEM Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski
1999	J	`jnl`	The functions of finite support: a canonical learning problem. J. Exp. Theor. Artif. Intell. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1998	A*	`conf`	1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. FOCS Andris Ambainis, Rusins Freivalds
1998	J	`jnl`	1-way quantum finite automata: strengths, weaknesses and generalizations CoRR Andris Ambainis, Rusins Freivalds
1998	B	`conf`	A Logic of Discovery. Discovery Science Janis Barzdins, Rusins Freivalds, Carl H. Smith
1998	B	`conf`	Closedness Properties in EX-Identification of Recursive Functions. ALT Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
1998	J	`jnl`	Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
1998	B	`conf`	Models of Computation, Riemann Hypothesis, and Classical Mathematics. SOFSEM Rusins Freivalds
1998	B	`conf`	Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. MFCS Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska
1998	J	`jnl`	On the Relative Sizes of Learnable Sets. Theor. Comput. Sci. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
1997	A*	`conf`	Asymmetric Team Learning. COLT Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
1997	B	`conf`	Effects of Kolmogorov Complexity Present in Inductive Inference as Well. ALT Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs
1997	J	`jnl`	Kolmogorov Numberings and Minimal Identification. Theor. Comput. Sci. Rusins Freivalds, Sanjay Jain
1997	—	`conf`	Learning Formulae from Elementary Facts. EuroCOLT Janis Barzdins, Rusins Freivalds, Carl H. Smith
1997	Misc	`conf`	Learning Small Programs with Additional Information. LFCS Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith
1997	—	`conf`	Tally Languages Accepted by Monte Carlo Pushdown Automata. RANDOM Janis Kaneps, Dainis Geidmanis, Rusins Freivalds
1997	B	`conf`	Team Learning as a Game. ALT Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith
1997	—	`conf`	Weak and Strong Recognition by 2-way Randomized Automata. RANDOM Andris Ambainis, Rusins Freivalds, Marek Karpinski
1996	—	`conf`	Co-Learning of Recursive Languages from Positive Data. Ershov Memorial Conference Rusins Freivalds, Thomas Zeugmann
1996	A	`conf`	General Inductive Inference Types Based on Linearly-Ordered Sets. STACS Andris Ambainis, Rusins Freivalds, Carl H. Smith
1996	A	`conf`	Learning with Confidence. STACS Janis Barzdins, Rusins Freivalds, Carl H. Smith
1996	J	`jnl`	On Duality in Learning and the Selection of Learning Terms. Inf. Comput. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
1996	B	`conf`	Transformations that Preserve Learnability. ALT Andris Ambainis, Rusins Freivalds
1996	—	`conf`	Unions of identifiable families of languages. ICGI Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
1995	—	`conf`	Error Detecting in Inductive Inference. GOSLER Final Report Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1995	J	`jnl`	How Inductive Inference Strategies Discover Their Errors Inf. Comput. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1995	—	`conf`	Kolmogorov numberings and minimal identification. EuroCOLT Rusins Freivalds, Sanjay Jain
1995	—	`conf`	Learning from Good Examples. GOSLER Final Report Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1995	A*	`conf`	Lower Time Bounds for Randomized Computation. ICALP Rusins Freivalds, Marek Karpinski
1995	A*	`conf`	Measure, Category and Learning Theory. ICALP Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
1995	J	`jnl`	On the Impact of Forgetting on Learning Machines. J. ACM Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1995	A*	`conf`	On the Inductive Inference of Real Valued Functions. COLT Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
1995	J	`jnl`	On the Intrinsic Complexity of Learning. Inf. Comput. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1995	—	`conf`	On the intrinsic complexity of learning. EuroCOLT Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1995	—	`conf`	Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1994	J	`jnl`	An inductive inference approach to classification. J. Exp. Theor. Artif. Intell. Rusins Freivalds, Achim G. Hoffmann
1994	A*	`conf`	Choosing a learning team: a topological approach. STOC Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
1994	A*	`conf`	Co-Learning of Total Recursive Functions. COLT Rusins Freivalds, Marek Karpinski, Carl H. Smith
1994	—	`conf`	Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. AII/ALT Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith
1994	—	`conf`	Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
1994	A*	`conf`	Lower Space Bounds for Randomized Computation. ICALP Rusins Freivalds, Marek Karpinski
1993	B	`conf`	On the Duality Between Mechanistic Learners and What it is They Learn. ALT Rusins Freivalds, Carl H. Smith
1993	A*	`conf`	On the Impact of Forgetting on Learning Machines. COLT Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1993	J	`jnl`	On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1993	J	`jnl`	On the Role of Procrastination in Machine Learning Inf. Comput. Rusins Freivalds, Carl H. Smith
1993	J	`jnl`	On the impact of forgetting on learing machines. Bull. EATCS Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1993	J	`jnl`	On the impact of forgetting on learing machines. Bull. EATCS Rusins Freivalds, Efim B. Kinber, Carl H. Smith
1992	—	`conf`	An Inductive Inference Appoach to Classification. AII Rusins Freivalds, Achim G. Hoffmann
1992	—	`conf`	Memory Limited Inductive Inference Machines. SWAT Rusins Freivalds, Carl H. Smith
1992	A*	`conf`	On the Role of Procrastination for Machine Learning. COLT Rusins Freivalds, Carl H. Smith
1992	—	`conf`	Unions of Identifiable Classes of Total Recursive Functions. AII Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs
1991	—	`ch.`	Complexity of Probabilistic Versus Deterministic Automata. Baltic Computer Science Rusins Freivalds
1991	—	`conf`	Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1991	—	`ch.`	Inductive Inference of Recursive Functions: Complexity Bounds. Baltic Computer Science Rusins Freivalds, Janis Barzdins, Karlis Podnieks
1991	—	`ch.`	Inductive Inference of Recursive Functions: Qualitative Theory. Baltic Computer Science Rusins Freivalds
1991	A*	`conf`	Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. ICALP Janis Kaneps, Rusins Freivalds
1990	A*	`conf`	Inductive Inference of Minimal Programs. COLT Rusins Freivalds
1990	B	`conf`	Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. MFCS Janis Kaneps, Rusins Freivalds
1989	—	`conf`	Inductive Inference from Good Examples. AII Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1989	—	`conf`	Inductive Inference up to Immune Sets. AII Rusins Freivalds, Juris Viksna
1989	J	`jnl`	On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1989	J	`jnl`	Trade-Off among Parameters Effecting Inductive Inference Inf. Comput. Rusins Freivalds, Carl H. Smith, Mahendran Velauthapillai
1988	J	`jnl`	Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Math. Log. Q. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1988	J	`jnl`	Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions. J. Inf. Process. Cybern. Masahiro Miyakawa, Ivan Stojmenovic, Teruo Hikita, Hajime Machida, Rusins Freivalds
1986	B	`conf`	Why Sometimes Probabilistic Algorithms Can Be More Effective. MFCS Farid M. Ablayev, Rusins Freivalds
1985	J	`jnl`	Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets. Bull. EATCS Rusins Freivalds
1984	J	`jnl`	An answer to an open problem. Bull. EATCS Rusins Freivalds
1984	J	`jnl`	Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Math. Log. Q. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1984	J	`jnl`	On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber
1983	—	`conf`	Methods and Languages to Prove the Power of Probabilistic Machines. IFIP Congress Rusins Freivalds
1983	B	`conf`	Space and Reversal Complexity of Probabilistic One-Way Turing Machines. FCT Rusins Freivalds
1982	J	`jnl`	Inductive Inference and Computable One-One Numberings. Math. Log. Q. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
1981	B	`conf`	Probabilistic Two-Way Machines. MFCS Rusins Freivalds
1981	J	`jnl`	Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata. Inf. Process. Lett. Rusins Freivalds
1979	B	`conf`	Fast Probabilistic Algorithms. MFCS Rusins Freivalds
1977	—	`conf`	Probabilistic Machines Can Use Less Running Time. IFIP Congress Rusins Freivalds