Benny Chor

Publication Activity (10 Years)

Years Active: 1982-2018
Publications (10 Years): 4

Top Venues

Bioinform.

J. Comput. Biol.

CoRR

ITiCSE

Publications

Ilan Ben-Bassat, Benny Chor, Yaron Orenstein
A deep neural network approach for learning intrinsic protein-RNA binding preferences. Bioinform. 34 (17) (2018)
Benny Chor, Assaf Zaritsky
Teaching Computer Science in the Community. ICDCIT (2016)
Shay Ben-Elazar, Benny Chor, Zohar Yakhini
Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data. Bioinform. 32 (17) (2016)
Ilan Ben-Bassat, Benny Chor
CRISPR Detection From Short Reads Using Partial Overlap Graphs. J. Comput. Biol. 23 (6) (2016)
Ilan Ben-Bassat, Benny Chor
CRISPR Detection from Short Reads Using Partial Overlap Graphs. RECOMB (2015)
Elad Liebman, Benny Chor, Peter Stone
Representative Selection in Non Metric Datasets. CoRR (2015)
Elad Liebman, Benny Chor, Peter Stone
Representative Selection in Nonmetric Datasets. Appl. Artif. Intell. 29 (8) (2015)
Ilan Ben-Bassat, Benny Chor
String graph construction using incremental hashing. Bioinform. 30 (24) (2014)
Amir Rubinstein, Benny Chor
Computational Thinking in Life Science Education. PLoS Comput. Biol. 10 (11) (2014)
Benny Chor
Preface: RECOMB 2012. J. Comput. Biol. 20 (2) (2013)
Benny Chor, Rani Hod
CS1001.py: a topic-based introduction to computer science. ITiCSE (2012)
Eyal Cohen, Benny Chor
Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences. J. Comput. Biol. 19 (8) (2012)
Benny Chor, David Horn, Nick Goldman, Yaron Levy, Tim Massingham
-mer Spectra: Models and Modalities. RECOMB (2010)
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
Approximate Maximum Parsimony and Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (1) (2010)
Giora Unger, Benny Chor
Linear Separability of Gene Expression Data Sets. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (2) (2010)
Osnat Atias, Benny Chor, Daniel A. Chamovitz
Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network. BMC Syst. Biol. 3 (2009)
Matan Gavish, Amnon Peled, Benny Chor
Genetic code symmetry and efficient design of GC-constrained coding sequences. Bioinform. 23 (2) (2007)
Benny Chor, Michael D. Hendy, David Penny
Analytic solutions for three taxon ML trees with variable rates across sites. Discret. Appl. Math. 155 (6-7) (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)
Benny Chor, Tamir Tuller
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length. J. Comput. Biol. 14 (6) (2007)
Igor Ulitsky, David Burstein, Tamir Tuller, Benny Chor
The Average Common Substring Approach to Phylogenomic Reconstruction. J. Comput. Biol. 13 (2) (2006)
Benny Chor, Amit Khetan, Sagi Snir
Maximum Likelihood Molecular Clock Comb: Analytic Solutions. J. Comput. Biol. 13 (3) (2006)
Benny Chor, Tamir Tuller
Finding a maximum likelihood tree is hard. J. ACM 53 (5) (2006)
Benny Chor, Tamir Tuller
Biological Networks: Comparison, Conservation, and Evolutionary Trees. RECOMB (2006)
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)
Benny Chor, Tamir Tuller
Maximum Likelihood of Evolutionary Trees Is Hard. RECOMB (2005)
Benny Chor, Tamir Tuller
Maximum likelihood of evolutionary trees: hardness and approximation. ISMB (Supplement of Bioinformatics) (2005)
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) (2005)
David Burstein, Igor Ulitsky, Tamir Tuller, Benny Chor
Information Theoretic Approaches to Whole Genome Phylogenies. RECOMB (2005)
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. Computational Complexity Conference (2004)
Benny Chor, Mike Fellows, David W. Juedes
) Steps. WG (2004)
Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2 (2) (2004)
Benny Chor, Tamir Tuller
Adding Hidden Nodes to Gene Networks (Extended Abstract). WABI (2004)
Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI (2003)
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. J. Comput. Biol. 10 (3/4) (2003)
Benny Chor, Amit Khetan, Sagi Snir
Maximum likelihood on four taxa phylogenetic trees: analytic solutions. RECOMB (2003)
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB (2002)
Benny Chor, Michael D. Hendy, David Penny
Trees with Variable Rates Across Sites. WABI (2001)
Benny Chor, Yuval Ishai
On Privacy and Partition Arguments. Inf. Comput. 167 (1) (2001)
Benny Chor, Paul Lemke, Ziv Mador
On the number of ordered factorizations of natural numbers. Discret. Math. 214 (1-3) (2000)
Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny
Multiple maxima of likelihood in phylogenetic trees: an analytic approach. RECOMB (2000)
Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
Tracing traitors. IEEE Trans. Inf. Theory 46 (3) (2000)
Benny Chor, Lee-Bath Nelson
Solvability in Asynchronous Environments II: Finite Interactive Tasks. SIAM J. Comput. 29 (2) (1999)
Benny Chor, Niv Gilboa, Moni Naor
Private Information Retrieval by Keywords. IACR Cryptol. ePrint Arch. 1998 (1998)
Amos Beimel, Benny Chor
Secret Sharing with Public Reconstruction. IEEE Trans. Inf. Theory 44 (5) (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)
Benny Chor
From Quartets to Phylogenetic Trees. SOFSEM (1998)
Benny Chor, Madhu Sudan
A Geometric Approach to Betweenness. SIAM J. Discret. Math. 11 (4) (1998)
Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan
Private Information Retrieval. J. ACM 45 (6) (1998)
Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships. J. Comput. Biol. 5 (3) (1998)
Amir Ben-Dor, Benny Chor
On Constructing Radiation Hybrid Maps. J. Comput. Biol. 4 (4) (1997)
Amir Ben-Dor, Benny Chor
On constructing radiation hybrid maps (extended abstract). RECOMB (1997)
Benny Chor, Niv Gilboa
Computationally Private Information Retrieval (Extended Abstract). STOC (1997)
Benny Chor, Yuval Ishai
On Privacy and Partition Arguments. ISTCS (1996)
Amos Beimel, Benny Chor
Communication in key distribution schemes. IEEE Trans. Inf. Theory 42 (1) (1996)
Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
Private Information Retrieval. FOCS (1995)
Benny Chor, Netta Shani
The Privacy of Dense Symmetric Functions. Comput. Complex. 5 (1) (1995)
Benny Chor, Madhu Sudan
A Geometric Approach to Betweenness. ESA (1995)
Amos Beimel, Benny Chor
Secret Sharing with Public Reconstruction (Extended Abstract). CRYPTO (1995)
Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
Private Computations over the Integers. SIAM J. Comput. 24 (2) (1995)
Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
On the Structure of the Privacy Hierarchy. J. Cryptol. 7 (1) (1994)
Amos Beimel, Benny Chor
Universally ideal secret-sharing schemes. IEEE Trans. Inf. Theory 40 (3) (1994)
Benny Chor, Amos Israeli, Ming Li
Wait-Free Consensus Using Asynchronous Hardware. SIAM J. Comput. 23 (4) (1994)
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) (1994)
Benny Chor, Lee-Bath Nelson
Resilience of General Interactive Tasks. PODC (1994)
Benny Chor, Amos Fiat, Moni Naor
Tracing Traitors. CRYPTO (1994)
Benny Chor, Eyal Kushilevitz
Secret Sharing Over Infinite Domains. J. Cryptol. 6 (2) (1993)
Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
Privacy, additional information and communication. IEEE Trans. Inf. Theory 39 (6) (1993)
Amos Beimel, Benny Chor
Interaction in Key Distribution Schemes (Extended Abstract). CRYPTO (1993)
Benny Chor, Eyal Kushilevitz
A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45 (4) (1993)
Amos Beimel, Benny Chor
Universally Ideal Secret Sharing Schemes (Preliminary Version). CRYPTO (1992)
Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
On the Theory of Average Case Complexity. J. Comput. Syst. Sci. 44 (2) (1992)
Benny Chor, Eyal Kushilevitz
A Zero-One Law for Boolean Privacy. SIAM J. Discret. Math. 4 (1) (1991)
Benny Chor, Lee-Bath Nelson
Resiliency of Interactive Distributed Tasks (Extended Abstract). PODC (1991)
Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz
Privacy, Additional Information, and Communication. Computational Complexity Conference (1990)
Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
Private Computations Over the Integers (Extended Abstract) FOCS (1990)
Benny Chor, Oded Goldreich
An Improved Parallel Algorithm for Integer GCD. Algorithmica 5 (1) (1990)
Benny Chor, Michael Merritt, David B. Shmoys
Simple constant-time consensus protocols in realistic failure models. J. ACM 36 (3) (1989)
Benny Chor, Oded Goldreich
On the power of two-point based sampling. J. Complex. 5 (1) (1989)
Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
On the Theory of Average Case Complexity (abstract). Computational Complexity Conference (1989)
Benny Chor, Eyal Kushilevitz
Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO (1989)
Benny Chor, Lior Moscovici
Solvability in Asynchronous Environments (Extended Abstract) FOCS (1989)
Benny Chor, Cynthia Dwork
Randomization in Byzantine Agreement. Adv. Comput. Res. 5 (1989)
Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
On the Theory of Average Case Complexity STOC (1989)
Benny Chor, Eyal Kushilevitz
A Zero-One Law for Boolean Privacy (extended abstract) STOC (1989)
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) (1988)
Benny Chor, Mihály Geréb-Graus
On the Influence of Single Participant in Coin Flipping Schemes. SIAM J. Discret. Math. 1 (4) (1988)
Benny Chor, Ronald L. Rivest
A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theory 34 (5) (1988)
Benny Chor, Oded Goldreich
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput. 17 (2) (1988)
Benny Chor, Michael O. Rabin
Achieving Independence in Logarithmic Number of Rounds. PODC (1987)
Benny Chor, Amos Israeli, Ming Li
On Processor Coordination Using Asynchronous Hardware. PODC (1987)
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) (1986)
Benny Chor, Oded Goldreich, Shafi Goldwasser
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. CRYPTO (1985)
Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) FOCS (1985)
Benny Chor, Michael Merritt, David B. Shmoys
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC (1985)
Benny Chor, Oded Goldreich
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) FOCS (1985)
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)
Benny Chor, Brian A. Coan
A Simple and Efficient Randomized Byzantine Agreement Algorithm. IEEE Trans. Software Eng. 11 (6) (1985)
Benny Chor, Oded Goldreich
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. CRYPTO (1984)
Benny Chor, Ronald L. Rivest
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. CRYPTO (1984)

Benny Chor.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benny Chor