default search action
Benny Chor
בני שור
Person information
- unicode name: בני שור
- affiliation (since 2001): Tel Aviv University, Blavatnik School of Computer Science, Israel
- affiliation (1987-2001): Technion, Haifa, Israel
- affiliation (until 1987, PhD 1985): Massachusetts Institute of Technology (MIT), Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
- [j51]Ilan Ben-Bassat, Benny Chor, Yaron Orenstein
:
A deep neural network approach for learning intrinsic protein-RNA binding preferences. Bioinform. 34(17): i638-i646 (2018) - 2016
- [j50]Shay Ben-Elazar, Benny Chor, Zohar Yakhini
Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data. Bioinform. 32(17): 559-566 (2016) - [j49]Ilan Ben-Bassat, Benny Chor:
CRISPR Detection From Short Reads Using Partial Overlap Graphs. J. Comput. Biol. 23(6): 461-471 (2016) - [c51]Benny Chor, Assaf Zaritsky
Teaching Computer Science in the Community. ICDCIT 2016: 3-9 - 2015
- [j48]Elad Liebman, Benny Chor, Peter Stone:
Representative Selection in Nonmetric Datasets. Appl. Artif. Intell. 29(8): 807-838 (2015) - [c50]Ilan Ben-Bassat, Benny Chor:
CRISPR Detection from Short Reads Using Partial Overlap Graphs. RECOMB 2015: 16-27 - [i2]Elad Liebman, Benny Chor, Peter Stone:
Representative Selection in Non Metric Datasets. CoRR abs/1502.07428 (2015) - 2014
- [j47]Ilan Ben-Bassat, Benny Chor:
String graph construction using incremental hashing. Bioinform. 30(24): 3515-3523 (2014) - [j46]Amir Rubinstein, Benny Chor:
Computational Thinking in Life Science Education. PLoS Comput. Biol. 10(11) (2014) - 2013
- [j45]Benny Chor:
Preface: RECOMB 2012. J. Comput. Biol. 20(2): 63 (2013) - 2012
- [j44]Eyal Cohen, Benny Chor:
Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences. J. Comput. Biol. 19(8): 945-956 (2012) - [c49]Benny Chor, Rani Hod
CS1001.py: a topic-based introduction to computer science. ITiCSE 2012: 215-220 - [e1]Benny Chor:
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 [contents] - 2010
- [j43]Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport:
Approximate Maximum Parsimony and Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. 7(1): 183-187 (2010) - [j42]Giora Unger, Benny Chor:
Linear Separability of Gene Expression Data Sets. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 375-381 (2010) - [c48]Benny Chor, David Horn, Nick Goldman, Yaron Levy, Tim Massingham:
Genomic DNA k-mer Spectra: Models and Modalities. RECOMB 2010: 571
2000 – 2009
- 2009
- [j41]Osnat Atias
Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network. BMC Syst. Biol. 3: 86 (2009) - 2007
- [j40]Matan Gavish, Amnon Peled, Benny Chor:
Genetic code symmetry and efficient design of GC-constrained coding sequences. Bioinform. 23(2): 57-63 (2007) - [j39]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): 750-758 (2007) - [j38]Benny Chor, Tamir Tuller
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length. J. Comput. Biol. 14(6): 817-838 (2007) - [c47]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 - 2006
- [j37]Benny Chor, Tamir Tuller:
Finding a maximum likelihood tree is hard. J. ACM 53(5): 722-744 (2006) - [j36]Igor Ulitsky
The Average Common Substring Approach to Phylogenomic Reconstruction. J. Comput. Biol. 13(2): 336-350 (2006) - [j35]Benny Chor, Amit Khetan, Sagi Snir:
Maximum Likelihood Molecular Clock Comb: Analytic Solutions. J. Comput. Biol. 13(3): 819-837 (2006) - [c46]Benny Chor, Tamir Tuller:
Biological Networks: Comparison, Conservation, and Evolutionary Trees. RECOMB 2006: 30-44 - 2005
- [j34]Jianer Chen, Benny Chor, Mike Fellows
Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2): 216-231 (2005) - [c45]Benny Chor, Tamir Tuller
Maximum likelihood of evolutionary trees: hardness and approximation. ISMB (Supplement of Bioinformatics) 2005: 97-106 - [c44]David Burstein
Information Theoretic Approaches to Whole Genome Phylogenies. RECOMB 2005: 283-295 - [c43]Benny Chor, Tamir Tuller:
Maximum Likelihood of Evolutionary Trees Is Hard. RECOMB 2005: 296-310 - [c42]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 - 2004
- [j33]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2(2): 257-272 (2004) - [c41]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. CCC 2004: 150-160 - [c40]Benny Chor, Tamir Tuller:
Adding Hidden Nodes to Gene Networks (Extended Abstract). WABI 2004: 123-134 - [c39]Benny Chor, Mike Fellows, David W. Juedes
Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. WG 2004: 257-269 - 2003
- [j32]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): 373-384 (2003) - [c38]Benny Chor, Amit Khetan, Sagi Snir:
Maximum likelihood on four taxa phylogenetic trees: analytic solutions. RECOMB 2003: 76-83 - [c37]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215 - 2002
- [c36]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 - 2001
- [j31]Benny Chor, Yuval Ishai:
On Privacy and Partition Arguments. Inf. Comput. 167(1): 2-9 (2001) - [c35]Benny Chor, Michael D. Hendy, David Penny:
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites. WABI 2001: 204-213 - 2000
- [j30]Benny Chor, Paul Lemke, Ziv Mador:
On the number of ordered factorizations of natural numbers. Discret. Math. 214(1-3): 123-133 (2000) - [j29]Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas:
Tracing traitors. IEEE Trans. Inf. Theory 46(3): 893-910 (2000) - [c34]Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny:
Multiple maxima of likelihood in phylogenetic trees: an analytic approach. RECOMB 2000: 108-117
1990 – 1999
- 1999
- [j28]Benny Chor, Lee-Bath Nelson:
Solvability in Asynchronous Environments II: Finite Interactive Tasks. SIAM J. Comput. 29(2): 351-377 (1999) - 1998
- [j27]Benny Chor, Eyal Kushilevitz, Oded Goldreich
Private Information Retrieval. J. ACM 45(6): 965-981 (1998) - [j26]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): 377-390 (1998) - [j25]Benny Chor, Madhu Sudan:
A Geometric Approach to Betweenness. SIAM J. Discret. Math. 11(4): 511-523 (1998) - [j24]Amos Beimel, Benny Chor:
Secret Sharing with Public Reconstruction. IEEE Trans. Inf. Theory 44(5): 1887-1896 (1998) - [c33]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 - [c32]Benny Chor:
From Quartets to Phylogenetic Trees. SOFSEM 1998: 36-53 - [i1]Benny Chor, Niv Gilboa, Moni Naor:
Private Information Retrieval by Keywords. IACR Cryptol. ePrint Arch. 1998: 3 (1998) - 1997
- [j23]Amir Ben-Dor, Benny Chor:
On Constructing Radiation Hybrid Maps. J. Comput. Biol. 4(4): 517-533 (1997) - [c31]Amir Ben-Dor, Benny Chor:
On constructing radiation hybrid maps (extended abstract). RECOMB 1997: 17-26 - [c30]Benny Chor, Niv Gilboa:
Computationally Private Information Retrieval (Extended Abstract). STOC 1997: 304-313 - 1996
- [j22]Amos Beimel
Communication in key distribution schemes. IEEE Trans. Inf. Theory 42(1): 19-28 (1996) - [c29]Benny Chor, Yuval Ishai:
On Privacy and Partition Arguments. ISTCS 1996: 191-194 - 1995
- [j21]Benny Chor, Netta Shani:
The Privacy of Dense Symmetric Functions. Comput. Complex. 5(1): 43-59 (1995) - [j20]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz:
Private Computations over the Integers. SIAM J. Comput. 24(2): 376-386 (1995) - [c28]Amos Beimel
Secret Sharing with Public Reconstruction (Extended Abstract). CRYPTO 1995: 353-366 - [c27]Benny Chor, Madhu Sudan:
A Geometric Approach to Betweenness. ESA 1995: 227-237 - [c26]Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan:
Private Information Retrieval. FOCS 1995: 41-50 - 1994
- [j19]Richard Chang
The Random Oracle Hypothesis Is False. J. Comput. Syst. Sci. 49(1): 24-39 (1994) - [j18]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz:
On the Structure of the Privacy Hierarchy. J. Cryptol. 7(1): 53-60 (1994) - [j17]Benny Chor, Amos Israeli, Ming Li:
Wait-Free Consensus Using Asynchronous Hardware. SIAM J. Comput. 23(4): 701-712 (1994) - [j16]Amos Beimel
Universally ideal secret-sharing schemes. IEEE Trans. Inf. Theory 40(3): 786-794 (1994) - [c25]Benny Chor, Amos Fiat, Moni Naor:
Tracing Traitors. CRYPTO 1994: 257-270 - [c24]Benny Chor, Lee-Bath Nelson:
Resilience of General Interactive Tasks. PODC 1994: 173-182 - 1993
- [j15]Benny Chor, Eyal Kushilevitz:
A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45(4): 205-210 (1993) - [j14]Benny Chor, Eyal Kushilevitz:
Secret Sharing Over Infinite Domains. J. Cryptol. 6(2): 87-95 (1993) - [j13]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky:
Privacy, additional information and communication. IEEE Trans. Inf. Theory 39(6): 1930-1943 (1993) - [c23]Amos Beimel, Benny Chor:
Interaction in Key Distribution Schemes (Extended Abstract). CRYPTO 1993: 444-455 - 1992
- [j12]Shai Ben-David, Benny Chor, Oded Goldreich
On the Theory of Average Case Complexity. J. Comput. Syst. Sci. 44(2): 193-219 (1992) - [c22]Amos Beimel, Benny Chor:
Universally Ideal Secret Sharing Schemes (Preliminary Version). CRYPTO 1992: 183-195 - 1991
- [j11]Benny Chor, Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy. SIAM J. Discret. Math. 4(1): 36-47 (1991) - [c21]Benny Chor, Lee-Bath Nelson:
Resiliency of Interactive Distributed Tasks (Extended Abstract). PODC 1991: 37-49 - 1990
- [j10]Benny Chor, Oded Goldreich
An Improved Parallel Algorithm for Integer GCD. Algorithmica 5(1): 1-10 (1990) - [c20]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz:
Privacy, Additional Information, and Communication. SCT 1990: 55-65 - [c19]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz:
Private Computations Over the Integers (Extended Abstract). FOCS 1990: 335-344
1980 – 1989
- 1989
- [j9]Benny Chor, Cynthia Dwork:
Randomization in Byzantine Agreement. Adv. Comput. Res. 5: 443-497 (1989) - [j8]Benny Chor, Michael Merritt, David B. Shmoys
Simple constant-time consensus protocols in realistic failure models. J. ACM 36(3): 591-614 (1989) - [j7]Benny Chor, Oded Goldreich
On the power of two-point based sampling. J. Complex. 5(1): 96-106 (1989) - [c18]Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby:
On the Theory of Average Case Complexity (abstract). SCT 1989: 36 - [c17]Benny Chor, Eyal Kushilevitz:
Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO 1989: 299-306 - [c16]Benny Chor, Lior Moscovici:
Solvability in Asynchronous Environments (Extended Abstract). FOCS 1989: 422-427 - [c15]Benny Chor, Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy (extended abstract). STOC 1989: 62-72 - [c14]Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby:
On the Theory of Average Case Complexity. STOC 1989: 204-216 - 1988
- [j6]Werner Alexi, Benny Chor, Oded Goldreich
RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Comput. 17(2): 194-209 (1988) - [j5]Benny Chor, Oded Goldreich
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput. 17(2): 230-261 (1988) - [j4]Benny Chor, Mihály Geréb-Graus:
On the Influence of Single Participant in Coin Flipping Schemes. SIAM J. Discret. Math. 1(4): 411-415 (1988) - [j3]Benny Chor, Ronald L. Rivest:
A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theory 34(5): 901-909 (1988) - 1987
- [c13]Benny Chor, Amos Israeli, Ming Li:
On Processor Coordination Using Asynchronous Hardware. PODC 1987: 86-97 - [c12]Benny Chor, Michael O. Rabin:
Achieving Independence in Logarithmic Number of Rounds. PODC 1987: 260-268 - 1986
- [j2]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) - 1985
- [b1]Benny Chor:
Two issues in public key cryptography : RSA bit security and a new knapsack type system. MIT, USA, 1985 - [j1]Benny Chor, Brian A. Coan:
A Simple and Efficient Randomized Byzantine Agreement Algorithm. IEEE Trans. Software Eng. 11(6): 531-539 (1985) - [c11]Benny Chor, Oded Goldreich
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. CRYPTO 1985: 448-457 - [c10]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 - [c9]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 - [c8]Benny Chor, Oded Goldreich:
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract). FOCS 1985: 429-442 - [c7]Benny Chor, Michael Merritt, David B. Shmoys
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC 1985: 152-162 - 1984
- [c6]Benny Chor, Ronald L. Rivest:
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. CRYPTO 1984: 54-65 - [c5]Benny Chor, Oded Goldreich
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. CRYPTO 1984: 303-313 - [c4]Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr:
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure. FOCS 1984: 449-457 - [c3]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 - 1983
- [c2]Michael Ben-Or, Benny Chor, Adi Shamir:
On the Cryptographic Security of Single RSA Bits. STOC 1983: 421-430 - 1982
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 22:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: