Benny Chor

Affiliations:
  • Tel Aviv University, Blavatnik School of Computer Science, Israel (since 2001)
  • Technion, Haifa, Israel (1987-2001)
  • Massachusetts Institute of Technology (MIT), Cambridge, MA, USA (until 1987, PhD 1985)


According to our database1, Benny Chor authored at least 94 papers between 1982 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
A deep neural network approach for learning intrinsic protein-RNA binding preferences.
Bioinform., 2018

2016
CRISPR Detection From Short Reads Using Partial Overlap Graphs.
J. Comput. Biol., 2016

Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data.
Bioinform., 2016

Teaching Computer Science in the Community.
Proceedings of the Distributed Computing and Internet Technology, 2016

2015
Representative Selection in Non Metric Datasets.
CoRR, 2015

Representative Selection in Nonmetric Datasets.
Appl. Artif. Intell., 2015

2014
Computational Thinking in Life Science Education.
PLoS Comput. Biol., 2014

String graph construction using incremental hashing.
Bioinform., 2014

2013
Preface: RECOMB 2012.
J. Comput. Biol., 2013

2012
Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences.
J. Comput. Biol., 2012

CS1001.py: a topic-based introduction to computer science.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

2010
Linear Separability of Gene Expression Data Sets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Approximate Maximum Parsimony and Ancestral Maximum Likelihood.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Genomic DNA <i>k</i>-mer Spectra: Models and Modalities.
Proceedings of the Research in Computational Molecular Biology, 2010

2009
Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network.
BMC Syst. Biol., 2009

2007
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length.
J. Comput. Biol., 2007

Analytic solutions for three taxon ML trees with variable rates across sites.
Discret. Appl. Math., 2007

Genetic code symmetry and efficient design of GC-constrained coding sequences.
Bioinform., 2007

Connected Coloring Completion for General Graphs: Algorithms and Complexity.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
The Average Common Substring Approach to Phylogenomic Reconstruction.
J. Comput. Biol., 2006

Maximum Likelihood Molecular Clock Comb: Analytic Solutions.
J. Comput. Biol., 2006

Finding a maximum likelihood tree is hard.
J. ACM, 2006

Biological Networks: Comparison, Conservation, and Evolutionary Trees.
Proceedings of the Research in Computational Molecular Biology, 2006

2005
Tight lower bounds for certain parameterized NP-hard problems.
Inf. Comput., 2005

Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Maximum Likelihood of Evolutionary Trees Is Hard.
Proceedings of the Research in Computational Molecular Biology, 2005

Information Theoretic Approaches to Whole Genome Phylogenies.
Proceedings of the Research in Computational Molecular Biology, 2005

Maximum likelihood of evolutionary trees: hardness and approximation.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

2004
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinform. Comput. Biol., 2004

Linear Kernels in Linear Time, or How to Save k Colors in O(n<sup>2</sup>) Steps.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Adding Hidden Nodes to Gene Networks (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

2003
Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem.
J. Comput. Biol., 2003

Maximum likelihood on four taxa phylogenetic trees: analytic solutions.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

2001
On Privacy and Partition Arguments.
Inf. Comput., 2001

Analytic Solutions for Three-Taxon ML<sub>MC</sub> Trees with Variable Rates Across Sites.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

2000
Tracing traitors.
IEEE Trans. Inf. Theory, 2000

On the number of ordered factorizations of natural numbers.
Discret. Math., 2000

Multiple maxima of likelihood in phylogenetic trees: an analytic approach.
Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

1999
Solvability in Asynchronous Environments II: Finite Interactive Tasks.
SIAM J. Comput., 1999

1998
Secret Sharing with Public Reconstruction.
IEEE Trans. Inf. Theory, 1998

A Geometric Approach to Betweenness.
SIAM J. Discret. Math., 1998

Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships.
J. Comput. Biol., 1998

Private Information Retrieval.
J. ACM, 1998

Private Information Retrieval by Keywords.
IACR Cryptol. ePrint Arch., 1998

From Quartets to Phylogenetic Trees.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution.
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

1997
On Constructing Radiation Hybrid Maps.
J. Comput. Biol., 1997

Computationally Private Information Retrieval (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

On constructing radiation hybrid maps (extended abstract).
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

1996
Communication in key distribution schemes.
IEEE Trans. Inf. Theory, 1996

1995
Private Computations over the Integers.
SIAM J. Comput., 1995

The Privacy of Dense Symmetric Functions.
Comput. Complex., 1995

Secret Sharing with Public Reconstruction (Extended Abstract).
Proceedings of the Advances in Cryptology, 1995

1994
Universally ideal secret-sharing schemes.
IEEE Trans. Inf. Theory, 1994

Wait-Free Consensus Using Asynchronous Hardware.
SIAM J. Comput., 1994

On the Structure of the Privacy Hierarchy.
J. Cryptol., 1994

The Random Oracle Hypothesis Is False.
J. Comput. Syst. Sci., 1994

Resilience of General Interactive Tasks.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Tracing Traitors.
Proceedings of the Advances in Cryptology, 1994

1993
Privacy, additional information and communication.
IEEE Trans. Inf. Theory, 1993

Secret Sharing Over Infinite Domains.
J. Cryptol., 1993

A Communication-Privacy Tradeoff for Modular Addition.
Inf. Process. Lett., 1993

Interaction in Key Distribution Schemes (Extended Abstract).
Proceedings of the Advances in Cryptology, 1993

1992
On the Theory of Average Case Complexity.
J. Comput. Syst. Sci., 1992

Universally Ideal Secret Sharing Schemes (Preliminary Version).
Proceedings of the Advances in Cryptology, 1992

1991
A Zero-One Law for Boolean Privacy.
SIAM J. Discret. Math., 1991

Resiliency of Interactive Distributed Tasks (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
An Improved Parallel Algorithm for Integer GCD.
Algorithmica, 1990

Private Computations Over the Integers (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Privacy, Additional Information, and Communication.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989
On the power of two-point based sampling.
J. Complex., 1989

Simple constant-time consensus protocols in realistic failure models.
J. ACM, 1989

Randomization in Byzantine Agreement.
Adv. Comput. Res., 1989

A Zero-One Law for Boolean Privacy (extended abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Solvability in Asynchronous Environments (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Secret Sharing Over Infinite Domains (Extended Abstract).
Proceedings of the Advances in Cryptology, 1989

On the Theory of Average Case Complexity (abstract).
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
A knapsack-type public key cryptosystem based on arithmetic in finite fields.
IEEE Trans. Inf. Theory, 1988

On the Influence of Single Participant in Coin Flipping Schemes.
SIAM J. Discret. Math., 1988

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity.
SIAM J. Comput., 1988

RSA and Rabin Functions: Certain Parts are as Hard as the Whole.
SIAM J. Comput., 1988

1987
Achieving Independence in Logarithmic Number of Rounds.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

On Processor Coordination Using Asynchronous Hardware.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986
An application of number theory to the organization of raster-graphics memory.
J. ACM, 1986

1985
A Simple and Efficient Randomized Byzantine Agreement Algorithm.
IEEE Trans. Software Eng., 1985

Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

The Bit Security of Modular Squaring Given Partial Factorization of the Modulos.
Proceedings of the Advances in Cryptology, 1985

1984
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure.
Proceedings of the Advances in Cryptology, 1984

1983
On the Cryptographic Security of Single RSA Bits
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982


  Loading...