| | |
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 104 |      | Scott Aaronson, Paul Christiano: Quantum money from hidden subspaces. STOC 2012: 41-60 |
| 103 | | Scott Aaronson, Paul Christiano: Quantum Money from Hidden Subspaces CoRR abs/1203.4740: (2012) |
| 102 | | Scott Aaronson, Paul Christiano: Quantum Money from Hidden Subspaces. Electronic Colloquium on Computational Complexity (ECCC) 19: 24 (2012) |
| 101 | | Scott Aaronson, Paul Christiano: Quantum Money from Hidden Subspaces. IACR Cryptology ePrint Archive 2012: 171 (2012) |
| 2011 | ||
| 100 | | Scott Aaronson: The Equivalence of Sampling and Searching. CSR 2011: 1-14 |
| 99 | | Scott Aaronson, Andrew Drucker: Advice Coins for Classical and Quantum Computation. ICALP (1) 2011: 61-72 |
| 98 | | Scott Aaronson, Andris Ambainis: The Need for Structure in Quantum Speedups. ICS 2011: 338-352 |
| 97 | | Scott Aaronson, Alex Arkhipov: The computational complexity of linear optics. STOC 2011: 333-342 |
| 96 | | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani: The One-Way Communication Complexity of Subgroup Membership. Chicago J. Theor. Comput. Sci. 2011: (2011) |
| 95 | | Scott Aaronson: Impossibility of Succinct Quantum Proofs for Collision-Freeness CoRR abs/1101.0403: (2011) |
| 94 | | Scott Aaronson, Andrew Drucker: Advice Coins for Classical and Quantum Computation CoRR abs/1101.5355: (2011) |
| 93 | | Scott Aaronson: Why Philosophers Should Care About Computational Complexity CoRR abs/1108.1791: (2011) |
| 92 | | Scott Aaronson: A Linear-Optical Proof that the Permanent is #P-Hard CoRR abs/1109.1674: (2011) |
| 91 | | Scott Aaronson: Quantum Copy-Protection and Quantum Money CoRR abs/1110.5353: (2011) |
| 90 | | Scott Aaronson: A Counterexample to the Generalized Linial-Nisan Conjecture CoRR abs/1110.6126: (2011) |
| 89 | | Scott Aaronson: Impossibility of Succinct Quantum Proofs for Collision-Freeness. Electronic Colloquium on Computational Complexity (ECCC) 18: 1 (2011) |
| 88 | | Scott Aaronson: Why Philosophers Should Care About Computational Complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 108 (2011) |
| 87 | | Scott Aaronson: A Linear-Optical Proof that the Permanent is #P-Hard. Electronic Colloquium on Computational Complexity (ECCC) 18: 43 (2011) |
| 86 | | Scott Aaronson, Andrew Drucker: Advice Coins for Classical and Quantum Computation. Electronic Colloquium on Computational Complexity (ECCC) 18: 8 (2011) |
| 85 | | Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola: Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011) |
| 84 | | Scott Aaronson, Dieter van Melkebeek: On Circuit Lower Bounds from Derandomization. Theory of Computing 7(1): 177-184 (2011) |
| 2010 | ||
| 83 | | Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor: Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS 2010: 20-31 |
| 82 | | Scott Aaronson, Andrew Drucker: A full characterization of quantum advice. STOC 2010: 131-140 |
| 81 | | Scott Aaronson: BQP and the polynomial hierarchy. STOC 2010: 141-150 |
| 80 | | Scott Aaronson, Andrew Drucker: A Full Characterization of Quantum Advice CoRR abs/1004.0377: (2010) |
| 79 | | Scott Aaronson: The Equivalence of Sampling and Searching CoRR abs/1009.5104: (2010) |
| 78 | | Scott Aaronson, Alex Arkhipov: The Computational Complexity of Linear Optics CoRR abs/1011.3245: (2010) |
| 77 | | Scott Aaronson: QIP = PSPACE breakthrough: technical perspective. Commun. ACM 53(12): 101 (2010) |
| 76 | | Scott Aaronson, Dieter van Melkebeek: A note on circuit lower bounds from derandomization. Electronic Colloquium on Computational Complexity (ECCC) 17: 105 (2010) |
| 75 | | Scott Aaronson: A Counterexample to the Generalized Linial-Nisan Conjecture. Electronic Colloquium on Computational Complexity (ECCC) 17: 109 (2010) |
| 74 | | Scott Aaronson: The Equivalence of Sampling and Searching. Electronic Colloquium on Computational Complexity (ECCC) 17: 128 (2010) |
| 73 | | Scott Aaronson, Alex Arkhipov: The Computational Complexity of Linear Optics. Electronic Colloquium on Computational Complexity (ECCC) 17: 170 (2010) |
| 72 | | Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek: A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electronic Colloquium on Computational Complexity (ECCC) 17: 174 (2010) |
| 71 | | Scott Aaronson, Andrew Drucker: A Full Characterization of Quantum Advice. Electronic Colloquium on Computational Complexity (ECCC) 17: 57 (2010) |
| 2009 | ||
| 70 | | Scott Aaronson: Quantum Copy-Protection and Quantum Money. IEEE Conference on Computational Complexity 2009: 229-242 |
| 69 | | Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani: The One-Way Communication Complexity of Group Membership CoRR abs/0902.3175: (2009) |
| 68 | | Scott Aaronson: BQP and the Polynomial Hierarchy CoRR abs/0910.4698: (2009) |
| 67 | | Scott Aaronson, Andris Ambainis: The Need for Structure in Quantum Speedups CoRR abs/0911.0996: (2009) |
| 66 | | Scott Aaronson: BQP and the Polynomial Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 16: 104 (2009) |
| 65 | | Scott Aaronson, Andris Ambainis: The Need for Structure in Quantum Speedups. Electronic Colloquium on Computational Complexity (ECCC) 16: 110 (2009) |
| 64 | | Scott Aaronson: On perfect completeness for QMA. Quantum Information & Computation 9(1): 81-89 (2009) |
| 63 | | Scott Aaronson, Sudipto Guha, Jon M. Kleinberg, Frank McSherry, Dieter van Melkebeek, Amit Sahai: Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006). SIAM J. Comput. 39(1): (2009) |
| 62 | | Scott Aaronson, Avi Wigderson: Algebrization: A New Barrier in Complexity Theory. TOCT 1(1): (2009) |
| 61 | | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor: The Power of Unentanglement. Theory of Computing 5(1): 1-42 (2009) |
| 2008 | ||
| 60 | | Scott Aaronson: The Polynomial Method in Quantum and Classical Computing. FOCS 2008: 3 |
| 59 | | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor: The Power of Unentanglement. IEEE Conference on Computational Complexity 2008: 223-236 |
| 58 | | Scott Aaronson, Avi Wigderson: Algebrization: a new barrier in complexity theory. STOC 2008: 731-740 |
| 57 | | Scott Aaronson, Avi Wigderson: Algebrization: A New Barrier in Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 15(005): (2008) |
| 56 | | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor: The Power of Unentanglement. Electronic Colloquium on Computational Complexity (ECCC) 15(051): (2008) |
| 55 | | Scott Aaronson: On Perfect Completeness for QMA. Electronic Colloquium on Computational Complexity (ECCC) 15(067): (2008) |
| 54 | | Scott Aaronson, John Watrous: Closed Timelike Curves Make Quantum and Classical Computing Equivalent. Electronic Colloquium on Computational Complexity (ECCC) 15(092): (2008) |
| 53 | | Scott Aaronson: Quantum certificate complexity. J. Comput. Syst. Sci. 74(3): 313-322 (2008) |
| 2007 | ||
| 52 | | Scott Aaronson: The Limits of Quantum Computers. CSR 2007: 4 |
| 51 | | Scott Aaronson, Greg Kuperberg: Quantum versus Classical Proofs and Advice. IEEE Conference on Computational Complexity 2007: 115-128 |
| 50 | | Scott Aaronson: Review of "The Access Principle by John Willinsky, " MIT Press, 2005. SIGACT News 38(4): 19-23 (2007) |
| 49 | | Scott Aaronson, Greg Kuperberg: Quantum Versus Classical Proofs and Advice. Theory of Computing 3(1): 129-157 (2007) |
| 2006 | ||
| 48 | | Scott Aaronson: QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols. IEEE Conference on Computational Complexity 2006: 261-273 |
| 47 | | Scott Aaronson: Oracles Are Subtle But Not Malicious. IEEE Conference on Computational Complexity 2006: 340-354 |
| 46 | | Scott Aaronson, Greg Kuperberg: Quantum Versus Classical Proofs and Advice CoRR abs/quant-ph/0604056: (2006) |
| 45 | | Scott Aaronson, Greg Kuperberg: Quantum Versus Classical Proofs and Advice. Electronic Colloquium on Computational Complexity (ECCC) 13(055): (2006) |
| 44 | | Scott Aaronson: The Learnability of Quantum States. Electronic Colloquium on Computational Complexity (ECCC) 13(106): (2006) |
| 43 | | Scott Aaronson: Lower Bounds for Local Search by Quantum Arguments. SIAM J. Comput. 35(4): 804-824 (2006) |
| 2005 | ||
| 42 | | Scott Aaronson: The complexity of agreement. STOC 2005: 634-643 |
| 41 | | Scott Aaronson: Oracles Are Subtle But Not Malicious CoRR abs/cs/0504048: (2005) |
| 40 | | Scott Aaronson: NP-complete Problems and Physical Reality CoRR abs/quant-ph/0502072: (2005) |
| 39 | | Scott Aaronson: QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols CoRR abs/quant-ph/0510230: (2005) |
| 38 | | Scott Aaronson: Quantum Computing, Postselection, and Probabilistic Polynomial-Time Electronic Colloquium on Computational Complexity (ECCC)(003): (2005) |
| 37 | | Scott Aaronson: NP-complete Problems and Physical Reality Electronic Colloquium on Computational Complexity (ECCC)(026): (2005) |
| 36 | | Scott Aaronson: Oracles Are Subtle But Not Malicious Electronic Colloquium on Computational Complexity (ECCC)(040): (2005) |
| 35 | | Scott Aaronson: QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols Electronic Colloquium on Computational Complexity (ECCC)(129): (2005) |
| 34 | | Scott Aaronson: Quantum lower bound for recursive fourier sampling. Quantum Information & Computation 5(2): 176-177 (2005) |
| 33 | | Scott Aaronson: Guest Column: NP-complete problems and physical reality. SIGACT News 36(1): 30-52 (2005) |
| 32 | | Scott Aaronson: Limitations of Quantum Advice and One-Way Communication. Theory of Computing 1(1): 1-28 (2005) |
| 31 | | Scott Aaronson, Andris Ambainis: Quantum Search of Spatial Regions. Theory of Computing 1(1): 47-79 (2005) |
| 2004 | ||
| 30 | | Scott Aaronson: Limitations of Quantum Advice and One-Way Communication. IEEE Conference on Computational Complexity 2004: 320-332 |
| 29 | | Scott Aaronson: Multilinear formulas and skepticism of quantum computing. STOC 2004: 118-127 |
| 28 | | Scott Aaronson: Lower bounds for local search by quantum arguments. STOC 2004: 465-474 |
| 27 | | Scott Aaronson: Limits on Efficient Computation in the Physical World CoRR abs/quant-ph/0412143: (2004) |
| 26 | | Scott Aaronson: Quantum Computing, Postselection, and Probabilistic Polynomial-Time CoRR abs/quant-ph/0412187: (2004) |
| 25 | | Scott Aaronson: The Complexity of Agreement CoRR cs.CC/0406061: (2004) |
| 24 | | Scott Aaronson: Limitations of Quantum Advice and One-Way Communication CoRR quant-ph/0402095: (2004) |
| 23 | | Scott Aaronson, Daniel Gottesman: Improved Simulation of Stabilizer Circuits CoRR quant-ph/0406196: (2004) |
| 22 | | Scott Aaronson: Limitations of Quantum Advice and One-Way Communication Electronic Colloquium on Computational Complexity (ECCC)(026): (2004) |
| 21 | | Scott Aaronson: The Complexity of Agreement Electronic Colloquium on Computational Complexity (ECCC)(061): (2004) |
| 20 | | Scott Aaronson, Yaoyun Shi: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4): 595-605 (2004) |
| 2003 | ||
| 19 | | Scott Aaronson, Andris Ambainis: Quantum Search of Spatial Regions. FOCS 2003: 200-209 |
| 18 | | Scott Aaronson: Quantum Certificate Complexity. IEEE Conference on Computational Complexity 2003: 171-178 |
| 17 |  | Scott Aaronson: Is P Versus NP Formally Independent? Bulletin of the EATCS 81: 109-136 (2003) |
| 16 | | Scott Aaronson: Lower Bounds for Local Search by Quantum Arguments CoRR quant-ph/0307149: (2003) |
| 15 | | Scott Aaronson: Multilinear Formulas and Skepticism of Quantum Computing CoRR quant-ph/0311039: (2003) |
| 14 | | Scott Aaronson: Quantum Certificate Complexity Electronic Colloquium on Computational Complexity (ECCC) 10(005): (2003) |
| 13 | | Scott Aaronson: Lower Bounds for Local Search by Quantum Arguments Electronic Colloquium on Computational Complexity (ECCC)(057): (2003) |
| 12 | | Scott Aaronson: Multilinear Formulas and Skepticism of Quantum Computing Electronic Colloquium on Computational Complexity (ECCC)(079): (2003) |
| 11 | | Scott Aaronson: Quantum lower bound for recursive Fourier sampling. Quantum Information & Computation 3(2): 165-174 (2003) |
| 10 | | Scott Aaronson: Algorithms for Boolean Function Query Properties. SIAM J. Comput. 32(5): 1140-1157 (2003) |
| 2002 | ||
| 9 | | Scott Aaronson: Quantum lower bound for the collision problem. STOC 2002: 635-642 |
| 8 | | Scott Aaronson: Quantum Lower Bound for Recursive Fourier Sampling CoRR quant-ph/0209060: (2002) |
| 7 | | Scott Aaronson: Quantum Certificate Complexity CoRR quant-ph/0210020: (2002) |
| 6 | | Scott Aaronson: Quantum Lower Bound for Recursive Fourier Sampling Electronic Colloquium on Computational Complexity (ECCC)(072): (2002) |
| 5 | | Scott Aaronson: Book review. Quantum Information & Computation 2(5): 410-423 (2002) |
| 2001 | ||
| 4 | | Scott Aaronson: Algorithms for Boolean Function Query Properties CoRR cs.CC/0107010: (2001) |
| 3 | | Scott Aaronson: Quantum Lower Bound for the Collision Problem CoRR quant-ph/0111102: (2001) |
| 2000 | ||
| 2 | | Scott Aaronson: Query Complexity: Worst-Case Quantum Versus Average-Case Classical CoRR cs.CC/0001013: (2000) |
| 1997 | ||
| 1 | | Scott Aaronson: Optimal Demand-oriented Topology for Hypertext Systems. SIGIR 1997: 168-177 |
| 1 | Andris Ambainis | [19] [31] [65] [67] [98] |
| 2 | Alex Arkhipov | [73] [78] [97] |
| 3 | Baris Aydinlioglu | [72] |
| 4 | Salman Beigi | [56] [59] [61] |
| 5 | Harry Buhrman | [72] |
| 6 | Paul Christiano | [101] [102] [103] [104] |
| 7 | Andrew Drucker | [56] [59] [61] [71] [80] [82] [86] [94] [99] |
| 8 | Jeff Erickson | [85] |
| 9 | Edward Farhi | [83] |
| 10 | Bill Fefferman | [56] [59] [61] |
| 11 | François Le Gall (Francois Le Gall) | [69] [96] |
| 12 | David Gosset | [83] |
| 13 | Daniel Gottesman | [23] |
| 14 | Sudipto Guha | [63] |
| 15 | Avinatan Hassidim | [83] |
| 16 | John M. Hitchcock | [72] |
| 17 | Jonathan A. Kelner | [83] |
| 18 | Jon M. Kleinberg | [63] |
| 19 | Greg Kuperberg | [45] [46] [49] [51] |
| 20 | Andrew Lutomirski | [83] |
| 21 | Mohammad Mahdian | [85] |
| 22 | Frank McSherry | [63] |
| 23 | Dieter van Melkebeek | [63] [72] [76] [84] |
| 24 | R. Ravi | [85] |
| 25 | Alexander Russell | [69] [96] |
| 26 | Amit Sahai | [63] |
| 27 | Yaoyun Shi | [20] |
| 28 | Peter W. Shor | [56] [59] [61] [83] |
| 29 | Seiichiro Tani | [69] [96] |
| 30 | Emanuele Viola | [85] |
| 31 | John Watrous | [54] |
| 32 | Avi Wigderson | [57] [58] [62] |
Colors in the list of coauthors
Last update Fri May 25 03:49:23 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page