( en | de | ru )

 

Disambiguation of "Freivalds, Rusins"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds for Query Complexity of Some Graph Problems.

, and . VLSI, page 309-316. CSREA Press, (2003)

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)Artin's Conjecture and Size of Finite Probabilistic Automata.. Pillars of Computer Science, volume 4800 of Lecture Notes in Computer Science, page 280-291. Springer, (2008)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)On the Inductive Inference of Real Valued Functions., , and . COLT, page 170-177. ACM, (1995)Dual Types of Hypotheses in Inductive Inference., , and . Nonmonotonic and Inductive Logic, volume 659 of Lecture Notes in Computer Science, page 209-240. Springer, (1991)Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines., and . MFCS, volume 452 of Lecture Notes in Computer Science, page 355-361. Springer, (1990)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)Tally Languages Accepted by Monte Carlo Pushdown Automata., , and . RANDOM, volume 1269 of Lecture Notes in Computer Science, page 187-195. Springer, (1997)