B. Chor

发表

On processor coordination using asynchronous hardware

Amos Israeli, Ming Li, Benny Chor, 1987, PODC '87.

Oded Goldreich, Desh Ranjan, B. Chor, 1994, J. Comput. Syst. Sci..

Discovering local structure in gene expression data: the order-preserving submatrix problem.

Richard M. Karp, Zohar Yakhini, Benny Chor, 2003 .

RSA/Rabin least significant bits are \( \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} \) secure (Extended Abstract)

Oded Goldreich, B. Chor, 1984 .

Tracing Traitors

Amos Fiat, Moni Naor, Benny Chor, 1994, CRYPTO.

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Oded Goldreich, Benny Chor, Oded Goldreich, 1988, SIAM J. Comput..

Private information retrieval

Eyal Kushilevitz, Oded Goldreich, Madhu Sudan, 1998, JACM.

A Geometric Approach to Betweenness

Madhu Sudan, Benny Chor, B. Chor, 1995, ESA.

Verifiable secret sharing and achieving simultaneity in the presence of faults

Baruch Awerbuch, Silvio Micali, Shafi Goldwasser, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

A Simple and Efficient Randomized Byzantine Agreement Algorithm

Brian A. Coan, Benny Chor, B. Chor, 1985, IEEE Transactions on Software Engineering.

Two Issues in Public Key Cryptography: RSA Bit Security and a New Knapsack Type System

B. Chor, 1986 .

RSA and Rabin Functions: Certain Parts are as Hard as the Whole

Oded Goldreich, Claus-Peter Schnorr, Benny Chor, 1988, SIAM J. Comput..

Tight lower bounds for certain parameterized NP-hard problems

Iyad A. Kanj, B. Chor, D. Juedes, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Cases in which ancestral maximum likelihood will be confusingly misleading.

B. Chor, Tomer Handelman, 2017, Journal of theoretical biology.

Do tree split probabilities determine the branch lengths?

B. Chor, M. Steel, 2015, Journal of theoretical biology.

Multiple maxima of likelihood in phylogenetic trees: an analytic approach

B. Chor, D. Penny, M. Hendy, 2000, RECOMB '00.

Genomic DNA k-mer spectra: models and modalities

B. Chor, D. Horn, T. Massingham, 2009, Genome Biology.

RHO--radiation hybrid ordering.

B. Chor, A. Ben-Dor, D. Pelleg, 2000, Genome research.

Analytic solutions of maximum likelihood on forks of four taxa.

Sagi Snir, Benny Chor, B. Chor, 2007, Mathematical biosciences.

Maximum likelihood Jukes-Cantor triplets: analytic solutions.

Sagi Snir, Benny Chor, B. Chor, 2005, Molecular biology and evolution.

Tree split probabilities determine the branch lengths

B. Chor, M. Steel, 2013, 1310.3316.

Maximum Likelihood Molecular Clock Comb : Analytic Solutions 1

B. Chor, S. Snir, Amit Khetan, 2006 .

Molecular clock fork phylogenies: closed form analytic maximum likelihood solutions.

Sagi Snir, Benny Chor, B. Chor, 2004, Systematic biology.

ML MC Forks: Closed Form Analytic Solutions

B. Chor, S. Snir, 2004 .

The Functional 3D Organization of Unicellular Genomes

B. Chor, Z. Yakhini, Shay Ben-Elazar, 2019, Scientific Reports.

Secure Multi-party Computation Dedication a Warning

M. Bellare, Oded Goldreich, H. Attiya, 1998 .

Genomic analysis of COP 9 signalosome function in Drosophila melanogaster reveals a role in temporal regulation of gene expression

B. Chor, D. Yekutieli, B. Edgar, 2007 .

The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)

Oded Goldreich, Johan Håstad, Roman Smolensky, 1985, FOCS.

Hierarchical Partitioning of Metazoan Protein Conservation Profiles Provides New Functional Insights

B. Chor, D. Horn, Erez Persi, 2014, PloS one.

BioNSi: A Discrete Biological Network Simulator Tool.

Benny Chor, Amir Rubinstein, Noga Bracha, 2016, Journal of proteome research.

Randomization in Byzantine Agreement

Cynthia Dwork, Benny Chor, C. Dwork, 1989, Adv. Comput. Res..

A Zero-One Law for Boolean Privacy (extended abstract)

Eyal Kushilevitz, Benny Chor, B. Chor, 1989, STOC 1989.

Genomic analysis of COP9 signalosome function in Drosophila melanogaster reveals a role in temporal regulation of gene expression

Tamir Tuller, Benny Chor, Daniel Yekutieli, 2007, Molecular systems biology.

Communication in Key Distribution

Amos Beimel, Benny Chor, B. Chor, 1996 .

From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution

Dan Pelleg, Dan Graur, Ron Ophir, 1998, RECOMB '98.

A SKETCH OF SCHNORR AND ALEXI IMPROVEMENT

Oded Goldreich, B. Chor, 2002 .

Biological Networks: Comparison, Conservation, and Evolutionary Trees (Extended Abstract)

B. Chor, T. Tuller, 2006 .

Solvability in Asynchronous Environments (Extended Abstract)

Benny Chor, Lior Moscovici, B. Chor, 1989, IEEE Annual Symposium on Foundations of Computer Science.

An application of number theory to the organization of raster-graphics memory

Ronald L. Rivest, Charles E. Leiserson, Benny Chor, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

A High Quartet Distance Construction

B. Chor, P. Erdős, Yonatan Komornik, 2019, Annals of Combinatorics.

A High Quartet Distance Construction

B. Chor, P. Erdős, Yonatan Komornik, 2019, Annals of Combinatorics.

A High Quartets Distance Construction

B. Chor, P. ErdHos, Yonatan Komornik, 2016, 1606.02641.

Tight lower bounds for certain parameterized NP-hard problems

Ge Xia, Jianer Chen, Xiuzhen Huang, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Representative Selection in Nonmetric Datasets

Peter Stone, Elad Liebman, Benny Chor, 2015, Appl. Artif. Intell..

Finding a maximum likelihood tree is hard

Tamir Tuller, Benny Chor, B. Chor, 2006, JACM.

Private Information Retrieval by Keywords

Moni Naor, Niv Gilboa, Benny Chor, 1998, IACR Cryptol. ePrint Arch..

Simple constant-time consensus protocols in realistic failure models (extended abstract)

B. Chor, D. Shmoys, Michael Merritt, 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields

Ronald L. Rivest, Benny Chor, R. Rivest, 1984, CRYPTO.

Private information retrieval

Eyal Kushilevitz, Oded Goldreich, Madhu Sudan, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Privacy, additional information, and communication

Reuven Bar-Yehuda, Eyal Kushilevitz, Benny Chor, 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

A zero-one law for Boolean privacy

Eyal Kushilevitz, Benny Chor, B. Chor, 1989, STOC '89.

Forbidden penta‐peptides

Tamir Tuller, Benny Chor, Nathan Nelson, 2007, Protein science : a publication of the Protein Society.

Approximate Maximum Parsimony and Ancestral Maximum Likelihood

Noga Alon, Benny Chor, Fabio Pardi, 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Analytic solutions for three taxon ML trees with variable rates across sites

Michael D. Hendy, Benny Chor, David Penny, 2007, Discret. Appl. Math..

Maximum Likelihood Molecular Clock Comb: Analytic Solutions

Sagi Snir, Benny Chor, Amit Khetan, 2006, J. Comput. Biol..

Maximum Likelihood of Evolutionary Trees Is Hard

Tamir Tuller, Benny Chor, B. Chor, 2005, RECOMB.

Maximum likelihood of evolutionary trees: hardness and approximation

Tamir Tuller, Benny Chor, B. Chor, 2005, ISMB.

Maximum likelihood on four taxa phylogenetic trees: analytic solutions

Sagi Snir, Benny Chor, Amit Khetan, 2003, RECOMB '03.

Multiple maxima of likelihood in phylogenetic trees: an analytic approach

Barbara R. Holland, Michael D. Hendy, Benny Chor, 2000, RECOMB '00.

CRISPR Detection from Short Reads Using Partial Overlap Graphs

Benny Chor, Ilan Ben-Bassat, B. Chor, 2015, RECOMB.

Unbiased bits from sources of weak randomness and probabilistic communication complexity

Oded Goldreich, Benny Chor, Oded Goldreich, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

The effective application of a discrete transition model to explore cell-cycle regulation in yeast

Benny Chor, Amir Rubinstein, B. Chor, 2013, BMC Research Notes.

Using Restriction Enzymes to Improve Sequencing by Hybridization

Sagi Snir, Zohar Yakhini, Benny Chor, 2002 .

Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data

Zohar Yakhini, Benny Chor, Shay Ben-Elazar, 2016, Bioinform..

A Geometric Approach to Betweenness

Madhu Sudan, Benny Chor, B. Chor, 1995, ESA.

Discovering local structure in gene expression data: the order-preserving submatrix problem

Richard M. Karp, Zohar Yakhini, Benny Chor, 2002, RECOMB '02.

On Constructing Radiation Hybrid Maps

Benny Chor, Amir Ben-Dor, B. Chor, 1997, J. Comput. Biol..

The Average Common Substring Approach to Phylogenomic Reconstruction

David Burstein, Tamir Tuller, Benny Chor, 2006, J. Comput. Biol..

Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships

Dan Pelleg, Dan Graur, Ron Ophir, 1998, J. Comput. Biol..

Tight lower bounds for certain parameterized NP-hard problems

Ge Xia, Jianer Chen, Xiuzhen Huang, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure

Oded Goldreich, Benny Chor, Oded Goldreich, 1985, CRYPTO.

Tracing traitors

Amos Fiat, Moni Naor, Benny Pinkas, 2000, IEEE Trans. Inf. Theory.

Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network

Daniel A. Chamovitz, Benny Chor, Osnat Atias, 2009, BMC Systems Biology.

RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure

Oded Goldreich, Claus-Peter Schnorr, Benny Chor, 1984, FOCS.

Computational Thinking in Life Science Education

Benny Chor, Amir Rubinstein, B. Chor, 2014, PLoS Comput. Biol..

String graph construction using incremental hashing

Benny Chor, Ilan Ben-Bassat, B. Chor, 2014, Bioinform..

Achieving independence in logarithmic number of rounds

Michael O. Rabin, Benny Chor, M. Rabin, 1987, PODC '87.

On the number of ordered factorizations of natural numbers

Benny Chor, Paul Lemke, Ziv Mador, 2000, Discret. Math..

Inter-chromosomal k-mer distances

B. Chor, D. Horn, Alon Kafri, 2021, BMC genomics.

A deep neural network approach for learning intrinsic protein‐RNA binding preferences

Benny Chor, Yaron Orenstein, Ilan Ben-Bassat, 2018, Bioinform..

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard

Alessandro Panconesi, Michael T. Hallett, Todd Wareham, 2003, WABI.

Simple constant-time consensus protocols in realistic failure models

David B. Shmoys, Michael Merritt, Benny Chor, 1989, JACM.

Solvability in Asynchronous Environments II: Finite Interactive Tasks

Benny Chor, Lee-Bath Nelson, B. Chor, 1999, SIAM J. Comput..

Solvability in asynchronous environments

Benny Chor, Lior Moscovici, B. Chor, 1989, 30th Annual Symposium on Foundations of Computer Science.

The bit extraction problem or t-resilient functions

Oded Goldreich, Johan Håstad, Roman Smolensky, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Communication in key distribution schemes

Amos Beimel, Benny Chor, B. Chor, 1996, IEEE Trans. Inf. Theory.

Teaching Computer Science in the Community

Assaf Zaritsky, Benny Chor, B. Chor, 2016, ICDCIT.

Secret sharing over infinite domains

Eyal Kushilevitz, Benny Chor, B. Chor, 1993, Journal of Cryptology.

A Communication-Privacy Tradeoff for Modular Addition

Eyal Kushilevitz, Benny Chor, B. Chor, 1993, Inf. Process. Lett..

An application of number theory to the organization of raster-graphics memory

Ronald L. Rivest, James B. Shearer, Charles E. Leiserson, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps

Michael R. Fellows, Benny Chor, David W. Juedes, 2004, WG.

On the power of two-point based sampling

Oded Goldreich, Benny Chor, Oded Goldreich, 1989, J. Complex..

On the theory of average case complexity

O. Goldreich, M. Luby, S. Ben-David, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

Computationally private information retrieval (extended abstract)

Niv Gilboa, Benny Chor, B. Chor, 1997, STOC '97.

Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites

Michael D. Hendy, Benny Chor, David Penny, 2001, WABI.

A Deep Learning Approach for Learning Intrinsic Protein-RNA Binding Preferences

Benny Chor, Yaron Orenstein, Ilan Ben-Bassat, 2018, bioRxiv.

Inversion symmetry of DNA k-mer counts: validity and deviations

B. Chor, D. Horn, Sagi Shporer, 2016, BMC Genomics.

Connected Coloring Completion for General Graphs: Algorithms and Complexity

Michael R. Fellows, Sagi Snir, Mark A. Ragan, 2007, COCOON.

From Quartets to Phylogenetic Trees

Benny Chor, B. Chor, 1998, SOFSEM.

An improved parallel algorithm for integer GCD

Oded Goldreich, Benny Chor, Oded Goldreich, 1990, Algorithmica.

Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences

B. Chor, Eyal Cohen, 2012, J. Comput. Biol..

A knapsack-type public key cryptosystem based on arithmetic in finite fields

Ronald L. Rivest, Benny Chor, R. Rivest, 1988, IEEE Trans. Inf. Theory.

Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds

Daniel A. Chamovitz, Tamir Tuller, Benny Chor, 2005, WABI.

Information Theoretic Approaches to Whole Genome Phylogenies

David Burstein, Tamir Tuller, Benny Chor, 2005, RECOMB.

Secret Sharing with Public Reconstruction

Amos Beimel, Benny Chor, B. Chor, 1998, IEEE Trans. Inf. Theory.

On the Theory of Average Case Complexity (abstract)

Oded Goldreich, B. Chor, M. Luby, 1989, SCT.

Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length

Tamir Tuller, Benny Chor, B. Chor, 2007, J. Comput. Biol..