Benny Chor

Benny Chor: Preface: RECOMB 2012. Journal of Computational Biology 20(2): 63 (2013)

Eyal Cohen, Benny Chor: Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences. Journal of Computational Biology 19(8): 945-956 (2012)

Benny Chor, Rani Hod: CS1001.py: a topic-based introduction to computer science. ITiCSE 2012: 215-220

Benny Chor (Ed.): Research in Computational Molecular Biology - 16th Annual International Conference, RECOMB 2012, Barcelona, Spain, April 21-24, 2012. Proceedings. Lecture Notes in Computer Science 7262, Springer 2012, isbn 978-3-642-29626-0

Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport: Approximate Maximum Parsimony and Ancestral Maximum Likelihood. IEEE/ACM Trans. Comput. Biology Bioinform. 7(1): 183-187 (2010)

Giora Unger, Benny Chor: Linear Separability of Gene Expression Data Sets. IEEE/ACM Trans. Comput. Biology Bioinform. 7(2): 375-381 (2010)

Benny Chor, David Horn, Nick Goldman, Yaron Levy, Tim Massingham: Genomic DNA k-mer Spectra: Models and Modalities. RECOMB 2010: 571

Matan Gavish, Amnon Peled, Benny Chor: Genetic code symmetry and efficient design of GC-constrained coding sequences. Bioinformatics 23(2): 57-63 (2007)

Benny Chor, Michael D. Hendy, David Penny: Analytic solutions for three taxon ML trees with variable rates across sites. Discrete Applied Mathematics 155(6-7): 750-758 (2007)

Benny Chor, Tamir Tuller: Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length. Journal of Computational Biology 14(6): 817-838 (2007)

Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir: Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON 2007: 75-85

Benny Chor, Tamir Tuller: Finding a maximum likelihood tree is hard. J. ACM 53(5): 722-744 (2006)

Igor Ulitsky, David Burstein, Tamir Tuller, Benny Chor: The Average Common Substring Approach to Phylogenomic Reconstruction. Journal of Computational Biology 13(2): 336-350 (2006)

Benny Chor, Amit Khetan, Sagi Snir: Maximum Likelihood Molecular Clock Comb: Analytic Solutions. Journal of Computational Biology 13(3): 819-837 (2006)

Benny Chor, Tamir Tuller: Biological Networks: Comparison, Conservation, and Evolutionary Trees. RECOMB 2006: 30-44

Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2): 216-231 (2005)

Benny Chor, Tamir Tuller: Maximum likelihood of evolutionary trees: hardness and approximation. ISMB (Supplement of Bioinformatics) 2005: 97-106

David Burstein, Igor Ulitsky, Tamir Tuller, Benny Chor: Information Theoretic Approaches to Whole Genome Phylogenies. RECOMB 2005: 283-295

Benny Chor, Tamir Tuller: Maximum Likelihood of Evolutionary Trees Is Hard. RECOMB 2005: 296-310

Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. Chamovitz, Benny Chor: Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds. WABI 2005: 53-64

Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham: Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinformatics and Computational Biology 2(2): 257-272 (2004)

Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia: Tight Lower Bounds for Certain Parameterized NP-Hard Problems. IEEE Conference on Computational Complexity 2004: 150-160

Benny Chor, Tamir Tuller: Adding Hidden Nodes to Gene Networks (Extended Abstract). WABI 2004: 123-134

Benny Chor, Mike Fellows, David W. Juedes: Linear Kernels in Linear Time, or How to Save k Colors in O(n²) Steps. WG 2004: 257-269

Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini: Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. Journal of Computational Biology 10(3/4): 373-384 (2003)

Benny Chor, Amit Khetan, Sagi Snir: Maximum likelihood on four taxa phylogenetic trees: analytic solutions. RECOMB 2003: 76-83

Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham: Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215

Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini: Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB 2002: 49-57

Benny Chor, Yuval Ishai: On Privacy and Partition Arguments. Inf. Comput. 167(1): 2-9 (2001)

Benny Chor, Michael D. Hendy, David Penny: Analytic Solutions for Three-Taxon ML_MC Trees with Variable Rates Across Sites. WABI 2001: 204-213

Benny Chor, Paul Lemke, Ziv Mador: On the number of ordered factorizations of natural numbers. Discrete Mathematics 214(1-3): 123-133 (2000)

Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas: Tracing traitors. IEEE Transactions on Information Theory 46(3): 893-910 (2000)

Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny: Multiple maxima of likelihood in phylogenetic trees: an analytic approach. RECOMB 2000: 108-117

Benny Chor, Lee-Bath Nelson: Solvability in Asynchronous Environments II: Finite Interactive Tasks. SIAM J. Comput. 29(2): 351-377 (1999)

Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan: Private Information Retrieval. J. ACM 45(6): 965-981 (1998)

Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg: Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships. Journal of Computational Biology 5(3): 377-390 (1998)

Benny Chor, Madhu Sudan: A Geometric Approach to Betweenness. SIAM J. Discrete Math. 11(4): 511-523 (1998)

Amos Beimel, Benny Chor: Secret Sharing with Public Reconstruction. IEEE Transactions on Information Theory 44(5): 1887-1896 (1998)

Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg: From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. RECOMB 1998: 9-19

Benny Chor: From Quartets to Phylogenetic Trees. SOFSEM 1998: 36-53

Amir Ben-Dor, Benny Chor: On Constructing Radiation Hybrid Maps. Journal of Computational Biology 4(4): 517-533 (1997)

Amir Ben-Dor, Benny Chor: On constructing radiation hybrid maps (extended abstract). RECOMB 1997: 17-26

Benny Chor, Niv Gilboa: Computationally Private Information Retrieval (Extended Abstract). STOC 1997: 304-313

Amos Beimel, Benny Chor: Communication in key distribution schemes. IEEE Transactions on Information Theory 42(1): 19-28 (1996)

Benny Chor, Yuval Ishai: On Privacy and Partition Arguments. ISTCS 1996: 191-194

Benny Chor, Netta Shani: The Privacy of Dense Symmetric Functions. Computational Complexity 5(1): 43-59 (1995)

Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: Private Computations over the Integers. SIAM J. Comput. 24(2): 376-386 (1995)

Amos Beimel, Benny Chor: Secret Sharing with Public Reconstruction (Extended Abstract). CRYPTO 1995: 353-366

Benny Chor, Madhu Sudan: A Geometric Approach to Betweenness. ESA 1995: 227-237

Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan: Private Information Retrieval. FOCS 1995: 41-50

Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi: The Random Oracle Hypothesis Is False. J. Comput. Syst. Sci. 49(1): 24-39 (1994)

Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: On the Structure of the Privacy Hierarchy. J. Cryptology 7(1): 53-60 (1994)

Benny Chor, Amos Israeli, Ming Li: Wait-Free Consensus Using Asynchronous Hardware. SIAM J. Comput. 23(4): 701-712 (1994)

Amos Beimel, Benny Chor: Universally ideal secret-sharing schemes. IEEE Transactions on Information Theory 40(3): 786-794 (1994)

Benny Chor, Amos Fiat, Moni Naor: Tracing Traitors. CRYPTO 1994: 257-270

Benny Chor, Lee-Bath Nelson: Resilience of General Interactive Tasks. PODC 1994: 173-182

Benny Chor, Eyal Kushilevitz: A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45(4): 205-210 (1993)

Benny Chor, Eyal Kushilevitz: Secret Sharing Over Infinite Domains. J. Cryptology 6(2): 87-95 (1993)

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky: Privacy, additional information and communication. IEEE Transactions on Information Theory 39(6): 1930-1943 (1993)

Amos Beimel, Benny Chor: Interaction in Key Distribution Schemes (Extended Abstract). CRYPTO 1993: 444-455

Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby: On the Theory of Average Case Complexity. J. Comput. Syst. Sci. 44(2): 193-219 (1992)

Amos Beimel, Benny Chor: Universally Ideal Secret Sharing Schemes (Preliminary Version). CRYPTO 1992: 183-195

Benny Chor, Eyal Kushilevitz: A Zero-One Law for Boolean Privacy. SIAM J. Discrete Math. 4(1): 36-47 (1991)

Benny Chor, Lee-Bath Nelson: Resiliency of Interactive Distributed Tasks (Extended Abstract). PODC 1991: 37-49

Benny Chor, Oded Goldreich: An Improved Parallel Algorithm for Integer GCD. Algorithmica 5(1): 1-10 (1990)

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz: Privacy, Additional Information, and Communication. Structure in Complexity Theory Conference 1990: 55-65

Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: Private Computations Over the Integers (Extended Abstract). FOCS 1990: 335-344

Benny Chor, Michael Merritt, David B. Shmoys: Simple constant-time consensus protocols in realistic failure models. J. ACM 36(3): 591-614 (1989)

Benny Chor, Oded Goldreich: On the power of two-point based sampling. J. Complexity 5(1): 96-106 (1989)

Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby: On the Theory of Average Case Complexity (abstract). Structure in Complexity Theory Conference 1989: 36

Benny Chor, Eyal Kushilevitz: Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO 1989: 299-306

Benny Chor, Lior Moscovici: Solvability in Asynchronous Environments (Extended Abstract). FOCS 1989: 422-427

Benny Chor, Eyal Kushilevitz: A Zero-One Law for Boolean Privacy (extended abstract). STOC 1989: 62-72

Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby: On the Theory of Average Case Complexity. STOC 1989: 204-216

Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr: RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Comput. 17(2): 194-209 (1988)

Benny Chor, Oded Goldreich: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput. 17(2): 230-261 (1988)

Benny Chor, Mihály Geréb-Graus: On the Influence of Single Participant in Coin Flipping Schemes. SIAM J. Discrete Math. 1(4): 411-415 (1988)

Benny Chor, Ronald L. Rivest: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Transactions on Information Theory 34(5): 901-909 (1988)

Benny Chor, Amos Israeli, Ming Li: On Processor Coordination Using Asynchronous Hardware. PODC 1987: 86-97

Benny Chor, Michael O. Rabin: Achieving Independence in Logarithmic Number of Rounds. PODC 1987: 260-268

Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer: An application of number theory to the organization of raster-graphics memory. J. ACM 33(1): 86-104 (1986)

Benny Chor, Brian A. Coan: A Simple and Efficient Randomized Byzantine Agreement Algorithm. IEEE Trans. Software Eng. 11(6): 531-539 (1985)

Benny Chor, Oded Goldreich, Shafi Goldwasser: The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. CRYPTO 1985: 448-457

Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). FOCS 1985: 383-395

Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky: The Bit Extraction Problem of t-Resilient Functions (Preliminary Version). FOCS 1985: 396-407

Benny Chor, Oded Goldreich: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract). FOCS 1985: 429-442

Benny Chor, Michael Merritt, David B. Shmoys: Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC 1985: 152-162

Benny Chor, Ronald L. Rivest: A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. CRYPTO 1984: 54-65

Benny Chor, Oded Goldreich: RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. CRYPTO 1984: 303-313

Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr: RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure. FOCS 1984: 449-457

Benny Chor, Brian A. Coan: A Simple and Efficient Randomized Byzantine Agreement Algorithm. Symposium on Reliability in Distributed Software and Database Systems 1984: 98-106

Michael Ben-Or, Benny Chor, Adi Shamir: On the Cryptographic Security of Single RSA Bits. STOC 1983: 421-430

Benny Chor, Charles E. Leiserson, Ronald L. Rivest: An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract). FOCS 1982: 92-99