The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rusins Freivalds: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs
    Unions of Identifiable Classes of Total Recursive Functions. [Citation Graph (0, 0)][DBLP]
    AII, 1992, pp:99-107 [Conf]
  2. Rusins Freivalds, Achim G. Hoffmann
    An Inductive Inference Appoach to Classification. [Citation Graph (0, 0)][DBLP]
    AII, 1992, pp:187-196 [Conf]
  3. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    Inductive Inference from Good Examples. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:1-17 [Conf]
  4. Rusins Freivalds, Juris Viksna
    Inductive Inference up to Immune Sets. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:138-147 [Conf]
  5. Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
    Identifying Nearly Minimal Gödel Numbers From Additional Information. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:91-99 [Conf]
  6. Rusins Freivalds, Carl H. Smith
    On the Duality Between Mechanistic Learners and What it is They Learn. [Citation Graph (0, 0)][DBLP]
    ALT, 1993, pp:137-149 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:244-259 [Conf]
  8. Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith
    Team Learning as a Game. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:2-17 [Conf]
  9. Andris Ambainis, Rusins Freivalds
    Transformations that Preserve Learnability. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:299-311 [Conf]
  10. Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
    Closedness Properties in EX-Identification of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:46-60 [Conf]
  11. Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith
    Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:100-105 [Conf]
  12. Rusins Freivalds
    Inductive Inference of Recursive Functions: Qualitative Theory. [Citation Graph (0, 0)][DBLP]
    Baltic Computer Science, 1991, pp:77-110 [Conf]
  13. Rusins Freivalds
    Complexity of Probabilistic Versus Deterministic Automata. [Citation Graph (0, 0)][DBLP]
    Baltic Computer Science, 1991, pp:565-613 [Conf]
  14. Rusins Freivalds, Janis Barzdins, Karlis Podnieks
    Inductive Inference of Recursive Functions: Complexity Bounds. [Citation Graph (0, 0)][DBLP]
    Baltic Computer Science, 1991, pp:111-155 [Conf]
  15. Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
    Probabilities to Accept Languages by Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:174-183 [Conf]
  16. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    On the Inductive Inference of Real Valued Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:170-177 [Conf]
  17. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    Asymmetric Team Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:90-95 [Conf]
  18. Rusins Freivalds
    Inductive Inference of Minimal Programs. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:3-22 [Conf]
  19. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the Impact of Forgetting on Learning Machines. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:165-174 [Conf]
  20. Rusins Freivalds, Marek Karpinski, Carl H. Smith
    Co-Learning of Total Recursive Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:190-197 [Conf]
  21. Rusins Freivalds, Carl H. Smith
    On the Role of Procrastination for Machine Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:363-376 [Conf]
  22. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    A Logic of Discovery. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:401-402 [Conf]
  23. Rusins Freivalds, Thomas Zeugmann
    Co-Learning of Recursive Languages from Positive Data. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1996, pp:122-133 [Conf]
  24. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    Learning Formulae from Elementary Facts. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:272-285 [Conf]
  25. Rusins Freivalds, Sanjay Jain
    Kolmogorov numberings and minimal identification. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:182-195 [Conf]
  26. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the intrinsic complexity of learning. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:154-168 [Conf]
  27. Rusins Freivalds, Elina Kalnina, Rihards Opmanis, Agnese Zalcmane
    Combinatorial Block Designs for Quantum Computing Problems. [Citation Graph (0, 0)][DBLP]
    FCS, 2005, pp:176-182 [Conf]
  28. Rusins Freivalds, Renate Praude, Lelde Lace
    Some Graph Problems with Equivalent Lower Bounds for Query Complexity. [Citation Graph (0, 0)][DBLP]
    FCS, 2005, pp:80-86 [Conf]
  29. Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols
    Size of Nondeterministic and Deterministic Automata for Certain Languages. [Citation Graph (0, 0)][DBLP]
    FCS, 2005, pp:169-175 [Conf]
  30. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    Towards Axiomatic Basis of Inductive Inference. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:1-13 [Conf]
  31. Rusins Freivalds
    Space and Reversal Complexity of Probabilistic One-Way Turing Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:159-170 [Conf]
  32. Andris Ambainis, Rusins Freivalds
    1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:332-341 [Conf]
  33. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    Probabilistic versus Deterministic Memory Limited Learning. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:155-161 [Conf]
  34. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    Error Detecting in Inductive Inference. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:25-48 [Conf]
  35. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    Learning from Good Examples. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:49-62 [Conf]
  36. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    Measure, Category and Learning Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:558-569 [Conf]
  37. Rusins Freivalds, Marek Karpinski
    Lower Space Bounds for Randomized Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:580-592 [Conf]
  38. Rusins Freivalds, Marek Karpinski
    Lower Time Bounds for Randomized Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:183-195 [Conf]
  39. Janis Kaneps, Rusins Freivalds
    Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:174-185 [Conf]
  40. Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
    Unions of identifiable families of languages. [Citation Graph (0, 0)][DBLP]
    ICGI, 1996, pp:48-58 [Conf]
  41. Rusins Freivalds
    Probabilistic Machines Can Use Less Running Time. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1977, pp:839-842 [Conf]
  42. Rusins Freivalds
    Methods and Languages to Prove the Power of Probabilistic Machines. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:157-162 [Conf]
  43. Rusins Freivalds, Masahiro Miyakawa, Ivo G. Rosenberg
    Complexity of Decision Trees for Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2003, pp:253-0 [Conf]
  44. Rusins Freivalds, Carl H. Smith
    Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:386-399 [Conf]
  45. Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith
    Learning Small Programs with Additional Information. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:102-112 [Conf]
  46. Farid M. Ablayev, Rusins Freivalds
    Why Sometimes Probabilistic Algorithms Can Be More Effective. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:1-14 [Conf]
  47. Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska
    Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:213-219 [Conf]
  48. Rusins Freivalds
    Knot Theory, Jones Polynomial and Quantum Computing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:15-25 [Conf]
  49. Rusins Freivalds
    Fast Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:57-69 [Conf]
  50. Rusins Freivalds
    Probabilistic Two-Way Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:33-45 [Conf]
  51. Janis Kaneps, Rusins Freivalds
    Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:355-361 [Conf]
  52. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    Dual Types of Hypotheses in Inductive Inference. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic and Inductive Logic, 1991, pp:209-240 [Conf]
  53. Andris Ambainis, Rusins Freivalds, Marek Karpinski
    Weak and Strong Recognition by 2-way Randomized Automata. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:175-185 [Conf]
  54. Janis Kaneps, Dainis Geidmanis, Rusins Freivalds
    Tally Languages Accepted by Monte Carlo Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:187-195 [Conf]
  55. Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski
    Quantum Finite Multitape Automata. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:340-348 [Conf]
  56. Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, Oksana Scegulnaja
    Quantum Query Complexity for Some Graph Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2004, pp:140-150 [Conf]
  57. Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev
    Quantum versus Probabilistic One-Way Finite Automata with Counter. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:181-190 [Conf]
  58. Rusins Freivalds
    Models of Computation, Riemann Hypothesis, and Classical Mathematics. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:89-106 [Conf]
  59. Rusins Freivalds, Andreas Winter
    Quantum Finite State Transducers. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:233-242 [Conf]
  60. 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. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:408-412 [Conf]
  61. Andris Ambainis, Rusins Freivalds, Carl H. Smith
    General Inductive Inference Types Based on Linearly-Ordered Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:243-253 [Conf]
  62. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    Learning with Confidence. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:207-218 [Conf]
  63. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    Choosing a learning team: a topological approach. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:283-289 [Conf]
  64. Rusins Freivalds, Carl H. Smith
    Memory Limited Inductive Inference Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:19-29 [Conf]
  65. 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. [Citation Graph (0, 0)][DBLP]
    VLSI, 2003, pp:303-308 [Conf]
  66. Lelde Lace, Rusins Freivalds
    Lower Bounds for Query Complexity of Some Graph Problems. [Citation Graph (0, 0)][DBLP]
    VLSI, 2003, pp:309-316 [Conf]
  67. Rusins Freivalds
    Languages Recognizable by Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:1-14 [Conf]
  68. Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
    Identifying Nearly Minimal Gödel Numbers from Additional Information. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:1-2, pp:199-209 [Journal]
  69. Andris Ambainis, Rusins Freivalds
    1-way quantum finite automata: strengths, weaknesses and generalizations [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  70. Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts
    Probabilities to accept languages by quantum finite automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  71. Rusins Freivalds
    How to Simulate Free Will in a Computational Device. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:15- [Journal]
  72. Rusins Freivalds
    An answer to an open problem. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:23, n:, pp:31-32 [Journal]
  73. Rusins Freivalds
    Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:35-39 [Journal]
  74. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the impact of forgetting on learing machines. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:51, n:, pp:212-225 [Journal]
  75. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the impact of forgetting on learing machines. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:49, n:, pp:212-225 [Journal]
  76. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:5/6, pp:239-243 [Journal]
  77. Masahiro Miyakawa, Ivan Stojmenovic, Teruo Hikita, Hajime Machida, Rusins Freivalds
    Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:6, pp:251-266 [Journal]
  78. Andris Ambainis, Rusins Freivalds, Carl H. Smith
    Inductive Inference with Procrastination: Back to Definitions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:40, n:1, pp:1-16 [Journal]
  79. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    On Duality in Learning and the Selection of Learning Terms. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:129, n:1, pp:53-62 [Journal]
  80. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the Intrinsic Complexity of Learning. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:64-71 [Journal]
  81. Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
    Learning by the Process of Elimination. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:37-50 [Journal]
  82. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    How Inductive Inference Strategies Discover Their Errors [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:208-226 [Journal]
  83. Rusins Freivalds, Carl H. Smith
    On the Role of Procrastination in Machine Learning [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:2, pp:237-271 [Journal]
  84. Rusins Freivalds, Carl H. Smith, Mahendran Velauthapillai
    Trade-Off among Parameters Effecting Inductive Inference [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:3, pp:323-349 [Journal]
  85. Rusins Freivalds
    Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:195-198 [Journal]
  86. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the Impact of Forgetting on Learning Machines. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1146-1168 [Journal]
  87. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    The functions of finite support: a canonical learning problem. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1999, v:11, n:4, pp:543-552 [Journal]
  88. Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    Hierarchies of probabilistic and team FIN-learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:91-117 [Journal]
  89. Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith
    On the Inductive Inference of Recursive Real-Valued Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:3-17 [Journal]
  90. Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
    Closedness properties in ex-identification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:2, pp:367-393 [Journal]
  91. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    On the Relative Sizes of Learnable Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:139-156 [Journal]
  92. Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:1, pp:1-2 [Journal]
  93. Rusins Freivalds, Sanjay Jain
    Kolmogorov Numberings and Minimal Identification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:188, n:1-2, pp:175-194 [Journal]
  94. Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
    On the Power of Inductive Inference from Good Examples. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:110, n:1, pp:131-144 [Journal]
  95. Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber
    On the Power of Probabilistic Strategies in Inductive Inference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:28, n:, pp:111-133 [Journal]
  96. Rusins Freivalds
    Non-constructive Methods for Finite Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:169-180 [Conf]
  97. Rusins Freivalds
    Hamming, Permutations and Automata. [Citation Graph (0, 0)][DBLP]
    SAGA, 2007, pp:18-29 [Conf]
  98. Ruben Agadzanyan, Rusins Freivalds
    Size of Quantum Finite State Transducers. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:155-163 [Conf]

  99. Artin's Conjecture and Size of Finite Probabilistic Automata. [Citation Graph (, )][DBLP]


  100. A Quantum Algorithm for Real Time Rendering. [Citation Graph (, )][DBLP]


  101. Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. [Citation Graph (, )][DBLP]


  102. Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory. [Citation Graph (, )][DBLP]


  103. Computer graphics for quantum computation. [Citation Graph (, )][DBLP]


  104. Group Input Machine. [Citation Graph (, )][DBLP]


  105. Quantum Queries on Permutations with a Promise. [Citation Graph (, )][DBLP]


  106. Amount of Nonconstructivity in Finite Automata. [Citation Graph (, )][DBLP]


Search in 0.073secs, Finished in 0.079secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002