Search the dblp DataBase

Publications of Author

1. Alexander A. Sherstov, Peter Stone
   Improving Action Selection in MDP's via Knowledge Transfer. [Citation Graph (0, 0)][DBLP]
   AAAI, 2005, pp:1024-1029 [Conf]
   
2. Alexander A. Sherstov, Peter Stone
   Three Automated Stock-Trading Agents: A Comparative Study. [Citation Graph (0, 0)][DBLP]
   AMEC, 2004, pp:173-187 [Conf]
   
3. Adam R. Klivans, Alexander A. Sherstov
   Improved Lower Bounds for Learning Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
   COLT, 2006, pp:335-349 [Conf]
   
4. Adam R. Klivans, Alexander A. Sherstov
   Cryptographic Hardness for Learning Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:553-562 [Conf]
   
5. Alexander A. Sherstov, Peter Stone
   Function Approximation via Tile Coding: Automating Parameter Choice. [Citation Graph (0, 0)][DBLP]
   SARA, 2005, pp:194-205 [Conf]
   
6. Michael J. Jipping, Steve Marlowe, Alexander Sherstov
   Using Java to design and test hardware circuits over a classroom network. [Citation Graph (0, 0)][DBLP]
   SIGCSE, 2002, pp:162-166 [Conf]
   
7. Alexander A. Sherstov
   Distributed visualization of graph algorithms. [Citation Graph (0, 0)][DBLP]
   SIGCSE, 2003, pp:376-380 [Conf]
   
8. Alexander A. Sherstov
   Powering requires threshold depth 3. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:102, n:2-3, pp:104-107 [Journal]
   
9. Alexander A. Sherstov
   Halfspace Matrices. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:83-95 [Conf]
   
10. Adam R. Klivans, Alexander A. Sherstov
    A Lower Bound for Agnostically Learning Disjunctions. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:409-423 [Conf]
    
11. Alexander A. Sherstov
    Separating AC⁰ from depth-2 majority circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:294-301 [Conf]
    
12. 
    Communication Complexity under Product and Nonproduct Distributions. [Citation Graph (, )][DBLP]
    
    
13. 
    Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. [Citation Graph (, )][DBLP]
    
    
14. 
    The Sign-Rank of AC^O. [Citation Graph (, )][DBLP]
    
    
15. 
    The Unbounded-Error Communication Complexity of Symmetric Functions. [Citation Graph (, )][DBLP]
    
    
16. 
    The Intersection of Two Halfspaces Has High Threshold Degree. [Citation Graph (, )][DBLP]
    
    
17. 
    The pattern matrix method for lower bounds on quantum communication. [Citation Graph (, )][DBLP]
    
    
18. 
    Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. [Citation Graph (, )][DBLP]
    
    
19. 
    Halfspace Matrices. [Citation Graph (, )][DBLP]
    
    
20. 
    Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. [Citation Graph (, )][DBLP]
    
    
21. 
    Communication Complexity Under Product and Nonproduct Distributions. [Citation Graph (, )][DBLP]
    
    
22. 
    Communication Lower Bounds Using Dual Polynomials [Citation Graph (, )][DBLP]
    
    
23. 
    On Quantum-Classical Equivalence for Composed Communication Problems [Citation Graph (, )][DBLP]
    
    
24. 
    The Pattern Matrix Method (Journal Version) [Citation Graph (, )][DBLP]
    
    
25. 
    The intersection of two halfspaces has high threshold degree [Citation Graph (, )][DBLP]
    
    
26. 
    Optimal bounds for sign-representing the intersection of two halfspaces by polynomials [Citation Graph (, )][DBLP]
    
    
27. 
    A Separation of NP and coNP in Multiparty Communication Complexity [Citation Graph (, )][DBLP]
    
    
28. 
    Communication Lower Bounds Using Dual Polynomials. [Citation Graph (, )][DBLP]
    
    
29. 
    The Sign-Rank of AC^0. [Citation Graph (, )][DBLP]
    
    
30. 
    Unbounded-Error Communication Complexity of Symmetric Functions. [Citation Graph (, )][DBLP]
    
    
31. 
    Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. [Citation Graph (, )][DBLP]
    
    
32. 
    The Pattern Matrix Method for Lower Bounds on Quantum Communication. [Citation Graph (, )][DBLP]
    
    
33. 
    Communication Complexity under Product and Nonproduct Distributions. [Citation Graph (, )][DBLP]
    
    
34. 
    Cryptographic Hardness Results for Learning Intersections of Halfspaces. [Citation Graph (, )][DBLP]