Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Freivalds, Rusins
add a person with the name Freivalds, Rusins
 

Other publications of authors with the same name

Lower Bounds for Query Complexity of Some Graph Problems., and . VLSI, page 309-316. CSREA Press, (2003)Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets.. Bulletin of the EATCS, (1985)Quantum Queries on Permutations., , , and . DCFS, volume 9118 of Lecture Notes in Computer Science, page 177-184. Springer, (2015)Transformations that Preserve Learnability., and . ALT, volume 1160 of Lecture Notes in Computer Science, page 299-311. Springer, (1996)Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata., and . ICALP, volume 510 of Lecture Notes in Computer Science, page 174-185. Springer, (1991)The functions of finite support: a canonical learning problem., , and . J. Exp. Theor. Artif. Intell., 11 (4): 543-552 (1999)Kolmogorov numberings and minimal identification., and . EuroCOLT, volume 904 of Lecture Notes in Computer Science, page 182-195. Springer, (1995)Learning Formulae from Elementary Facts., , and . EuroCOLT, volume 1208 of Lecture Notes in Computer Science, page 272-285. Springer, (1997)Algorithmic Information Theory and Computational Complexity.. Algorithmic Probability and Friends, volume 7070 of Lecture Notes in Computer Science, page 142-154. Springer, (2011)Quantum Finite Multitape Automata., , , , and . SOFSEM, volume 1725 of Lecture Notes in Computer Science, page 340-348. Springer, (1999)