The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andris Ambainis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andris Ambainis
    Application of Kolmogorov Complexity to Inductive Inference with Limited Memory. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:313-318 [Conf]
  2. 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]
  3. 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]
  4. Andris Ambainis, Rusins Freivalds
    Transformations that Preserve Learnability. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:299-311 [Conf]
  5. Andris Ambainis, Juris Smotrovs
    Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:10-25 [Conf]
  6. Andris Ambainis, Adam Smith
    Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:249-260 [Conf]
  7. Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig
    Multiparty Quantum Coin Flipping. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:250-259 [Conf]
  8. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:44-53 [Conf]
  9. Andris Ambainis, Adam Smith, Ke Yang
    Extracting Quantum Entanglement. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:103-112 [Conf]
  10. Andris Ambainis, Ke Yang
    Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:305-319 [Conf]
  11. 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]
  12. Andris Ambainis
    Probabilistic and Team PFIN-Type Learning: General Properties. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:157-168 [Conf]
  13. Andris Ambainis
    The power of procrastination in inductive inference: How it depends on used ordinal notations. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:99-111 [Conf]
  14. Andris Ambainis, Sanjay Jain, Arun Sharma
    Ordinal Mind Change Complexity of Language Identification. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:301-315 [Conf]
  15. Scott Aaronson, Andris Ambainis
    Quantum Search of Spatial Regions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:200-209 [Conf]
  16. Andris Ambainis
    Polynomial Degree vs. Quantum Query Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:230-0 [Conf]
  17. Andris Ambainis
    Quantum Walk Algorithm for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:22-31 [Conf]
  18. Andris Ambainis
    A Better Lower Bound for Quantum Algorithms Searching an Ordered List. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:352-357 [Conf]
  19. Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan
    Nearly Tight Bounds on the Learnability of Evolution. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:524-533 [Conf]
  20. Andris Ambainis, Rusins Freivalds
    1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:332-341 [Conf]
  21. Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
    Private Quantum Channels. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:547-553 [Conf]
  22. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
    The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:342-351 [Conf]
  23. Andris Ambainis
    Optimization Problem in Inductive Inference. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:96-107 [Conf]
  24. Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
    Bounded Depth Arithmetic Circuits: Counting and Closure. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:149-158 [Conf]
  25. Andris Ambainis
    Upper Bound on Communication Complexity of Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:401-407 [Conf]
  26. Andris Ambainis
    The Complexity of Probabilistic versus Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:233-238 [Conf]
  27. Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
    Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:628-637 [Conf]
  28. Andris Ambainis, Satyanarayana V. Lokam
    Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:207-216 [Conf]
  29. Andris Ambainis, David A. Mix Barrington, Huong LeThanh
    On Counting AC0 Circuits with Negative Constants. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:409-417 [Conf]
  30. Andris Ambainis, Arnolds Kikusts
    Exact Results for Accepting Probabilities of Quantum Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:135-147 [Conf]
  31. Andris Ambainis, Markus Jakobsson, Helger Lipmaa
    Cryptographic Randomized Response Techniques. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2004, pp:425-438 [Conf]
  32. 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]
  33. Andris Ambainis, Stephen A. Bloch, David L. Schweizer
    Playing Twenty Questions with a Procrastinator. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:844-845 [Conf]
  34. Andris Ambainis, Julia Kempe, Alexander Rivosh
    Coins make quantum walks faster. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1099-1108 [Conf]
  35. 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]
  36. Andris Ambainis
    Upper Bounds on Multiparty Communication Complexity of Shifts. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:631-642 [Conf]
  37. Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
    Algebraic Results on Quantum Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:93-104 [Conf]
  38. 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]
  39. Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita
    Quantum Identification of Boolean Oracles. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:105-116 [Conf]
  40. Andris Ambainis, Arnolds Kikusts, Maris Valdats
    On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:75-86 [Conf]
  41. Andris Ambainis, Robert Spalek
    Quantum Algorithms for Matching and Network Flows. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:172-183 [Conf]
  42. Andris Ambainis, Ronald de Wolf
    Average-Case Quantum Query Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:133-144 [Conf]
  43. Andris Ambainis, Robert Spalek, Ronald de Wolf
    A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:618-633 [Conf]
  44. Andris Ambainis
    Quantum lower bounds by quantum arguments. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:636-643 [Conf]
  45. Andris Ambainis
    A new protocol and lower bounds for quantum coin flipping. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:134-142 [Conf]
  46. Andris Ambainis
    Quantum algorithms a decade after shor. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:111- [Conf]
  47. Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous
    One-dimensional quantum walks. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:37-49 [Conf]
  48. Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani
    Quantum walks on graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:50-59 [Conf]
  49. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
    Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:376-383 [Conf]
  50. Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani
    Computing with highly mixed states (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:697-704 [Conf]
  51. Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita
    Improved Algorithms for Quantum Identification of Boolean Oracles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:280-291 [Conf]
  52. 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]
  53. Andris Ambainis
    Communication Complexity in a 3-Computer Model. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:3, pp:298-301 [Journal]
  54. Andris Ambainis, Stephen A. Bloch, David L. Schweizer
    Delayed Binary Search, or Playing Twenty Questions with a Procrastinator. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:641-651 [Journal]
  55. Andris Ambainis, Markus Jakobsson, Helger Lipmaa
    Cryptographic Randomized Response Techniques [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  56. Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
    Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  57. Andris Ambainis, John Watrous
    Two-way finite automata with quantum and classical states [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  58. Andris Ambainis
    Probabilistic Inductive Inference:a Survey [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  59. Andris Ambainis
    Quantum lower bounds by quantum arguments [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  60. Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig
    Multiparty Quantum Coin Flipping [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  61. Andris Ambainis
    Polynomial degree vs. quantum query complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  62. 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]
  63. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
    Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  64. Andris Ambainis
    A note on quantum black-box complexity of almost all Boolean functions [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  65. Andris Ambainis
    A better lower bound for quantum algorithms searching an ordered list [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  66. 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]
  67. Andris Ambainis, Ronald de Wolf
    Average-Case Quantum Query Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  68. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:19, pp:- [Journal]
  69. Andris Ambainis, Ke Yang
    Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:082, pp:- [Journal]
  70. Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis
    Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:120, pp:- [Journal]
  71. Andris Ambainis, David A. Mix Barrington, Huong LeThanh
    On Counting AC0 Circuits with Negative Constants [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:20, pp:- [Journal]
  72. Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
    Bounded Depth Arithmetic Circuits: Counting and Closure [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:12, pp:- [Journal]
  73. 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]
  74. Andris Ambainis
    How rich is the structure of the intrinsic complexity of learning. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:109-112 [Journal]
  75. Andris Ambainis
    On learning formulas in the limit and with assurance. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:1, pp:9-11 [Journal]
  76. Andris Ambainis
    A Note on Quantum Black-Box Complexity of Almost all Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:1, pp:5-7 [Journal]
  77. Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
    Dense quantum coding and quantum finite automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:4, pp:496-511 [Journal]
  78. Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani
    Computing with highly mixed states. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:507-531 [Journal]
  79. Andris Ambainis
    A new protocol and lower bounds for quantum coin flipping. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:398-416 [Journal]
  80. Andris Ambainis
    Polynomial degree vs. quantum query complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:220-238 [Journal]
  81. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
    The Communication Complexity of Enumeration, Elimination, and Selection. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:2, pp:148-185 [Journal]
  82. Andris Ambainis
    Quantum Lower Bounds by Quantum Arguments. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:4, pp:750-767 [Journal]
  83. Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
    Algebraic Results on Quantum Automata. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:165-188 [Journal]
  84. Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson
    The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1570-1585 [Journal]
  85. Andris Ambainis
    Quantum Walk Algorithm for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:210-239 [Journal]
  86. Andris Ambainis
    Probabilistic inductive inference: a survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:1, pp:155-167 [Journal]
  87. 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]
  88. Andris Ambainis, Sanjay Jain, Arun Sharma
    Ordinal Mind Change Complexity of Language Identification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:2, pp:323-343 [Journal]
  89. Andris Ambainis, Arnolds Kikusts
    Exact results for accepting probabilities of quantum automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:3-25 [Journal]
  90. Andris Ambainis, John Watrous
    Two-way finite automata with quantum and classical state. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:1, pp:299-311 [Journal]
  91. Andris Ambainis, Daniel Gottesman
    The minimum distance problem for two-way entanglement purification. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:2, pp:748-753 [Journal]
  92. Andris Ambainis, Joseph Emerson
    Quantum t-designs: t-wise Independence in the Quantum World. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:129-140 [Conf]
  93. Andris Ambainis
    Probabilistic and Team PFIN-type Learning: General Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  94. Andris Ambainis
    Quantum search algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  95. Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita
    Improved algorithms for quantum identification of Boolean oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:1, pp:41-53 [Journal]

  96. Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. [Citation Graph (, )][DBLP]


  97. Quantum Query Complexity of Boolean Functions with Small On-Sets. [Citation Graph (, )][DBLP]


  98. New Developments in Quantum Algorithms. [Citation Graph (, )][DBLP]


  99. Quantum Random Walks - New Method for Designing Quantum Algorithms. [Citation Graph (, )][DBLP]


  100. Quantum Walks with Multiple or Moving Marked Locations. [Citation Graph (, )][DBLP]


  101. Quantum search with variable times. [Citation Graph (, )][DBLP]


  102. A quantum lovász local lemma. [Citation Graph (, )][DBLP]


  103. Nonlocal Quantum XOR Games for Large Number of Players. [Citation Graph (, )][DBLP]


  104. Improved Constructions of Quantum Automata. [Citation Graph (, )][DBLP]


  105. A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. [Citation Graph (, )][DBLP]


  106. A new quantum lower bound method, with an application to strong direct product theorem for quantum search [Citation Graph (, )][DBLP]


  107. A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs [Citation Graph (, )][DBLP]


  108. The quantum query complexity of certification [Citation Graph (, )][DBLP]


  109. Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size [Citation Graph (, )][DBLP]


  110. The Need for Structure in Quantum Speedups [Citation Graph (, )][DBLP]


  111. A Quantum Lovasz Local Lemma [Citation Graph (, )][DBLP]


  112. Quantum algorithms for formula evaluation [Citation Graph (, )][DBLP]


  113. New Developments in Quantum Algorithms [Citation Graph (, )][DBLP]


  114. Quantum t-designs: t-wise independence in the quantum world. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.013secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002