default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRusins Freivalds
Rusins Martins Freivalds – Rūsiņš Mārtiņš Freivalds
Person information
- unicode name: Rūsiņš Mārtiņš Freivalds
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[j43]Rusins Martins Freivalds, Solvita Zarina
:
Rūsiņš Mārtiņš Freivalds: Academic Genealogy and Selected Publications. Balt. J. Mod. Comput. 4(4) (2016)- [j42]Christopher Hanrui Chak, Rusins Freivalds, Frank Stephan, Henrietta Tan Wan Yik:
On block pumpable languages. Theor. Comput. Sci. 609: 272-285 (2016) - [e7]Rusins Martins Freivalds, Gregor Engels, Barbara Catania, Roman Spánek, Martin Rimnac:
Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), Harrachov, Czech Republic, January 23-28, 2016. CEUR Workshop Proceedings 1548, CEUR-WS.org 2016 [contents] - [e6]Rusins Martins Freivalds, Gregor Engels, Barbara Catania:
SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings. Lecture Notes in Computer Science 9587, Springer 2016, ISBN 978-3-662-49191-1 [contents] - 2015
- [j41]Cristian S. Calude, Rusins Freivalds, Sanjay Jain, Frank Stephan:
Deterministic Frequency Pushdown Automata. J. Univers. Comput. Sci. 21(12): 1563-1576 (2015) - [c96]Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, Rusins Freivalds:
Quantum Queries on Permutations. DCFS 2015: 177-184 - [c95]Valdis Adamsons, Karlis Jerins, Rihards Krislauks, Marta Lapina, Andris Pakulis, Rusins Freivalds:
Advantages of Ultrametric Counter Automata. SOFSEM (Student Research Forum Papers / Posters) 2015: 1-12 - [c94]Kristine Cipola, Andris Pakulis, Rusins Freivalds:
Experiments in Complexity of Probabilistic and Ultrametric Automata. SOFSEM (Student Research Forum Papers / Posters) 2015: 120-123 - [c93]Anete Lace, Muntis Rudzitis, Eriks Gopaks, Rusins Freivalds:
Superimposed Codes and Query Algorithms. SOFSEM (Student Research Forum Papers / Posters) 2015: 140-147 - [c92]Ilmars Puzulis, Rusins Freivalds:
Frequency Pushdown Automata. SOFSEM (Student Research Forum Papers / Posters) 2015: 148-153 - [c91]Kaspars Balodis, Janis Iraids, Rusins Freivalds:
Structured Frequency Algorithms. TAMC 2015: 50-61 - [c90]Rusins Freivalds:
Ultrametric Algorithms and Automata. UCNC 2015: 35-52 - 2014
- [j40]Ilja Kucevalovs, Ojars Krasts, Rusins Freivalds, Thomas Zeugmann:
On the Influence of Technology on Learning Processes. Parallel Process. Lett. 24(2) (2014) - [c89]Rusins Freivalds, Solvita Zarina:
Visual Representation of von Koch Fractals. Discrete Mathematics and Computer Science 2014: 153-163 - [c88]Rusins Freivalds, Thomas Zeugmann:
Active Learning of Recursive Functions by Ultrametric Algorithms. SOFSEM 2014: 246-257 - [c87]Rusins Freivalds:
Ultrametric Vs. Quantum Query Algorithms. TPNC 2014: 1-10 - [e5]Cristian S. Calude, Rusins Freivalds, Kazuo Iwama:
Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. Lecture Notes in Computer Science 8808, Springer 2014, ISBN 978-3-319-13349-2 [contents] - 2013
- [j39]Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider:
Preface. Fundam. Informaticae 123(1) (2013) - [c86]Rusins Freivalds:
Ultrametric Finite Automata and Turing Machines. Developments in Language Theory 2013: 1-11 - [c85]Rusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan:
On the Size Complexity of Deterministic Frequency Automata. LATA 2013: 287-298 - [e4]Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science 7965, Springer 2013, ISBN 978-3-642-39205-4 [contents] - [e3]Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Lecture Notes in Computer Science 7966, Springer 2013, ISBN 978-3-642-39211-5 [contents] - 2012
- [j38]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum computation with write-only memory. Nat. Comput. 11(1): 81-94 (2012) - [c84]Rusins Freivalds:
Ultrametric automata and Turing machines. Turing-100 2012: 98-112 - [c83]Rusins Freivalds:
Hartmanis-Stearns Conjecture on Real Time and Transcendence. Computation, Physics and Beyond 2012: 105-119 - [c82]Rusins Freivalds:
Multiple Usage of Random Bits in Finite Automata. TAMC 2012: 537-547 - 2011
- [j37]Alina Vasilieva, Rusins Freivalds:
Nondeterministic Query Algorithms. J. Univers. Comput. Sci. 17(6): 859-873 (2011) - [c81]Rusins Freivalds:
Algorithmic Information Theory and Computational Complexity. Algorithmic Probability and Friends 2011: 142-154 - [c80]Kaspars Balodis, Ilja Kucevalovs, Rusins Freivalds:
Frequency Prediction of Functions. MEMICS 2011: 76-83 - [c79]Rusins Freivalds, Thomas Zeugmann:
On the Amount of Nonconstructivity in Learning Recursive Functions. TAMC 2011: 332-343 - 2010
- [j36]Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say:
A new family of nonstochastic languages. Inf. Process. Lett. 110(10): 410-413 (2010) - [j35]Rusins Freivalds:
Amount of nonconstructivity in deterministic finite automata. Theor. Comput. Sci. 411(38-39): 3436-3443 (2010) - [c78]Ruben Agadzanyan, Rusins Freivalds:
Finite State Transducers with Intuition. UC 2010: 11-20 - [c77]Oksana Scegulnaja-Dubrovska, Lelde Lace, Rusins Freivalds:
Postselection Finite Quantum Automata. UC 2010: 115-126 - [c76]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum Computation with Devices Whose Contents Are Never Read. UC 2010: 164-174 - [i3]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum computation with devices whose contents are never read. CoRR abs/1011.1201 (2010)
2000 – 2009
- 2009
- [j34]Rusins Freivalds, Maris Ozols, Laura Mancinska:
Improved constructions of mixed state quantum automata. Theor. Comput. Sci. 410(20): 1923-1931 (2009) - [c75]Ruslans Tarasovs, Rusins Freivalds:
Group Input Machine. SOFSEM 2009: 521-532 - [c74]Rusins Freivalds, Kazuo Iwama:
Quantum Queries on Permutations with a Promise. CIAA 2009: 208-216 - [c73]Rusins Freivalds:
Amount of Nonconstructivity in Finite Automata. CIAA 2009: 227-236 - 2008
- [j33]Rusins Freivalds:
Non-Constructive Methods for Finite Probabilistic Automata. Int. J. Found. Comput. Sci. 19(3): 565-580 (2008) - [j32]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning with belief levels. J. Comput. Syst. Sci. 74(4): 527-545 (2008) - [j31]Rusins Freivalds, Richard F. Bonner:
Quantum inductive inference by finite automata. Theor. Comput. Sci. 397(1-3): 70-76 (2008) - [c72]Rusins Freivalds:
Artin's Conjecture and Size of Finite Probabilistic Automata. Pillars of Computer Science 2008: 280-291 - [c71]Guntis Deksnis, Rusins Freivalds, Oksana Scegulnaja-Dubrovska, Ruslan Tarasov, Solvita Zarina:
A Quantum Algorithm for Real Time Rendering. FCS 2008: 39-43 - [c70]Rusins Freivalds:
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. ISAAC 2008: 931-942 - [c69]Solvita Zarina, Rusins Freivalds:
Computer graphics for quantum computation. SIGGRAPH Posters 2008: 123 - 2007
- [c68]Rusins Freivalds:
Non-constructive Methods for Finite Probabilistic Automata. Developments in Language Theory 2007: 169-180 - [c67]Rusins Freivalds, Liva Garkaje:
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory. ISMVL 2007: 17 - [c66]Rusins Freivalds:
Hamming, Permutations and Automata. SAGA 2007: 18-29 - [c65]Ruben Agadzanyan, Rusins Freivalds:
Size of Quantum Finite State Transducers. SOFSEM (1) 2007: 155-163 - 2006
- [e2]Lars Arge, Rusins Freivalds:
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. Lecture Notes in Computer Science 4059, Springer 2006, ISBN 3-540-35753-X [contents] - 2005
- [c64]Rusins Freivalds, Renate Praude, Lelde Lace:
Some Graph Problems with Equivalent Lower Bounds for Query Complexity. FCS 2005: 80-86 - [c63]Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols:
Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS 2005: 169-175 - [c62]Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane:
Combinatorial Block Designs for Quantum Computing Problems. FCS 2005: 176-182 - [c61]Rusins Freivalds:
Knot Theory, Jones Polynomial and Quantum Computing. MFCS 2005: 15-25 - [c60]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: 408-412 - [c59]Rusins Freivalds:
Languages Recognizable by Quantum Finite Automata. CIAA 2005: 1-14 - 2004
- [c58]Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja:
Quantum Query Complexity for Some Graph Problems. SOFSEM 2004: 140-150 - 2003
- [c57]Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg:
Complexity of Decision Trees for Boolean Functions. ISMVL 2003: 253-258 - [c56]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: 303-308 - [c55]Lelde Lace, Rusins Freivalds:
Lower Bounds for Query Complexity of Some Graph Problems. VLSI 2003: 309-316 - 2002
- [j30]Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen:
Learning by the Process of Elimination. Inf. Comput. 176(1): 37-50 (2002) - [c54]Rusins Freivalds, Carl H. Smith:
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. LATIN 2002: 386-399 - 2001
- [j29]Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Hierarchies of probabilistic and team FIN-learning. Theor. Comput. Sci. 261(1): 91-117 (2001) - [j28]Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger:
Foreword. Theor. Comput. Sci. 264(1): 1-2 (2001) - [j27]Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Closedness properties in ex-identification. Theor. Comput. Sci. 268(2): 367-393 (2001) - [c53]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Towards Axiomatic Basis of Inductive Inference. FCT 2001: 1-13 - [c52]Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev:
Quantum versus Probabilistic One-Way Finite Automata with Counter. SOFSEM 2001: 181-190 - [c51]Rusins Freivalds, Andreas J. Winter:
Quantum Finite State Transducers. SOFSEM 2001: 233-242 - [e1]Rusins Freivalds:
Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings. Lecture Notes in Computer Science 2138, Springer 2001, ISBN 3-540-42487-3 [contents]
1990 – 1999
- 1999
- [j26]Rusins Freivalds:
How to Simulate Free Will in a Computational Device. ACM Comput. Surv. 31(3es): 15 (1999) - [j25]Andris Ambainis, Rusins Freivalds, Carl H. Smith:
Inductive Inference with Procrastination: Back to Definitions. Fundam. Informaticae 40(1): 1-16 (1999) - [j24]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
The functions of finite support: a canonical learning problem. J. Exp. Theor. Artif. Intell. 11(4): 543-552 (1999) - [j23]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): 3-17 (1999) - [c50]Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts:
Probabilities to Accept Languages by Quantum Finite Automata. COCOON 1999: 174-183 - [c49]Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski:
Quantum Finite Multitape Automata. SOFSEM 1999: 340-348 - [i2]Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts:
Probabilities to accept languages by quantum finite automata. CoRR quant-ph/9904066 (1999) - 1998
- [j22]Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen:
Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. 23(1-2): 199-209 (1998) - [j21]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): 139-156 (1998) - [c48]Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Closedness Properties in EX-Identification of Recursive Functions. ALT 1998: 46-60 - [c47]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
A Logic of Discovery. Discovery Science 1998: 401-402 - [c46]Andris Ambainis, Rusins Freivalds:
1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. FOCS 1998: 332-341 - [c45]Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska:
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. MFCS 1998: 213-219 - [c44]Rusins Freivalds:
Models of Computation, Riemann Hypothesis, and Classical Mathematics. SOFSEM 1998: 89-106 - [i1]Andris Ambainis, Rusins Freivalds:
1-way quantum finite automata: strengths, weaknesses and generalizations. CoRR quant-ph/9802062 (1998) - 1997
- [j20]Rusins Freivalds, Sanjay Jain:
Kolmogorov Numberings and Minimal Identification. Theor. Comput. Sci. 188(1-2): 175-194 (1997) - [c43]Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith:
Team Learning as a Game. ALT 1997: 2-17 - [c42]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: 244-259 - [c41]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Asymmetric Team Learning. COLT 1997: 90-95 - [c40]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning Formulae from Elementary Facts. EuroCOLT 1997: 272-285 - [c39]Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith:
Learning Small Programs with Additional Information. LFCS 1997: 102-112 - [c38]Andris Ambainis, Rusins Freivalds, Marek Karpinski:
Weak and Strong Recognition by 2-way Randomized Automata. RANDOM 1997: 175-185 - [c37]Janis Kaneps, Dainis Geidmanis, Rusins Freivalds:
Tally Languages Accepted by Monte Carlo Pushdown Automata. RANDOM 1997: 187-195 - 1996
- [j19]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
On Duality in Learning and the Selection of Learning Terms. Inf. Comput. 129(1): 53-62 (1996) - [c36]Andris Ambainis, Rusins Freivalds:
Transformations that Preserve Learnability. ALT 1996: 299-311 - [c35]Rusins Freivalds, Thomas Zeugmann:
Co-Learning of Recursive Languages from Positive Data. Ershov Memorial Conference 1996: 122-133 - [c34]Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Unions of identifiable families of languages. ICGI 1996: 48-58 - [c33]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning with Confidence. STACS 1996: 207-218 - [c32]Andris Ambainis, Rusins Freivalds, Carl H. Smith:
General Inductive Inference Types Based on Linearly-Ordered Sets. STACS 1996: 243-253 - 1995
- [j18]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
How Inductive Inference Strategies Discover Their Errors. Inf. Comput. 118(2): 208-226 (1995) - [j17]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Intrinsic Complexity of Learning. Inf. Comput. 123(1): 64-71 (1995) - [j16]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines. J. ACM 42(6): 1146-1168 (1995) - [c31]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
On the Inductive Inference of Real Valued Functions. COLT 1995: 170-177 - [c30]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the intrinsic complexity of learning. EuroCOLT 1995: 154-168 - [c29]Rusins Freivalds, Sanjay Jain:
Kolmogorov numberings and minimal identification. EuroCOLT 1995: 182-195 - [c28]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Error Detecting in Inductive Inference. GOSLER Final Report 1995: 25-48 - [c27]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Learning from Good Examples. GOSLER Final Report 1995: 49-62 - [c26]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report 1995: 155-161 - [c25]Rusins Freivalds, Marek Karpinski:
Lower Time Bounds for Randomized Computation. ICALP 1995: 183-195 - [c24]Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan:
Measure, Category and Learning Theory. ICALP 1995: 558-569 - 1994
- [j15]Rusins Freivalds, Achim G. Hoffmann:
An inductive inference approach to classification. J. Exp. Theor. Artif. Intell. 6(1): 63-72 (1994) - [c23]Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen:
Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT 1994: 91-99 - [c22]Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith:
Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. AII/ALT 1994: 100-105 - [c21]Rusins Freivalds, Marek Karpinski, Carl H. Smith:
Co-Learning of Total Recursive Functions. COLT 1994: 190-197 - [c20]Rusins Freivalds, Marek Karpinski:
Lower Space Bounds for Randomized Computation. ICALP 1994: 580-592 - [c19]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Choosing a learning team: a topological approach. STOC 1994: 283-289 - 1993
- [j14]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the impact of forgetting on learing machines. Bull. EATCS 49: 212-225 (1993) - [j13]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the impact of forgetting on learing machines. Bull. EATCS 51: 212-225 (1993) - [j12]Rusins Freivalds, Carl H. Smith:
On the Role of Procrastination in Machine Learning. Inf. Comput. 107(2): 237-271 (1993) - [j11]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. 110(1): 131-144 (1993) - [c18]Rusins Freivalds, Carl H. Smith:
On the Duality Between Mechanistic Learners and What it is They Learn. ALT 1993: 137-149 - [c17]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines. COLT 1993: 165-174 - 1992
- [c16]Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs:
Unions of Identifiable Classes of Total Recursive Functions. AII 1992: 99-107 - [c15]Rusins Freivalds, Achim G. Hoffmann:
An Inductive Inference Appoach to Classification. AII 1992: 187-196 - [c14]Rusins Freivalds, Carl H. Smith:
On the Role of Procrastination for Machine Learning. COLT 1992: 363-376 - [c13]Rusins Freivalds, Carl H. Smith:
Memory Limited Inductive Inference Machines. SWAT 1992: 19-29 - 1991
- [c12]Janis Kaneps, Rusins Freivalds:
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. ICALP 1991: 174-185 - [c11]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic 1991: 209-240 - [p3]Rusins Freivalds:
Inductive Inference of Recursive Functions: Qualitative Theory. Baltic Computer Science 1991: 77-110 - [p2]Rusins Freivalds, Janis Barzdins, Karlis Podnieks:
Inductive Inference of Recursive Functions: Complexity Bounds. Baltic Computer Science 1991: 111-155 - [p1]Rusins Freivalds:
Complexity of Probabilistic Versus Deterministic Automata. Baltic Computer Science 1991: 565-613 - 1990
- [c10]Rusins Freivalds:
Inductive Inference of Minimal Programs. COLT 1990: 3-22 - [c9]Janis Kaneps, Rusins Freivalds:
Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. MFCS 1990: 355-361
1980 – 1989
- 1989
- [j10]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. 25(5/6): 239-243 (1989) - [j9]Rusins Freivalds, Carl H. Smith, Mahendran Velauthapillai:
Trade-Off among Parameters Effecting Inductive Inference. Inf. Comput. 82(3): 323-349 (1989) - [c8]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference from Good Examples. AII 1989: 1-17 - [c7]Rusins Freivalds, Juris Viksna:
Inductive Inference up to Immune Sets. AII 1989: 138-147 - 1988
- [j8]Masahiro Miyakawa, Ivan Stojmenovic, Teruo Hikita, Hajime Machida, Rusins Freivalds:
Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions. J. Inf. Process. Cybern. 24(6): 251-266 (1988) - [j7]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Math. Log. Q. 34(6): 531-539 (1988) - 1986
- [c6]Farid M. Ablayev, Rusins Freivalds:
Why Sometimes Probabilistic Algorithms Can Be More Effective. MFCS 1986: 1-14 - 1985
- [j6]Rusins Freivalds:
Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets. Bull. EATCS 27: 35-39 (1985) - 1984
- [j5]Rusins Freivalds:
An answer to an open problem. Bull. EATCS 23: 31-32 (1984) - [j4]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Math. Log. Q. 30(9-11): 145-164 (1984) - [j3]Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber:
On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. 28: 111-133 (1984) - 1983
- [c5]Rusins Freivalds:
Space and Reversal Complexity of Probabilistic One-Way Turing Machines. FCT 1983: 159-170 - [c4]Rusins Freivalds:
Methods and Languages to Prove the Power of Probabilistic Machines. IFIP Congress 1983: 157-162 - 1982
- [j2]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference and Computable One-One Numberings. Math. Log. Q. 28(27-32): 463-479 (1982) - 1981
- [j1]Rusins Freivalds:
Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata. Inf. Process. Lett. 13(4/5): 195-198 (1981) - [c3]Rusins Freivalds:
Probabilistic Two-Way Machines. MFCS 1981: 33-45
1970 – 1979
- 1979
- [c2]Rusins Freivalds:
Fast Probabilistic Algorithms. MFCS 1979: 57-69 - 1977
- [c1]Rusins Freivalds:
Probabilistic Machines Can Use Less Running Time. IFIP Congress 1977: 839-842
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
