- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i23 |      | Alexander A. Sherstov: Communication Lower Bounds Using Directional Derivatives. Electronic Colloquium on Computational Complexity (ECCC) 20: 5 (2013) |
| i22 | | Alexander A. Sherstov: Approximating the AND-OR Tree. Electronic Colloquium on Computational Complexity (ECCC) 20: 23 (2013) |
| 2012 | ||
| j16 | | Alexander A. Sherstov: Strong Direct Product Theorems for Quantum Communication and Query Complexity. SIAM J. Comput. 41(5): 1122-1165 (2012) |
| j15 | | Alexander A. Sherstov: The Communication Complexity of Gap Hamming Distance. Theory of Computing 8(1): 197-208 (2012) |
| c20 | | Alexander A. Sherstov: The multiparty communication complexity of set disjointness. STOC 2012: 525-548 |
| c19 | | |
| i21 | | Alexander A. Sherstov: Making Polynomials Robust to Noise. Electronic Colloquium on Computational Complexity (ECCC) 19: 37 (2012) |
| 2011 | ||
| j14 | | Alexander A. Sherstov: The unbounded-error communication complexity of symmetric functions. Combinatorica 31(5): 583-614 (2011) |
| j13 | | |
| c18 | | Alexander A. Sherstov: Strong direct product theorems for quantum communication and query complexity. STOC 2011: 41-50 |
| i20 | | Alexander A. Sherstov: Strong Direct Product Theorems for Quantum Communication and Query Complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 40 (2011) |
| i19 | | Alexander A. Sherstov: The Communication Complexity of Gap Hamming Distance. Electronic Colloquium on Computational Complexity (ECCC) 18: 63 (2011) |
| i18 | | Alexander A. Sherstov: The Multiparty Communication Complexity of Set Disjointness. Electronic Colloquium on Computational Complexity (ECCC) 18: 145 (2011) |
| 2010 | ||
| j12 | | Alexander A. Sherstov: Communication Complexity Under Product and Nonproduct Distributions. Computational Complexity 19(1): 135-150 (2010) |
| j11 | | Adam R. Klivans, Alexander A. Sherstov: Lower Bounds for Agnostic Learning via Approximate Rank. Computational Complexity 19(4): 581-604 (2010) |
| j10 | | Alexander A. Sherstov: On quantum-classical equivalence for composed communication problems. Quantum Information & Computation 10(5&6): 435-455 (2010) |
| j9 | | Alexander A. Razborov, Alexander A. Sherstov: The Sign-Rank of AC0. SIAM J. Comput. 39(5): 1833-1855 (2010) |
| j8 | | Dmitry Gavinsky, Alexander A. Sherstov: A Separation of NP and coNP in Multiparty Communication Complexity. Theory of Computing 6(1): 227-245 (2010) |
| c17 | | Alexander A. Sherstov: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. STOC 2010: 523-532 |
| i17 | | Dmitry Gavinsky, Alexander A. Sherstov: A Separation of NP and coNP in Multiparty Communication Complexity. CoRR abs/1004.0817 (2010) |
| i16 | | Alexander A. Sherstov: Strong direct product theorems for quantum communication and query complexity. CoRR abs/1011.4935 (2010) |
| i15 | | Alexander A. Sherstov: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 25 (2010) |
| i14 | | Dmitry Gavinsky, Alexander A. Sherstov: A Separation of NP and coNP in Multiparty Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 17: 60 (2010) |
| 2009 | ||
| j7 | | Alexander A. Sherstov: Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. Computational Complexity 18(2): 219-247 (2009) |
| j6 | | Adam R. Klivans, Alexander A. Sherstov: Cryptographic hardness for learning intersections of halfspaces. J. Comput. Syst. Sci. 75(1): 2-12 (2009) |
| j5 | | Alexander A. Sherstov: SeparatingAC0 from Depth-2 Majority Circuits. SIAM J. Comput. 38(6): 2113-2129 (2009) |
| c16 | | Alexander A. Sherstov: The Intersection of Two Halfspaces Has High Threshold Degree. FOCS 2009: 343-362 |
| i13 | | Alexander A. Sherstov: On Quantum-Classical Equivalence for Composed Communication Problems. CoRR abs/0906.1399 (2009) |
| i12 | | |
| i11 | | Alexander A. Sherstov: The intersection of two halfspaces has high threshold degree. CoRR abs/0910.1862 (2009) |
| i10 | | Alexander A. Sherstov: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. CoRR abs/0910.4224 (2009) |
| i9 | | Alexander A. Sherstov: The intersection of two halfspaces has high threshold degree. Electronic Colloquium on Computational Complexity (ECCC) 16: 98 (2009) |
| 2008 | ||
| j4 | | |
| j3 |  | Alexander A. Sherstov: Communication Lower Bounds Using Dual Polynomials. Bulletin of the EATCS 95: 59-93 (2008) |
| c15 | | Alexander A. Sherstov: Communication Complexity under Product and Nonproduct Distributions. IEEE Conference on Computational Complexity 2008: 64-70 |
| c14 | | Alexander A. Sherstov: Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. IEEE Conference on Computational Complexity 2008: 112-123 |
| c13 | | |
| c12 | | Alexander A. Sherstov: The Unbounded-Error Communication Complexity of Symmetric Functions. FOCS 2008: 384-393 |
| c11 | | Alexander A. Sherstov: The pattern matrix method for lower bounds on quantum communication. STOC 2008: 85-94 |
| i8 | | |
| i7 | | Alexander A. Razborov, Alexander A. Sherstov: The Sign-Rank of AC^0. Electronic Colloquium on Computational Complexity (ECCC) 15(016) (2008) |
| i6 | | Alexander A. Sherstov: Communication Lower Bounds Using Dual Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 15(057) (2008) |
| 2007 | ||
| j2 | | Alexander A. Sherstov: Powering requires threshold depth 3. Inf. Process. Lett. 102(2-3): 104-107 (2007) |
| j1 | | Adam R. Klivans, Alexander A. Sherstov: Unconditional lower bounds for learning intersections of halfspaces. Machine Learning 69(2-3): 97-114 (2007) |
| c10 | | |
| c9 | | Adam R. Klivans, Alexander A. Sherstov: A Lower Bound for Agnostically Learning Disjunctions. COLT 2007: 409-423 |
| c8 | | |
| i5 | | Alexander A. Sherstov: Communication Complexity under Product and Nonproduct Distributions. Electronic Colloquium on Computational Complexity (ECCC) 14(072) (2007) |
| i4 | | Alexander A. Sherstov: The Pattern Matrix Method for Lower Bounds on Quantum Communication. Electronic Colloquium on Computational Complexity (ECCC) 14(100) (2007) |
| i3 | | Alexander A. Sherstov: Unbounded-Error Communication Complexity of Symmetric Functions. Electronic Colloquium on Computational Complexity (ECCC) 14(112) (2007) |
| i2 | | Alexander A. Sherstov: Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. Electronic Colloquium on Computational Complexity (ECCC) 14(116) (2007) |
| 2006 | ||
| c7 | | Adam R. Klivans, Alexander A. Sherstov: Improved Lower Bounds for Learning Intersections of Halfspaces. COLT 2006: 335-349 |
| c6 | | Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness for Learning Intersections of Halfspaces. FOCS 2006: 553-562 |
| i1 | | Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness Results for Learning Intersections of Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(057) (2006) |
| 2005 | ||
| c5 | | Alexander A. Sherstov, Peter Stone: Improving Action Selection in MDP's via Knowledge Transfer. AAAI 2005: 1024-1029 |
| c4 | | Alexander A. Sherstov, Peter Stone: Function Approximation via Tile Coding: Automating Parameter Choice. SARA 2005: 194-205 |
| 2004 | ||
| c3 | | Alexander A. Sherstov, Peter Stone: Three Automated Stock-Trading Agents: A Comparative Study. AMEC 2004: 173-187 |
| 2003 | ||
| c2 | | |
| 2002 | ||
| c1 | | Michael J. Jipping, Steve Marlowe, Alexander A. Sherstov: Using Java to design and test hardware circuits over a classroom network. SIGCSE 2002: 162-166 |
| 1 | Dmitry Gavinsky | |
| 2 | Michael J. Jipping | |
| 3 | Adam R. Klivans (Adam Klivans) | |
| 4 | Steve Marlowe | |
| 5 | Alexander A. Razborov | |
| 6 | Peter Stone |
Data released under the ODC-BY 1.0 license — See also our legal information page