| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benny Chor (eds.) |
Research in Computational Molecular Biology - 16th Annual International Conference, RECOMB 2012, Barcelona, Spain, April 21-24, 2012. Proceedings  |
RECOMB  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport |
Approximate Maximum Parsimony and Ancestral Maximum Likelihood. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Giora Unger, Benny Chor |
Linear Separability of Gene Expression Data Sets. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, David Horn, Nick Goldman, Yaron Levy, Tim Massingham |
Genomic DNA k-mer Spectra: Models and Modalities. |
RECOMB |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matan Gavish, Amnon Peled, Benny Chor |
Genetic code symmetry and efficient design of GC-constrained coding sequences. |
Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Tamir Tuller |
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length. |
Journal of Computational Biology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael D. Hendy, David Penny |
Analytic solutions for three taxon ML trees with variable rates across sites. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Topics Algorithms and Complexity, Bioinformatics |
| 1 | Benny Chor, Amit Khetan, Sagi Snir |
Maximum Likelihood Molecular Clock Comb: Analytic Solutions. |
Journal of Computational Biology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Ulitsky, David Burstein, Tamir Tuller, Benny Chor |
The Average Common Substring Approach to Phylogenomic Reconstruction. |
Journal of Computational Biology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Tamir Tuller |
Finding a maximum likelihood tree is hard. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
approximate vertex cover, tree reconstruction, Maximum likelihood, maximum parsimony, intractability |
| 1 | Benny Chor, Tamir Tuller |
Biological Networks: Comparison, Conservation, and Evolutionary Trees. |
RECOMB |
2006 |
DBLP DOI BibTeX RDF |
tree reconstruction, relative description length, Conserved regions, networks’ comparison, compression, metabolic networks, Biological networks, network evolution |
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Tamir Tuller |
Maximum likelihood of evolutionary trees: hardness and approximation. |
ISMB (Supplement of Bioinformatics) |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David Burstein, Igor Ulitsky, Tamir Tuller, Benny Chor |
Information Theoretic Approaches to Whole Genome Phylogenies. |
RECOMB |
2005 |
DBLP DOI BibTeX RDF |
Phylogenomics, whole genome and proteom phylogenetic, tree reconstruction, Kullback-Leibler relative entropy, divergence, distance matrix |
| 1 | Benny Chor, Tamir Tuller |
Maximum Likelihood of Evolutionary Trees Is Hard. |
RECOMB |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham |
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. |
J. Bioinformatics and Computational Biology |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Mike Fellows, David W. Juedes |
Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Tamir Tuller |
Adding Hidden Nodes to Gene Networks (Extended Abstract). |
WABI |
2004 |
DBLP DOI BibTeX RDF |
network expansion, Bayesian networks, compression, maximum likelihood, minimum description length, EM, gene network |
| 1 | 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. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini |
Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. |
Journal of Computational Biology |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham |
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Amit Khetan, Sagi Snir |
Maximum likelihood on four taxa phylogenetic trees: analytic solutions. |
RECOMB |
2003 |
DBLP DOI BibTeX RDF |
2-state model, Hadamard conjugation, molecular clock, symbolic algebra, constrained optimization, maximum likelihood, phylogenetic trees, saturation, Groebner bases |
| 1 | Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini |
Discovering local structure in gene expression data: the order-preserving submatrix problem. |
RECOMB |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Yuval Ishai |
On Privacy and Partition Arguments. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael D. Hendy, David Penny |
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites. |
WABI |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Paul Lemke, Ziv Mador |
On the number of ordered factorizations of natural numbers. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas |
Tracing traitors. |
IEEE Transactions on Information Theory |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny |
Multiple maxima of likelihood in phylogenetic trees: an analytic approach. |
RECOMB |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Lee-Bath Nelson |
Solvability in Asynchronous Environments II: Finite Interactive Tasks. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg |
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships. |
Journal of Computational Biology |
1998 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan |
Private Information Retrieval. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Madhu Sudan |
A Geometric Approach to Betweenness. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Benny Chor |
Secret Sharing with Public Reconstruction. |
IEEE Transactions on Information Theory |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor |
From Quartets to Phylogenetic Trees. |
SOFSEM |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Ben-Dor, Benny Chor |
On Constructing Radiation Hybrid Maps. |
Journal of Computational Biology |
1997 |
DBLP BibTeX RDF |
|
| 1 | Amir Ben-Dor, Benny Chor |
On constructing radiation hybrid maps (extended abstract). |
RECOMB |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Niv Gilboa |
Computationally Private Information Retrieval (Extended Abstract). |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Benny Chor |
Communication in key distribution schemes. |
IEEE Transactions on Information Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Yuval Ishai |
On Privacy and Partition Arguments. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Netta Shani |
The Privacy of Dense Symmetric Functions. |
Computational Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz |
Private Computations over the Integers. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Madhu Sudan |
A Geometric Approach to Betweenness. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Benny Chor |
Secret Sharing with Public Reconstruction (Extended Abstract). |
CRYPTO |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan |
Private Information Retrieval. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
replicated copies, information retrieval, privacy, replication, communication complexity, communication complexity, database theory, replicated databases |
| 1 | Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz |
On the Structure of the Privacy Hierarchy. |
J. Cryptology |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Amos Israeli, Ming Li |
Wait-Free Consensus Using Asynchronous Hardware. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Benny Chor |
Universally ideal secret-sharing schemes. |
IEEE Transactions on Information Theory |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Lee-Bath Nelson |
Resilience of General Interactive Tasks. |
PODC |
1994 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Amos Fiat, Moni Naor |
Tracing Traitors. |
CRYPTO |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz |
A Communication-Privacy Tradeoff for Modular Addition. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz |
Secret Sharing Over Infinite Domains. |
J. Cryptology |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky |
Privacy, additional information and communication. |
IEEE Transactions on Information Theory |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Benny Chor |
Interaction in Key Distribution Schemes (Extended Abstract). |
CRYPTO |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby |
On the Theory of Average Case Complexity. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Benny Chor |
Universally Ideal Secret Sharing Schemes (Preliminary Version). |
CRYPTO |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz |
A Zero-One Law for Boolean Privacy. |
SIAM J. Discrete Math. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Lee-Bath Nelson |
Resiliency of Interactive Distributed Tasks (Extended Abstract). |
PODC |
1991 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich |
An Improved Parallel Algorithm for Integer GCD. |
Algorithmica |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz |
Private Computations Over the Integers (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
countable domains, private distributed computations, t-private Boolean functions, finite domains |
| 1 | Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz |
Privacy, Additional Information, and Communication. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich |
On the power of two-point based sampling. |
J. Complexity |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael Merritt, David B. Shmoys |
Simple constant-time consensus protocols in realistic failure models. |
J. ACM |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz |
Secret Sharing Over Infinite Domains (Extended Abstract). |
CRYPTO |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Lior Moscovici |
Solvability in Asynchronous Environments (Extended Abstract) |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
membership characterization, asynchronous environments, combinatorial conditions, distributed decision tasks, computational complexity |
| 1 | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby |
On the Theory of Average Case Complexity (abstract). |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby |
On the Theory of Average Case Complexity |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Eyal Kushilevitz |
A Zero-One Law for Boolean Privacy (extended abstract) |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Mihály Geréb-Graus |
On the Influence of Single Participant in Coin Flipping Schemes. |
SIAM J. Discrete Math. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich |
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr |
RSA and Rabin Functions: Certain Parts are as Hard as the Whole. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Ronald L. Rivest |
A knapsack-type public key cryptosystem based on arithmetic in finite fields. |
IEEE Transactions on Information Theory |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Amos Israeli, Ming Li |
On Processor Coordination Using Asynchronous Hardware. |
PODC |
1987 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Michael O. Rabin |
Achieving Independence in Logarithmic Number of Rounds. |
PODC |
1987 |
DBLP BibTeX RDF |
|
| 1 | 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 |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Brian A. Coan |
A Simple and Efficient Randomized Byzantine Agreement Algorithm. |
IEEE Trans. Software Eng. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael Merritt, David B. Shmoys |
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). |
PODC |
1985 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich, Shafi Goldwasser |
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. |
CRYPTO |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch |
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich |
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Brian A. Coan |
A Simple and Efficient Randomized Byzantine Agreement Algorithm. |
Symposium on Reliability in Distributed Software and Database Systems |
1984 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Ronald L. Rivest |
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. |
CRYPTO |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Oded Goldreich |
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. |
CRYPTO |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr |
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Ben-Or, Benny Chor, Adi Shamir |
On the Cryptographic Security of Single RSA Bits |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Charles E. Leiserson, Ronald L. Rivest |
An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) |
FOCS |
1982 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")