| 2016 | ICDCIT | Teaching Computer Science in the Community. | Benny Chor, Assaf Zaritsky |
| 2015 | RECOMB | CRISPR Detection from Short Reads Using Partial Overlap Graphs. | Ilan Ben-Bassat, Benny Chor |
| 2012 | ITiCSE | CS1001.py: a topic-based introduction to computer science. | Benny Chor, Rani Hod |
| 2010 | RECOMB | Genomic DNA | Benny Chor, David Horn, Nick Goldman, Yaron Levy, Tim Massingham |
| 2007 | COCOON | Connected Coloring Completion for General Graphs: Algorithms and Complexity. | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
| 2006 | RECOMB | Biological Networks: Comparison, Conservation, and Evolutionary Trees. | Benny Chor, Tamir Tuller |
| 2005 | ISMB | Maximum likelihood of evolutionary trees: hardness and approximation. | Benny Chor, Tamir Tuller |
| 2005 | RECOMB | Information Theoretic Approaches to Whole Genome Phylogenies. | David Burstein, Igor Ulitsky, Tamir Tuller, Benny Chor |
| 2005 | RECOMB | Maximum Likelihood of Evolutionary Trees Is Hard. | Benny Chor, Tamir Tuller |
| 2005 | WABI | Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds. | Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. Chamovitz, Benny Chor |
| 2004 | WABI | Adding Hidden Nodes to Gene Networks (Extended Abstract). | Benny Chor, Tamir Tuller |
| 2004 | WG | Linear Kernels in Linear Time, or How to Save k Colors in O(n | Benny Chor, Mike Fellows, David W. Juedes |
| 2003 | RECOMB | Maximum likelihood on four taxa phylogenetic trees: analytic solutions. | Benny Chor, Amit Khetan, Sagi Snir |
| 2003 | WABI | Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. | Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham |
| 2002 | RECOMB | Discovering local structure in gene expression data: the order-preserving submatrix problem. | Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini |
| 2001 | WABI | Analytic Solutions for Three-Taxon ML | Benny Chor, Michael D. Hendy, David Penny |
| 2000 | RECOMB | Multiple maxima of likelihood in phylogenetic trees: an analytic approach. | Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny |
| 1998 | RECOMB | From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. | Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg |
| 1998 | SOFSEM | From Quartets to Phylogenetic Trees. | Benny Chor |
| 1997 | RECOMB | On constructing radiation hybrid maps (extended abstract). | Amir Ben-Dor, Benny Chor |
| 1997 | STOC | Computationally Private Information Retrieval (Extended Abstract). | Benny Chor, Niv Gilboa |
| 1995 | CRYPTO | Secret Sharing with Public Reconstruction (Extended Abstract). | Amos Beimel, Benny Chor |
| 1995 | ESA | A Geometric Approach to Betweenness. | Benny Chor, Madhu Sudan |
| 1995 | FOCS | Private Information Retrieval. | Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan |
| 1994 | CRYPTO | Tracing Traitors. | Benny Chor, Amos Fiat, Moni Naor |
| 1994 | PODC | Resilience of General Interactive Tasks. | Benny Chor, Lee-Bath Nelson |
| 1993 | CRYPTO | Interaction in Key Distribution Schemes (Extended Abstract). | Amos Beimel, Benny Chor |
| 1992 | CRYPTO | Universally Ideal Secret Sharing Schemes (Preliminary Version). | Amos Beimel, Benny Chor |
| 1991 | PODC | Resiliency of Interactive Distributed Tasks (Extended Abstract). | Benny Chor, Lee-Bath Nelson |
| 1990 | FOCS | Private Computations Over the Integers (Extended Abstract) | Benny Chor, Mihly Gerb-Graus, Eyal Kushilevitz |
| 1989 | CRYPTO | Secret Sharing Over Infinite Domains (Extended Abstract). | Benny Chor, Eyal Kushilevitz |
| 1989 | FOCS | Solvability in Asynchronous Environments (Extended Abstract) | Benny Chor, Lior Moscovici |
| 1989 | STOC | On the Theory of Average Case Complexity | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby |
| 1989 | STOC | A Zero-One Law for Boolean Privacy (extended abstract) | Benny Chor, Eyal Kushilevitz |
| 1987 | PODC | On Processor Coordination Using Asynchronous Hardware. | Benny Chor, Amos Israeli, Ming Li |
| 1987 | PODC | Achieving Independence in Logarithmic Number of Rounds. | Benny Chor, Michael O. Rabin |
| 1985 | CRYPTO | The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. | Benny Chor, Oded Goldreich, Shafi Goldwasser |
| 1985 | FOCS | Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) | Benny Chor, Oded Goldreich |
| 1985 | FOCS | The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) | Benny Chor, Oded Goldreich, Johan Hstad, Joel Friedman, Steven Rudich, Roman Smolensky |
| 1985 | FOCS | Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) | Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch |
| 1985 | PODC | Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). | Benny Chor, Michael Merritt, David B. Shmoys |
| 1984 | CRYPTO | A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. | Benny Chor, Ronald L. Rivest |
| 1984 | CRYPTO | RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. | Benny Chor, Oded Goldreich |
| 1984 | FOCS | RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure | Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr |
| 1984 | SRDS | A Simple and Efficient Randomized Byzantine Agreement Algorithm. | Benny Chor, Brian A. Coan |
| 1983 | STOC | On the Cryptographic Security of Single RSA Bits | Michael Ben-Or, Benny Chor, Adi Shamir |
| 1982 | FOCS | An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) | Benny Chor, Charles E. Leiserson, Ronald L. Rivest |