The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander A. Sherstov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Alexander A. Sherstov, Peter Stone
**Three Automated Stock-Trading Agents: A Comparative Study.**[Citation Graph (0, 0)][DBLP] AMEC, 2004, pp:173-187 [Conf] - 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] - Adam R. Klivans, Alexander A. Sherstov
**Cryptographic Hardness for Learning Intersections of Halfspaces.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:553-562 [Conf] - Alexander A. Sherstov, Peter Stone
**Function Approximation via Tile Coding: Automating Parameter Choice.**[Citation Graph (0, 0)][DBLP] SARA, 2005, pp:194-205 [Conf] - 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] - Alexander A. Sherstov
**Distributed visualization of graph algorithms.**[Citation Graph (0, 0)][DBLP] SIGCSE, 2003, pp:376-380 [Conf] - 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] - Alexander A. Sherstov
**Halfspace Matrices.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:83-95 [Conf] - Adam R. Klivans, Alexander A. Sherstov
**A Lower Bound for Agnostically Learning Disjunctions.**[Citation Graph (0, 0)][DBLP] COLT, 2007, pp:409-423 [Conf] - Alexander A. Sherstov
**Separating AC**[Citation Graph (0, 0)][DBLP]^{0}from depth-2 majority circuits. STOC, 2007, pp:294-301 [Conf] **Communication Complexity under Product and Nonproduct Distributions.**[Citation Graph (, )][DBLP]**Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.**[Citation Graph (, )][DBLP]**The Sign-Rank of AC^O.**[Citation Graph (, )][DBLP]**The Unbounded-Error Communication Complexity of Symmetric Functions.**[Citation Graph (, )][DBLP]**The Intersection of Two Halfspaces Has High Threshold Degree.**[Citation Graph (, )][DBLP]**The pattern matrix method for lower bounds on quantum communication.**[Citation Graph (, )][DBLP]**Optimal bounds for sign-representing the intersection of two halfspaces by polynomials.**[Citation Graph (, )][DBLP]**Halfspace Matrices.**[Citation Graph (, )][DBLP]**Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.**[Citation Graph (, )][DBLP]**Communication Complexity Under Product and Nonproduct Distributions.**[Citation Graph (, )][DBLP]**Communication Lower Bounds Using Dual Polynomials**[Citation Graph (, )][DBLP]**On Quantum-Classical Equivalence for Composed Communication Problems**[Citation Graph (, )][DBLP]**The Pattern Matrix Method (Journal Version)**[Citation Graph (, )][DBLP]**The intersection of two halfspaces has high threshold degree**[Citation Graph (, )][DBLP]**Optimal bounds for sign-representing the intersection of two halfspaces by polynomials**[Citation Graph (, )][DBLP]**A Separation of NP and coNP in Multiparty Communication Complexity**[Citation Graph (, )][DBLP]**Communication Lower Bounds Using Dual Polynomials.**[Citation Graph (, )][DBLP]**The Sign-Rank of AC^0.**[Citation Graph (, )][DBLP]**Unbounded-Error Communication Complexity of Symmetric Functions.**[Citation Graph (, )][DBLP]**Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions.**[Citation Graph (, )][DBLP]**The Pattern Matrix Method for Lower Bounds on Quantum Communication.**[Citation Graph (, )][DBLP]**Communication Complexity under Product and Nonproduct Distributions.**[Citation Graph (, )][DBLP]**Cryptographic Hardness Results for Learning Intersections of Halfspaces.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |