Refereed Journals Papers

L. Addario-Berry, B. Chor, M. Hallett, J. Lagergren, A. Panconesi, T. Wareham,  ``Ancestral Maximum Likelihood of
Evolutionary Trees is Hard'',
Jour. of Bioinformatics and Comp. Biology, Vol. 2, No. 2, 2004, 257-271
. (pdf)

A. Ben-Dor,  B. Chor, R. Karp, and Z. Yakhini,  ``Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem'', Jour. of Comput. Biology , Vol. 10, No. 3/4,  June 2003, pp. 373--384. (pdf)

B. Chor and Y. Ishay, ``On Privacy and Partition Arguments'', Information and Computation, Vol. 167, Issue 1, pp. 2-9, May 2001. (pdf)

B. Chor, M. Hendy, B. Holland, and D. Penny,  ``Multiple Maxima  of Likelihood in Phylogenetic Trees: An Analytic Approach.''  
Molecular Biology and Evolution , Vol. 17, No.10, September 2000,  pp. 1529--1541. (pdf)

B. Chor, A. Fiat, M. Naor, and B. Pinkas,  ``Tracing Traitors'',    IEEE Transactions on Information Theory , Vol. 46, May 2000, pp. 893-910.

A. Ben-Dor, B. Chor, and D. Pelleg, ``Radiation Hybrid Ordering (RHO)'', Genome Research , Vol. 10, Issue 3, March 2000 ,pp. 365--378.  (pdf)

B. Chor, P. Lemke, and Z. Mador, ``On the Number of Ordered Factorizations of Natural Numbers'',   Discrete Math. , Vol. 214, Issue 1-3,
March 2000, pp. 123--133.  (pdf)

B. Chor and L. Nelson, ``Solvability in Asynchronous Environments II: Finite Interactive  Tasks '',   SIAM Jour. Comp. , Vol. 29, No. 2, 1999, pp. 351-377.  (pdf) , (ps)

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, ``Private Information Retrieval'',   Jour. of ACM , Vol. 45, No. 6, Nov. 1998, pp. 965--981. (pdf)

B. Chor and M. Sudan, ``A Geometric Approach to Betweenness'', SIAM Jour. Disc. Math. , Vol. 11, No. 4, October 1998, pp. 511 - 523. (pdf) , (ps)

A. Ben-Dor, B. Chor, D. Graur, R. Ophir, D. Pelleg, ``Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships'', Jour. of Comput. Biology , Vol. 5, No. 3, Fall 1998, pp. 377--390. (ps)

A. Beimel and B. Chor, ``Secret Sharing with Public Reconstruction'', IEEE Transactions on Information Theory, Vol. 44, No. 4, September 1998, pp. 1887--1896.(ps)

A. Ben-Dor and B. Chor, ``On Constructing Radiation Hybrid Maps'', Jour. of Comput. Biology , Vol. 4, No. 4,  November 1997, pp. 517--533.

A. Beimel and B. Chor, ``Communication in Key Distribution Schemes'',   IEEE Transactions on Information Theory , Vol. 42, No. 1, January 1996, pp. 19--28. (ps)

B. Chor,  M. Gereb-Graus, and  E. Kushilevitz, ``Private Computations Over the Integers'',   SIAM Jour. Comp. , Vol. 24, No. 2, April 1995, pp. 376--386. (ps)

B. Chor and N. Shani, ``Privacy of Dense Symmetric Functions'', Computational Complexity , Vol. 5, 1995, pp. 43--59.

B. Chor, A. Israeli, and M. Li,  ``Wait--Free Consensus Using Asynchronous Hardware'',  SIAM Jour. Comp. , Vol. 23, No. 4, August 1994, pp. 701--712.

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, ``The Random Oracle Hypothesis is False'', Jour. of Computer and System Sciences , Vol. 49, No. 1, August 1994, pp.24--39.

A. Beimel and B. Chor, ``Universally Ideal Secret Sharing Schemes'',   IEEE Transactions on Information Theory , Vol. 40, No. 3, May 1994, pp. 786--794. (ps)

 B. Chor,  M. Ger\'eb-Graus, and  E. Kushilevitz, ``On the Structure of the Privacy Hierarchy'',  Jour. of Cryptology , Vol. 7, No. 1, January 1994, pp.53--60. (ps)

 R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky, ``Privacy, Additional Information, and Communication'',
IEEE Transactions on Information Theory , Vol. 39, No. 6, November 1993, pp. 1930-1943. (ps)

B. Chor and E. Kushilevitz, ``Secret Sharing Over Infinite Domains'', Jour. of Cryptology ,  Vol. 6, No. 2, June 1993, pp. 87-96. (ps)

B. Chor and E. Kushilevitz, ``A Communication--Privacy Tradeoff for Modular Addition'', Information Processing Letters , Vol. 45, March 1993, pp. 205--210. (ps)

S. Ben-David, B. Chor, O. Goldreich, M. Luby, ``On the Theory of Average Case Complexity'',   Jour. of Computer and System Sciences , Vol. 44, No. 2, April 1992, pp. 193--219.

B. Chor and E. Kushilevitz, ``A Zero-One Law for Boolean Privacy'', SIAM Jour. Disc. Math. , Vol. 4, No. 1, February 1991, pp. 36-47. (ps)

B. Chor and O. Goldreich, ``An Improved Parallel Algorithm for Integer GCD,''   Algorithmica , Vol. 5, No. 1, January 1990, pp. 1--10.

B. Chor and C. Dwork, ``Randomized Algorithms for Distributed Agreement -- A Survey'', Advances in Computing Research: a research annual ,  Vol. 5 (Randomness and Computation, S. Micali, ed.), pp. 443--497, 1989.

B. Chor, M. Merritt, and D. Shmoys, ``Simple Constant Time  Consensus Protocols in Realistic Failure Models'', Journal of ACM , Vol. 36, No. 3, July 1989, pp. 591--614. (pdf)

B. Chor and O. Goldreich, ``On the Power of Two--Point Based Sampling,'' Jour. of Complexity , Vol. 5, 1989, pp. 96--106.

B. Chor and M. Gereb-Grauss, ``On the Influence of Single Participants in Coin  Flipping Schemes'',   SIAM Jour. Disc. Math. , Vol. 1, No. 4, November 1988, pp. 411--415.

B. Chor and R. Rivest, ``A Knapsack Type Public Key Cryptosystem Based on Arithmetic in Finite Fields'',
IEEE Trans. Information Theory , Vol. 34, No. 5, September 1988, pp. 901--909.

B. Chor and O. Goldreich, ``Unbiased Bits From Sources of Weak  Randomness and Probabilistic Communication Complexity'', SIAM Jour. Comp. , Vol. 17, No. 2, April 1988, pp. 230--261.

W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr, ``RSA/Rabin Functions: Certain Parts are As Hard As the Whole'',  SIAM Jour. Comp. , Vol. 17, No. 2, April 1988, pp. 194--209.

B. Chor, C. Leiserson, R. Rivest, and J. Shearer, ``An Application of Number  Theory to the Organization of Raster Graphics Memory'', Journal of ACM , Vol. 33, No. 1, January 1986, pp. 86--104. (pdf)

B. Chor and B. Coan, ``A Simple and Efficient Randomized Byzantine Agreement Algorithm'',   IEEE Trans. Software Engineering, Vol. SE- No. 6, June 1985,  pp. 531--539.

B. Chor ``Arithmetic of Finite Fields'', Information Processing Letters , Vol. 14, No.1, March 1982, pp. 4--6.


B. Chor and M. Snir, "Molecular Clock Fork Phylogenies: Closed Form Analytic Maximum Likelihood Solutions",
Systematic Biology. (Extended abstract in RECOMB 2003). 


B. Chor, M. Hendy, and D. Penny, ``Analytic Solutions for Three Taxon MLmc Trees
with Variable Rates Across Sites''. (Early version in WABI 2001).  (pdf)