Author of the publication

Towards efficient constructions of hitting sets that derandomize BPP

, , and . Electron. Colloquium Comput. Complex., (1996)

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

Distributed multi-broadcast in unknown radio networks., , and . PODC, page 255-264. ACM, (2001)Hitting Sets Derandomize BPP., , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 357-368. Springer, (1996)Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 319-330. Springer, (1996)Efficient Construction of Hitting Sets for Systems of Linear Functions., , and . STACS, volume 1200 of Lecture Notes in Computer Science, page 387-398. Springer, (1997)Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults., , , and . MFCS, volume 4708 of Lecture Notes in Computer Science, page 430-441. Springer, (2007)On the Parallel Computation of Boolean Functions on Unrelated inputs., , and . ISTCS, page 155-161. IEEE Computer Society, (1996)The minimum broadcast range assignment problem on linear multi-hop wireless networks., , and . Theor. Comput. Sci., 299 (1-3): 751-761 (2003)Minimum-Energy Broadcast and disk cover in grid wireless networks., , , , , and . Theor. Comput. Sci., 399 (1-2): 38-53 (2008)Towards efficient constructions of hitting sets that derandomize BPP, , and . Electron. Colloquium Comput. Complex., (1996)Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints, and . Electron. Colloquium Comput. Complex., (1996)