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.

No persons found for author name Kushilevitz, Eyal
add a person with the name Kushilevitz, Eyal
 

Other publications of authors with the same name

On Pseudorandom Generators with Linear Stretch in NC0., , and . Computational Complexity, 17 (1): 38-69 (2008)Characterizing Linear Size Circuits in Terms of Pricacy., , and . J. Comput. Syst. Sci., 58 (1): 129-136 (1999)Adaptive Packet Routing for Bursty Adversarial Traffic., , , and . J. Comput. Syst. Sci., 60 (3): 482-509 (2000)Choosing, Agreeing, and Eliminating in Communication Complexity., , , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 451-462. Springer, (2010)Learning Automata., , , , and . Encyclopedia of Algorithms, Springer, (2008)OT-Combiners via Secure Computation., , , and . TCC, volume 4948 of Lecture Notes in Computer Science, page 393-411. Springer, (2008)Best Possible Information-Theoretic MPC., , , and . TCC (2), volume 11240 of Lecture Notes in Computer Science, page 255-281. Springer, (2018)Amortized Communication Complexity (Preliminary Version), , and . FOCS, page 239-248. IEEE Computer Society, (1991)On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions., , and . EUROCRYPT, volume 2656 of Lecture Notes in Computer Science, page 68-86. Springer, (2003)Communication Complexity: From Two-Party to Multiparty.. SIROCCO, volume 6058 of Lecture Notes in Computer Science, page 1. Springer, (2010)