Rusins Freivalds

According to our database1, Rusins Freivalds
  • authored at least 144 papers between 1977 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
On block pumpable languages.
Theor. Comput. Sci., 2016

2015
Deterministic Frequency Pushdown Automata.
J. UCS, 2015

Ultrametric Algorithms and Automata.
Proceedings of the Unconventional Computation and Natural Computation, 2015

Structured Frequency Algorithms.
Proceedings of the Theory and Applications of Models of Computation, 2015

Frequency Pushdown Automata.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Superimposed Codes and Query Algorithms.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Experiments in Complexity of Probabilistic and Ultrametric Automata.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Advantages of Ultrametric Counter Automata.
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Quantum Queries on Permutations.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
On the Influence of Technology on Learning Processes.
Parallel Processing Letters, 2014

Ultrametric Vs. Quantum Query Algorithms.
Proceedings of the Theory and Practice of Natural Computing, 2014

Active Learning of Recursive Functions by Ultrametric Algorithms.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Visual Representation of von Koch Fractals.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Preface.
Fundam. Inform., 2013

On the Size Complexity of Deterministic Frequency Automata.
Proceedings of the Language and Automata Theory and Applications, 2013

Ultrametric Finite Automata and Turing Machines.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Quantum computation with write-only memory.
Natural Computing, 2012

Multiple Usage of Random Bits in Finite Automata.
Proceedings of the Theory and Applications of Models of Computation, 2012

Ultrametric automata and Turing machines.
Proceedings of the Turing-100, 2012

Hartmanis-Stearns Conjecture on Real Time and Transcendence.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Nondeterministic Query Algorithms.
J. UCS, 2011

On the Amount of Nonconstructivity in Learning Recursive Functions.
Proceedings of the Theory and Applications of Models of Computation, 2011

Frequency Prediction of Functions.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

Algorithmic Information Theory and Computational Complexity.
Proceedings of the Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence, 2011

2010
Amount of nonconstructivity in deterministic finite automata.
Theor. Comput. Sci., 2010

A new family of nonstochastic languages.
Inf. Process. Lett., 2010

Quantum computation with devices whose contents are never read
CoRR, 2010

Quantum Computation with Devices Whose Contents Are Never Read.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Postselection Finite Quantum Automata.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Finite State Transducers with Intuition.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

2009
Improved constructions of mixed state quantum automata.
Theor. Comput. Sci., 2009

Quantum Queries on Permutations with a Promise.
Proceedings of the Implementation and Application of Automata, 2009

Amount of Nonconstructivity in Finite Automata.
Proceedings of the Implementation and Application of Automata, 2009

Group Input Machine.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008
Quantum inductive inference by finite automata.
Theor. Comput. Sci., 2008

Learning with belief levels.
J. Comput. Syst. Sci., 2008

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

Computer graphics for quantum computation.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2008

Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

A Quantum Algorithm for Real Time Rendering.
Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

Artin's Conjecture and Size of Finite Probabilistic Automata.
Proceedings of the Pillars of Computer Science, 2008

2007
Size of Quantum Finite State Transducers.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Hamming, Permutations and Automata.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory.
Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

Non-constructive Methods for Finite Probabilistic Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2005
Languages Recognizable by Quantum Finite Automata.
Proceedings of the Implementation and Application of Automata, 2005

Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Knot Theory, Jones Polynomial and Quantum Computing.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Size of Nondeterministic and Deterministic Automata for Certain Languages.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Some Graph Problems with Equivalent Lower Bounds for Query Complexity.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Combinatorial Block Designs for Quantum Computing Problems.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

2004
Quantum Query Complexity for Some Graph Problems.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

2003
Lower Bounds for Query Complexity of Some Graph Problems.
Proceedings of the International Conference on VLSI, 2003

Size of Quantum Versus Deterministic Finite Automata.
Proceedings of the International Conference on VLSI, 2003

Complexity of Decision Trees for Boolean Functions.
Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

2002
Learning by the Process of Elimination.
Inf. Comput., 2002

Category, Measure, Inductive Inference: A Triality Theorem and Its Applications.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Foreword.
Theor. Comput. Sci., 2001

Closedness properties in ex-identification.
Theor. Comput. Sci., 2001

Hierarchies of probabilistic and team FIN-learning.
Theor. Comput. Sci., 2001

Quantum Finite State Transducers.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Quantum versus Probabilistic One-Way Finite Automata with Counter.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Towards Axiomatic Basis of Inductive Inference.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

1999
On the Inductive Inference of Recursive Real-Valued Functions.
Theor. Comput. Sci., 1999

The functions of finite support: a canonical learning problem.
J. Exp. Theor. Artif. Intell., 1999

Inductive Inference with Procrastination: Back to Definitions.
Fundam. Inform., 1999

How to Simulate Free Will in a Computational Device.
ACM Comput. Surv., 1999

Probabilities to accept languages by quantum finite automata
CoRR, 1999

Quantum Finite Multitape Automata.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Probabilities to Accept Languages by Quantum Finite Automata.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
On the Relative Sizes of Learnable Sets.
Theor. Comput. Sci., 1998

1-way quantum finite automata: strengths, weaknesses and generalizations
CoRR, 1998

Identifying Nearly Minimal Gödel Numbers from Additional Information.
Ann. Math. Artif. Intell., 1998

Models of Computation, Riemann Hypothesis, and Classical Mathematics.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

A Logic of Discovery.
Proceedings of the Discovery Science, 1998

Closedness Properties in EX-Identification of Recursive Functions.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Kolmogorov Numberings and Minimal Identification.
Theor. Comput. Sci., 1997

Tally Languages Accepted by Monte Carlo Pushdown Automata.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Weak and Strong Recognition by 2-way Randomized Automata.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Learning Small Programs with Additional Information.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Learning Formulae from Elementary Facts.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Asymmetric Team Learning.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

Team Learning as a Game.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

Effects of Kolmogorov Complexity Present in Inductive Inference as Well.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
On Duality in Learning and the Selection of Learning Terms.
Inf. Comput., 1996

Learning with Confidence.
Proceedings of the STACS 96, 1996

General Inductive Inference Types Based on Linearly-Ordered Sets.
Proceedings of the STACS 96, 1996

Unions of identifiable families of languages.
Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

Co-Learning of Recursive Languages from Positive Data.
Proceedings of the Perspectives of System Informatics, 1996

Transformations that Preserve Learnability.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
How Inductive Inference Strategies Discover Their Errors
Inf. Comput., May, 1995

On the Impact of Forgetting on Learning Machines.
J. ACM, 1995

On the Intrinsic Complexity of Learning.
Inf. Comput., 1995

Lower Time Bounds for Randomized Computation.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Measure, Category and Learning Theory.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Learning from Good Examples.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Error Detecting in Inductive Inference.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Probabilistic versus Deterministic Memory Limited Learning.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

On the intrinsic complexity of learning.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

Kolmogorov numberings and minimal identification.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

On the Inductive Inference of Real Valued Functions.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994
An inductive inference approach to classification.
J. Exp. Theor. Artif. Intell., 1994

Choosing a learning team: a topological approach.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Lower Space Bounds for Randomized Computation.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Co-Learning of Total Recursive Functions.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions.
Proceedings of the Algorithmic Learning Theory, 1994

Identifying Nearly Minimal Gödel Numbers From Additional Information.
Proceedings of the Algorithmic Learning Theory, 1994

1993
On the Role of Procrastination in Machine Learning
Inf. Comput., December, 1993

On the Power of Inductive Inference from Good Examples.
Theor. Comput. Sci., 1993

On the impact of forgetting on learing machines.
Bulletin of the EATCS, 1993

On the impact of forgetting on learing machines.
Bulletin of the EATCS, 1993

On the Impact of Forgetting on Learning Machines.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On the Duality Between Mechanistic Learners and What it is They Learn.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
Memory Limited Inductive Inference Machines.
Proceedings of the Algorithm Theory, 1992

On the Role of Procrastination for Machine Learning.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

An Inductive Inference Appoach to Classification.
Proceedings of the Analogical and Inductive Inference, 1992

Unions of Identifiable Classes of Total Recursive Functions.
Proceedings of the Analogical and Inductive Inference, 1992

1991
Dual Types of Hypotheses in Inductive Inference.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Inductive Inference of Recursive Functions: Complexity Bounds.
Proceedings of the Baltic Computer Science, Selected Papers, 1991

Complexity of Probabilistic Versus Deterministic Automata.
Proceedings of the Baltic Computer Science, Selected Papers, 1991

Inductive Inference of Recursive Functions: Qualitative Theory.
Proceedings of the Baltic Computer Science, Selected Papers, 1991

1990
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Inductive Inference of Minimal Programs.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Trade-Off among Parameters Effecting Inductive Inference
Inf. Comput., September, 1989

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings.
Elektronische Informationsverarbeitung und Kybernetik, 1989

Inductive Inference up to Immune Sets.
Proceedings of the Analogical and Inductive Inference, 1989

Inductive Inference from Good Examples.
Proceedings of the Analogical and Inductive Inference, 1989

1988
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.
Math. Log. Q., 1988

Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions.
Elektronische Informationsverarbeitung und Kybernetik, 1988

1986
Why Sometimes Probabilistic Algorithms Can Be More Effective.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets.
Bulletin of the EATCS, 1985

1984
On the Power of Probabilistic Strategies in Inductive Inference.
Theor. Comput. Sci., 1984

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings.
Math. Log. Q., 1984

An answer to an open problem.
Bulletin of the EATCS, 1984

1983
Methods and Languages to Prove the Power of Probabilistic Machines.
IFIP Congress, 1983

Space and Reversal Complexity of Probabilistic One-Way Turing Machines.
Proceedings of the Fundamentals of Computation Theory, 1983

1982
Inductive Inference and Computable One-One Numberings.
Math. Log. Q., 1982

1981
Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata.
Inf. Process. Lett., 1981

Probabilistic Two-Way Machines.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1979
Fast Probabilistic Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
Probabilistic Machines Can Use Less Running Time.
IFIP Congress, 1977


  Loading...