Author of the publication

Three Automated Stock-Trading Agents: A Comparative Study.

, and . AMEC, volume 3435 of Lecture Notes in Computer Science, page 173-187. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Lower Bound for Agnostically Learning Disjunctions., and . COLT, volume 4539 of Lecture Notes in Computer Science, page 409-423. Springer, (2007)The Pattern Matrix Method for Lower Bounds on Quantum Communication.. Electron. Colloquium Comput. Complex., (2007)Inner Product and Set Disjointness: Beyond Logarithmically Many Parties., and . Electron. Colloquium Comput. Complex., (2017)Distributed visualization of graph algorithms.. SIGCSE, page 376-380. ACM, (2003)Cryptographic Hardness for Learning Intersections of Halfspaces., and . FOCS, page 553-562. IEEE Computer Society, (2006)Optimal Interactive Coding for Insertions, Deletions, and Substitutions., and . FOCS, page 240-251. IEEE Computer Society, (2017)Algorithmic polynomials.. STOC, page 311-324. ACM, (2018)Function Approximation via Tile Coding: Automating Parameter Choice., and . SARA, volume 3607 of Lecture Notes in Computer Science, page 194-205. Springer, (2005)The unbounded-error communication complexity of symmetric functions.. Combinatorica, 31 (5): 583-614 (2011)An optimal separation of randomized and Quantum query complexity., , and . STOC, page 1289-1302. ACM, (2021)