Author of the publication

Approximate Maximum Parsimony and Ancestral Maximum Likelihood.

, , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 7 (1): 183-187 (2010)

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 Chor, Benny
add a person with the name Chor, Benny
 

Other publications of authors with the same name

A Zero-One Law for Boolean Privacy., and . SIAM J. Discrete Math., 4 (1): 36-47 (1991)Approximate Maximum Parsimony and Ancestral Maximum Likelihood., , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 7 (1): 183-187 (2010)Secret Sharing Over Infinite Domains., and . J. Cryptology, 6 (2): 87-95 (1993)The Privacy of Dense Symmetric Functions., and . Computational Complexity, 5 (1): 43-59 (1995)Solvability in Asynchronous Environments II: Finite Interactive Tasks., and . SIAM J. Comput., 29 (2): 351-377 (1999)Private Computations over the Integers., , and . SIAM J. Comput., 24 (2): 376-386 (1995)Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 257-269. Springer, (2004)Adding Hidden Nodes to Gene Networks (Extended Abstract)., and . WABI, volume 3240 of Lecture Notes in Computer Science, page 123-134. Springer, (2004)Ancestral Maximum Likelihood of Evolutionary Trees Is Hard., , , , , and . WABI, volume 2812 of Lecture Notes in Computer Science, page 202-215. Springer, (2003)Interaction in Key Distribution Schemes (Extended Abstract)., and . CRYPTO, volume 773 of Lecture Notes in Computer Science, page 444-455. Springer, (1993)