Author of the publication

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.

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.Secure PRNGs from Specialized Polynomial Maps over Any ., , and . PQCrypto, volume 5299 of Lecture Notes in Computer Science, page 181-202. Springer, (2008)Searching constant width mazes captures the AC0 hierarchy, , , and . Electron. Colloquium Comput. Complex., (1997)Oblivious polynomial evaluation and oblivious neural learning., and . Theor. Comput. Sci., 341 (1-3): 39-54 (2005)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)Extractors: optimal up to constant factors., , , and . STOC, page 602-611. ACM, (2003)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)Efficient String-Commitment from Weak Bit-Commitment., , , and . ASIACRYPT, volume 6477 of Lecture Notes in Computer Science, page 268-282. Springer, (2010)Computational Randomness from Generalized Hardcore Sets., , and . FCT, volume 6914 of Lecture Notes in Computer Science, page 78-89. Springer, (2011)Impossibility Results on Weakly Black-Box Hardness Amplification., , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 400-411. Springer, (2007)