Author of the publication

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

An Analysis of a Simple Genetic Algorithm., and . ICGA, page 215-221. Morgan Kaufmann, (1991)A deterministic polynomial time algorithm for non-commutative rational identity testing., , , and . CoRR, (2015)Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation., , , and . SIAM J. Comput., 46 (1): 114-131 (2017)Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy., and . SIAM J. Discret. Math., 8 (4): 536-542 (1995)Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity., , and . Comput. Complex., 5 (3/4): 191-204 (1995)Depth-3 arithmetic circuits over fields of characteristic zero., and . Comput. Complex., 10 (1): 1-27 (2001)On the Circuit Complexity of Perfect Hashing., and . Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)Simplified Derandomization of BPP Using a Hitting Set Generator., , and . Studies in Complexity and Cryptography, volume 6650 of Lecture Notes in Computer Science, Springer, (2011)Iterative Construction of Cayley Expander Graphs., , and . Theory of Computing, 2 (5): 91-120 (2006)The Randomized Communication Complexity of Set Disjointness., and . Theory of Computing, 3 (1): 211-219 (2007)