Rūsiņš Mārtiņš Freivalds | Academic Influence

Rūsiņš Mārtiņš Freivalds's AcademicInfluence.com Rankings

Rūsiņš Mārtiņš Freivalds

Mathematics

#6758

World Rank

#9306

Historical Rank

Measure Theory

#3172

World Rank

#3757

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Rūsiņš Mārtiņš Freivalds's Degrees

PhD Mathematics University of Latvia

Why Is Rūsiņš Mārtiņš Freivalds Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rūsiņš Mārtiņš Freivalds was a Latvian computer scientist and mathematician. He was a member of the Latvian Academy of Sciences from 1992. He discovered Freivalds' algorithm for checking the correctness of matrix products. He also taught at the University of Latvia, with students including Daina Taimiņa and Andris Ambainis. He was born in Cesvaine and studied at Moscow State University .

(See a Problem?)

Rūsiņš Mārtiņš Freivalds's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

1-way quantum finite automata: strengths, weaknesses and generalizations (1998) (268)
Fast Probabilistic Algorithms (1979) (200)
Probabilistic Two-Way Machines (1981) (159)
Probabilistic Machines Can Use Less Running Time (1977) (146)
A Logic of Discovery (1998) (105)
On the role of procrastination for machine learning (1992) (72)
On the Role of Procrastination in Machine Learning (1993) (61)
On the Power of Probabilistic Strategies in Inductive Inference (1984) (57)
On the Power of Inductive Inference from Good Examples (1993) (52)
On the Intrinsic Complexity of Learning (1995) (49)
Inductive Inference of Recursive Functions: Qualitative Theory (1991) (48)
Lower Space Bounds for Randomized Computation (1994) (48)
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines (1990) (44)
On the impact of forgetting on learning machines (1995) (37)
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata (1991) (36)
Probabilities to Accept Languages by Quantum Finite Automata (1999) (35)
Inductive Inference from Good Examples (1989) (29)
Complexity of Probabilistic Versus Deterministic Automata (1991) (27)
Non-Constructive Methods for Finite Probabilistic Automata (2007) (27)
Trade-Off among Parameters Effecting Inductive Inference (1989) (27)
Inductive Inference of Recursive Functions: Complexity Bounds (1991) (26)
Inductive Inference with Procrastination: Back to Definitions (1999) (23)
Quantum computation with write-only memory (2012) (23)
Why Sometimes Probabilistic Algorithms Can Be More Effective (1996) (22)
How Inductive Inference Strategies Discover Their Errors (1995) (22)
Amount of nonconstructivity in deterministic finite automata (2010) (21)
Space and Reversal Complexity of Probabilistic One-Way Turing Machines (1983) (20)
Co-learning of total recursive functions (1994) (19)
Quantum Query Complexity for Some Graph Problems (2004) (19)
Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata (1981) (19)
Inductive Inference and Computable One-One Numberings (1982) (18)
A new family of nonstochastic languages (2010) (17)
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings (1988) (16)
Tally Languages Accepted by Monte Carlo Pushdown Automata (1997) (15)
Improved constructions of mixed state quantum automata (2009) (15)
Quantum versus Probabilistic One-Way Finite Automata with Counter (2001) (15)
Languages Recognizable by Quantum Finite Automata (2005) (14)
Ultrametric automata and Turing machines (2012) (14)
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings (1984) (14)
A survey of quantum learning (2003) (13)
Quantum Finite State Transducers (2000) (13)
Quantum Computation with Devices Whose Contents Are Never Read (2010) (13)
Amount of Nonconstructivity in Finite Automata (2009) (12)
Postselection Finite Quantum Automata (2010) (11)
Co-Learning of Recursive Languages from Positive Data (1996) (11)
Unions of Identifiable Classes of Total Recursive Functions (1992) (10)
Inductive Inference of Minimal Programs (1990) (10)
Learning with Confidence (1996) (10)
On the impact of forgetting on learning machines (1993) (10)
An answer to an open problem (1984) (8)
Learning from Good Examples (1995) (8)
Measure, Category and Learning Theory (1995) (8)
Learning in Informal Settings (2012) (8)
Quantum Finite Multitape Automata (1999) (8)
Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions (1994) (7)
Choosing a learning team: a topological approach (1994) (7)
Effects of Kolmogorov Complexity Present in Inductive Inference as Well (1997) (7)
On the Inductive Inference of Recursive Real-Valued Functions (1999) (7)
On the Relative Sizes of Learnable Sets (1998) (7)
On the inductive inference of real valued functions (1995) (7)
Quantum Queries on Permutations with a Promise (2009) (7)
Transformations that Preserve Learnability (1996) (7)
Kolmogorov Numberings and Minimal Identification (1995) (7)
Ultrametric Finite Automata and Turing Machines (2013) (6)
Lower Time Bounds for Randomized Computation (1995) (6)
Memory Limited Inductive Inference Machines (1992) (6)
An inductive inference approach to classification (1994) (6)
On the State Complexity of Ultrametric Finite Automata (2012) (6)
General Inductive Inference Types Based on Linearly-Ordered Sets (1996) (5)
Learning and Development After School (2012) (5)
Hartmanis-Stearns Conjecture on Real Time and Transcendence (2012) (5)
Hierarchies of probabilistic and team FIN-learning (2001) (5)
Frequency Prediction of Functions (2011) (5)
Edinburgh Research Explorer Proof Systems for Retracts in Simply Typed Lambda Calculus (2013) (5)
Finite State Transducers with Intuition (2010) (5)
Inductive Inference up to Immune Sets (1989) (4)
Learning Formulae from Elementary Facts (1997) (4)
Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions (1988) (4)
Learning by the Process of Elimination (2002) (4)
On the Size Complexity of Deterministic Frequency Automata (2013) (4)
Knot Theory, Jones Polynomial and Quantum Computing (2005) (4)
Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets (1985) (4)
Quantum Queries on Permutations (2015) (4)
Asymmetric team learning (1997) (4)
Ultrametric Turing Machines with Limited Reversal Complexity ? (2012) (3)
Probabilistic versus Deterministic Memory Limited Learning (1995) (3)
How to simulate free will in a computational device (1999) (3)
Active Learning of Recursive Functions by Ultrametric Algorithms (2014) (3)
Closedness properties in ex-identification (2001) (3)
Multiple Usage of Random Bits in Finite Automata (2012) (3)
Identifying nearly minimal Gödel numbers from additional information (1994) (3)
On the Duality Between Mechanistic Learners and What it is They Learn (1993) (3)
On the Amount of Nonconstructivity in Learning Recursive Functions (2011) (3)
Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms (2005) (3)
Closedness Properties in EX-Identification of Recursive Functions (1998) (2)
Advantages of Ultrametric Counter Automata (2015) (2)
On Duality in Learning and the Selection of Learning Terms (1996) (2)
Learning from Text (2012) (2)
Models of Computation, Riemann Hypothesis, and Classical Mathematics (1998) (2)
Proceedings of the 13th International Symposium on Fundamentals of Computation Theory (2001) (2)
Size of Quantum Versus Deterministic Finite Automata (2003) (2)
Team Learning as a Game (1997) (2)
Learning Through the Breach: Language Socialization (2012) (2)
Unions of identifiable families of languages (1996) (2)
Methods and Languages to Prove the Power of Probabilistic Machines (1983) (2)
An Inductive Inference Appoach to Classification (1992) (1)
Permutation Groups and the Strength of Quantum Finite Automata with Mixed States ⋆ (2007) (1)
Learning with belief levels (2008) (1)
Weak and Strong Recognition by 2-way Randomized Automata (1997) (1)
Structured Frequency Algorithms (2015) (1)
Nondeterministic Query Algorithms (2011) (1)
Deterministic Frequency Pushdown Automata (2015) (1)
On computation in the limit by non-deterministic Turing machines (1974) (1)
Hamming, Permutations and Automata (2007) (1)
On block pumpable languages (2016) (1)
Complexity of decision trees for Boolean functions (2003) (1)
Quantum inductive inference by finite automata (2008) (1)
Artin's Conjecture and Size of Finite Probabilistic Automata (2008) (1)
Algorithmic Information Theory and Computational Complexity (2011) (1)
Experiments in Complexity of Probabilistic and Ultrametric Automata (2015) (1)
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States (2008) (1)
Learning Goals: (2020) (0)
Complexity of decision trees for Boolean operators : a shortened version (1992) (0)
Series Deterministic Frequency Pushdown Automata (2013) (0)
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages (1998) (0)
THE COMPUTATIONAL ADVANTAGE OF PROBABILISTIC AUTOMATA OVER DETERMINISTIC AUTOMATA IN HYPERBOLIC PLANE∗ (2012) (0)
Quantum Computation and Learning : Proc. Int. Workshop, September 1999, Riga (1999) (0)
Quantum Computation and Learning : Third International Workshop, QCL 2002Riga, Latvia, Revised Proceedings (2003) (0)
The functions of finite support: a canonical learning problem (1999) (0)
On the Influence of Technology on Learning Processes (2014) (0)
Computer graphics for quantum computation (2008) (0)
Quantum computation with write-only memory (2011) (0)
Quantum Computers and Quantum Automata (2000) (0)
Learning Small Programs with Additional Information (1997) (0)
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications (2002) (0)
Some Graph Problems with Equivalent Lower Bounds for Query Complexity (2005) (0)
Ultrametric Algorithms and Automata (2015) (0)
Group Input Machine (2009) (0)
On the impact of forgetting on learing machines (1993) (0)
Lower Bounds for Query Complexity of Some Graph Problems (2003) (0)
Error Detecting in Inductive Inference (1995) (0)
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory (2007) (0)
Probabilistic and Frequency Finite-State Transducers (2011) (0)
Superimposed Codes and Query Algorithms (2015) (0)
Combinatorial Block Designs for Quantum Computing Problems (2005) (0)
Dual Types of Hypotheses in Inductive Inference (1991) (0)
Frequency Pushdown Automata (2015) (0)
Fundamentals of Computation Theory (1977) (0)
Size of Nondeterministic and Deterministic Automata for Certain Languages (2005) (0)
A model for computational simulation of intuition (2014) (0)
Ultrametric Vs. Quantum Query Algorithms (2014) (0)
Towards Axiomatic Basis of Inductive Inference (2001) (0)
Quantum vs . deterministic queries on permutations (2011) (0)
Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II (2013) (0)
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings (1989) (0)
Size of Quantum Finite State Transducers (2007) (0)

This paper list is powered by the following services:

Other Resources About Rūsiņš Mārtiņš Freivalds

en.wikipedia.org

What Schools Are Affiliated With Rūsiņš Mārtiņš Freivalds?

Rūsiņš Mārtiņš Freivalds is affiliated with the following schools:

Image Attributions

Image Source for Rūsiņš Mārtiņš Freivalds