Author of the publication

Monte-Carlo Approximation Algorithms for Enumeration Problems.

, , and . J. Algorithms, 10 (3): 429-448 (1989)

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

A parallel approximation algorithm for positive linear programming., and . STOC, page 448-457. ACM, (1993)Pseudo-random Permutation Generators and Cryptographic Composition, and . STOC, page 356-363. ACM, (1986)On the Existence of Pseudorandom Generators., , and . SIAM J. Comput., 22 (6): 1163-1175 (1993)Repeat-accumulate codes that approach the Gilbert-Varshamov bound., , and . ISIT, page 169-173. IEEE, (2005)Combinatorial Bounds for Broadcast Encryption., and . EUROCRYPT, volume 1403 of Lecture Notes in Computer Science, page 512-526. Springer, (1998)Liquid Data Networking., and . ICN, page 129-135. ACM, (2020)How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin, , and . FOCS, page 11-21. IEEE Computer Society, (1983)Feedback-free multicast prefix protocols., , , and . ISCC, page 135-141. IEEE Computer Society, (1998)Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)., , and . FOCS, page 512-519. IEEE Computer Society, (1995)Optimal Speedup of Las Vegas Algorithms., , and . ISTCS, page 128-133. IEEE Computer Society, (1993)