| 2009 |
|---|
| 28 | EE | Adam R. Klivans,
Alexander A. Sherstov:
Cryptographic hardness for learning intersections of halfspaces.
J. Comput. Syst. Sci. 75(1): 2-12 (2009) |
| 27 | EE | Alexander A. Sherstov:
SeparatingAC0 from Depth-2 Majority Circuits.
SIAM J. Comput. 38(6): 2113-2129 (2009) |
| 2008 |
|---|
| 26 | EE | Alexander A. Sherstov:
The Unbounded-Error Communication Complexity of Symmetric Functions.
FOCS 2008: 384-393 |
| 25 | EE | Alexander A. Razborov,
Alexander A. Sherstov:
The Sign-Rank of AC^O.
FOCS 2008: 57-66 |
| 24 | EE | Alexander A. Sherstov:
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.
IEEE Conference on Computational Complexity 2008: 112-123 |
| 23 | EE | Alexander A. Sherstov:
Communication Complexity under Product and Nonproduct Distributions.
IEEE Conference on Computational Complexity 2008: 64-70 |
| 22 | EE | Alexander A. Sherstov:
The pattern matrix method for lower bounds on quantum communication.
STOC 2008: 85-94 |
| 21 | EE | Alexander A. Sherstov:
Communication Lower Bounds Using Dual Polynomials
CoRR abs/0805.2135: (2008) |
| 20 | EE | Alexander A. Sherstov:
Halfspace Matrices.
Computational Complexity 17(2): 149-178 (2008) |
| 19 | EE | Alexander A. Razborov,
Alexander A. Sherstov:
The Sign-Rank of AC^0.
Electronic Colloquium on Computational Complexity (ECCC) 15(016): (2008) |
| 18 | EE | Alexander A. Sherstov:
Communication Lower Bounds Using Dual Polynomials.
Electronic Colloquium on Computational Complexity (ECCC) 15(057): (2008) |
| 2007 |
|---|
| 17 | EE | Adam R. Klivans,
Alexander A. Sherstov:
A Lower Bound for Agnostically Learning Disjunctions.
COLT 2007: 409-423 |
| 16 | EE | Alexander A. Sherstov:
Halfspace Matrices.
IEEE Conference on Computational Complexity 2007: 83-95 |
| 15 | EE | Alexander A. Sherstov:
Separating AC0 from depth-2 majority circuits.
STOC 2007: 294-301 |
| 14 | EE | Alexander A. Sherstov:
Communication Complexity under Product and Nonproduct Distributions.
Electronic Colloquium on Computational Complexity (ECCC) 14(072): (2007) |
| 13 | EE | Alexander A. Sherstov:
The Pattern Matrix Method for Lower Bounds on Quantum Communication.
Electronic Colloquium on Computational Complexity (ECCC) 14(100): (2007) |
| 12 | EE | Alexander A. Sherstov:
Unbounded-Error Communication Complexity of Symmetric Functions.
Electronic Colloquium on Computational Complexity (ECCC) 14(112): (2007) |
| 11 | EE | Alexander A. Sherstov:
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.
Electronic Colloquium on Computational Complexity (ECCC) 14(116): (2007) |
| 10 | EE | Alexander A. Sherstov:
Powering requires threshold depth 3.
Inf. Process. Lett. 102(2-3): 104-107 (2007) |
| 9 | EE | Adam R. Klivans,
Alexander A. Sherstov:
Unconditional lower bounds for learning intersections of halfspaces.
Machine Learning 69(2-3): 97-114 (2007) |
| 2006 |
|---|
| 8 | EE | Adam R. Klivans,
Alexander A. Sherstov:
Improved Lower Bounds for Learning Intersections of Halfspaces.
COLT 2006: 335-349 |
| 7 | EE | Adam R. Klivans,
Alexander A. Sherstov:
Cryptographic Hardness for Learning Intersections of Halfspaces.
FOCS 2006: 553-562 |
| 6 | EE | Adam R. Klivans,
Alexander A. Sherstov:
Cryptographic Hardness Results for Learning Intersections of Halfspaces.
Electronic Colloquium on Computational Complexity (ECCC) 13(057): (2006) |
| 2005 |
|---|
| 5 | | Alexander A. Sherstov,
Peter Stone:
Improving Action Selection in MDP's via Knowledge Transfer.
AAAI 2005: 1024-1029 |
| 4 | EE | Alexander A. Sherstov,
Peter Stone:
Function Approximation via Tile Coding: Automating Parameter Choice.
SARA 2005: 194-205 |
| 2004 |
|---|
| 3 | EE | Alexander A. Sherstov,
Peter Stone:
Three Automated Stock-Trading Agents: A Comparative Study.
AMEC 2004: 173-187 |
| 2003 |
|---|
| 2 | EE | Alexander A. Sherstov:
Distributed visualization of graph algorithms.
SIGCSE 2003: 376-380 |
| 2002 |
|---|
| 1 | EE | Michael J. Jipping,
Steve Marlowe,
Alexander A. Sherstov:
Using Java to design and test hardware circuits over a classroom network.
SIGCSE 2002: 162-166 |
