Author of the publication

Oblivious polynomial evaluation and oblivious neural learning.

, and . Theor. Comput. Sci., 341 (1-3): 39-54 (2005)

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

Constant Time Algorithms for the Transitive Closure Problem and Its Applications., , and . ICPP (3), page 52-59. Pennsylvania State University Press, (1990)0-271-00728-1.On the Algorithmic Power of Spiking Neural Networks., , and . ITCS, volume 124 of LIPIcs, page 26:1-26:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Deterministic Extractors for Independent-Symbol Sources., , and . IEEE Trans. Inf. Theory, 56 (12): 6501-6512 (2010)Extracting Computational Entropy and Learning Noisy Linear Functions., , and . IEEE Trans. Inf. Theory, 57 (8): 5485-5496 (2011)Efficient algorithms for two generalized 2-median problems and the group median problem on trees., , , and . Theor. Comput. Sci., 410 (8-10): 867-876 (2009)Oblivious polynomial evaluation and oblivious neural learning., and . Theor. Comput. Sci., 341 (1-3): 39-54 (2005)Extractors: optimal up to constant factors., , , and . STOC, page 602-611. ACM, (2003)Efficient String-Commitment from Weak Bit-Commitment., , , and . ASIACRYPT, volume 6477 of Lecture Notes in Computer Science, page 268-282. Springer, (2010)Searching Constant Width Mazes Captures the AC0 Hierarchy., , , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 73-83. Springer, (1998)Computational Randomness from Generalized Hardcore Sets., , and . FCT, volume 6914 of Lecture Notes in Computer Science, page 78-89. Springer, (2011)