| 2007 |
|---|
| 86 | EE | 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 |
| 85 | EE | Matan Gavish,
Amnon Peled,
Benny Chor:
Genetic code symmetry and efficient design of GC-constrained coding sequences.
Bioinformatics 23(2): 57-63 (2007) |
| 84 | EE | Benny Chor,
Michael D. Hendy,
David Penny:
Analytic solutions for three taxon ML trees with variable rates across sites.
Discrete Applied Mathematics 155(6-7): 750-758 (2007) |
| 83 | EE | Benny Chor,
Tamir Tuller:
Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length.
Journal of Computational Biology 14(6): 817-838 (2007) |
| 2006 |
|---|
| 82 | EE | Benny Chor,
Tamir Tuller:
Biological Networks: Comparison, Conservation, and Evolutionary Trees.
RECOMB 2006: 30-44 |
| 81 | EE | Benny Chor,
Tamir Tuller:
Finding a maximum likelihood tree is hard.
J. ACM 53(5): 722-744 (2006) |
| 80 | EE | Igor Ulitsky,
David Burstein,
Tamir Tuller,
Benny Chor:
The Average Common Substring Approach to Phylogenomic Reconstruction.
Journal of Computational Biology 13(2): 336-350 (2006) |
| 79 | EE | Benny Chor,
Amit Khetan,
Sagi Snir:
Maximum Likelihood Molecular Clock Comb: Analytic Solutions.
Journal of Computational Biology 13(3): 819-837 (2006) |
| 2005 |
|---|
| 78 | EE | Benny Chor,
Tamir Tuller:
Maximum likelihood of evolutionary trees: hardness and approximation.
ISMB (Supplement of Bioinformatics) 2005: 97-106 |
| 77 | EE | David Burstein,
Igor Ulitsky,
Tamir Tuller,
Benny Chor:
Information Theoretic Approaches to Whole Genome Phylogenies.
RECOMB 2005: 283-295 |
| 76 | EE | Benny Chor,
Tamir Tuller:
Maximum Likelihood of Evolutionary Trees Is Hard.
RECOMB 2005: 296-310 |
| 75 | EE | 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 |
| 74 | EE | 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): 216-231 (2005) |
| 2004 |
|---|
| 73 | EE | 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: 150-160 |
| 72 | EE | Benny Chor,
Tamir Tuller:
Adding Hidden Nodes to Gene Networks (Extended Abstract).
WABI 2004: 123-134 |
| 71 | EE | 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 |
| 70 | EE | 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 2(2): 257-272 (2004) |
| 2003 |
|---|
| 69 | EE | Benny Chor,
Amit Khetan,
Sagi Snir:
Maximum likelihood on four taxa phylogenetic trees: analytic solutions.
RECOMB 2003: 76-83 |
| 68 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
WABI 2003: 202-215 |
| 67 | EE | 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 10(3/4): 373-384 (2003) |
| 2002 |
|---|
| 66 | EE | 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 |
|---|
| 65 | EE | Benny Chor,
Michael D. Hendy,
David Penny:
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites.
WABI 2001: 204-213 |
| 64 | | Benny Chor,
Yuval Ishai:
On Privacy and Partition Arguments.
Inf. Comput. 167(1): 2-9 (2001) |
| 2000 |
|---|
| 63 | EE | Benny Chor,
Michael D. Hendy,
Barbara R. Holland,
David Penny:
Multiple maxima of likelihood in phylogenetic trees: an analytic approach.
RECOMB 2000: 108-117 |
| 62 | EE | Benny Chor,
Paul Lemke,
Ziv Mador:
On the number of ordered factorizations of natural numbers.
Discrete Mathematics 214(1-3): 123-133 (2000) |
| 61 | | Benny Chor,
Amos Fiat,
Moni Naor,
Benny Pinkas:
Tracing traitors.
IEEE Transactions on Information Theory 46(3): 893-910 (2000) |
| 1999 |
|---|
| 60 | | Benny Chor,
Lee-Bath Nelson:
Solvability in Asynchronous Environments II: Finite Interactive Tasks.
SIAM J. Comput. 29(2): 351-377 (1999) |
| 1998 |
|---|
| 59 | EE | 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 |
| 58 | EE | Benny Chor:
From Quartets to Phylogenetic Trees.
SOFSEM 1998: 36-53 |
| 57 | | Amos Beimel,
Benny Chor:
Secret Sharing with Public Reconstruction.
IEEE Transactions on Information Theory 44(5): 1887-1896 (1998) |
| 56 | EE | Benny Chor,
Eyal Kushilevitz,
Oded Goldreich,
Madhu Sudan:
Private Information Retrieval.
J. ACM 45(6): 965-981 (1998) |
| 55 | | Amir Ben-Dor,
Benny Chor,
Dan Graur,
Ron Ophir,
Dan Pelleg:
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships.
Journal of Computational Biology 5(3): 377-390 (1998) |
| 54 | EE | Benny Chor,
Madhu Sudan:
A Geometric Approach to Betweenness.
SIAM J. Discrete Math. 11(4): 511-523 (1998) |
| 1997 |
|---|
| 53 | EE | Amir Ben-Dor,
Benny Chor:
On constructing radiation hybrid maps (extended abstract).
RECOMB 1997: 17-26 |
| 52 | EE | Benny Chor,
Niv Gilboa:
Computationally Private Information Retrieval (Extended Abstract).
STOC 1997: 304-313 |
| 51 | | Amir Ben-Dor,
Benny Chor:
On Constructing Radiation Hybrid Maps.
Journal of Computational Biology 4(4): 517-534 (1997) |
| 1996 |
|---|
| 50 | | Benny Chor,
Yuval Ishai:
On Privacy and Partition Arguments.
ISTCS 1996: 191-194 |
| 49 | | Amos Beimel,
Benny Chor:
Communication in key distribution schemes.
IEEE Transactions on Information Theory 42(1): 19-28 (1996) |
| 1995 |
|---|
| 48 | EE | Amos Beimel,
Benny Chor:
Secret Sharing with Public Reconstruction (Extended Abstract).
CRYPTO 1995: 353-366 |
| 47 | | Benny Chor,
Madhu Sudan:
A Geometric Approach to Betweenness.
ESA 1995: 227-237 |
| 46 | | Benny Chor,
Oded Goldreich,
Eyal Kushilevitz,
Madhu Sudan:
Private Information Retrieval.
FOCS 1995: 41-50 |
| 45 | | Benny Chor,
Netta Shani:
The Privacy of Dense Symmetric Functions.
Computational Complexity 5(1): 43-59 (1995) |
| 44 | | Benny Chor,
Mihály Geréb-Graus,
Eyal Kushilevitz:
Private Computations over the Integers.
SIAM J. Comput. 24(2): 376-386 (1995) |
| 1994 |
|---|
| 43 | EE | Benny Chor,
Amos Fiat,
Moni Naor:
Tracing Traitors.
CRYPTO 1994: 257-270 |
| 42 | | Benny Chor,
Lee-Bath Nelson:
Resilience of General Interactive Tasks.
PODC 1994: 173-182 |
| 41 | | Amos Beimel,
Benny Chor:
Universally ideal secret-sharing schemes.
IEEE Transactions on Information Theory 40(3): 786-794 (1994) |
| 40 | | 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): 24-39 (1994) |
| 39 | | Benny Chor,
Mihály Geréb-Graus,
Eyal Kushilevitz:
On the Structure of the Privacy Hierarchy.
J. Cryptology 7(1): 53-60 (1994) |
| 38 | | Benny Chor,
Amos Israeli,
Ming Li:
Wait-Free Consensus Using Asynchronous Hardware.
SIAM J. Comput. 23(4): 701-712 (1994) |
| 1993 |
|---|
| 37 | EE | Amos Beimel,
Benny Chor:
Interaction in Key Distribution Schemes (Extended Abstract).
CRYPTO 1993: 444-455 |
| 36 | | Reuven Bar-Yehuda,
Benny Chor,
Eyal Kushilevitz,
Alon Orlitsky:
Privacy, additional information and communication.
IEEE Transactions on Information Theory 39(6): 1930-1943 (1993) |
| 35 | | Benny Chor,
Eyal Kushilevitz:
A Communication-Privacy Tradeoff for Modular Addition.
Inf. Process. Lett. 45(4): 205-210 (1993) |
| 34 | | Benny Chor,
Eyal Kushilevitz:
Secret Sharing Over Infinite Domains.
J. Cryptology 6(2): 87-95 (1993) |
| 1992 |
|---|
| 33 | EE | Amos Beimel,
Benny Chor:
Universally Ideal Secret Sharing Schemes (Preliminary Version).
CRYPTO 1992: 183-195 |
| 32 | | Shai Ben-David,
Benny Chor,
Oded Goldreich,
Michael Luby:
On the Theory of Average Case Complexity.
J. Comput. Syst. Sci. 44(2): 193-219 (1992) |
| 1991 |
|---|
| 31 | | Benny Chor,
Lee-Bath Nelson:
Resiliency of Interactive Distributed Tasks (Extended Abstract).
PODC 1991: 37-49 |
| 30 | | Benny Chor,
Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy.
SIAM J. Discrete Math. 4(1): 36-47 (1991) |
| 1990 |
|---|
| 29 | | Benny Chor,
Mihály Geréb-Graus,
Eyal Kushilevitz:
Private Computations Over the Integers (Extended Abstract)
FOCS 1990: 335-344 |
| 28 | | Reuven Bar-Yehuda,
Benny Chor,
Eyal Kushilevitz:
Privacy, Additional Information, and Communication.
Structure in Complexity Theory Conference 1990: 55-65 |
| 27 | | Benny Chor,
Oded Goldreich:
An Improved Parallel Algorithm for Integer GCD.
Algorithmica 5(1): 1-10 (1990) |
| 1989 |
|---|
| 26 | EE | Benny Chor,
Eyal Kushilevitz:
Secret Sharing Over Infinite Domains (Extended Abstract).
CRYPTO 1989: 299-306 |
| 25 | | Benny Chor,
Lior Moscovici:
Solvability in Asynchronous Environments (Extended Abstract)
FOCS 1989: 422-427 |
| 24 | | Shai Ben-David,
Benny Chor,
Oded Goldreich,
Michael Luby:
On the Theory of Average Case Complexity
STOC 1989: 204-216 |
| 23 | | Benny Chor,
Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy (extended abstract)
STOC 1989: 62-72 |
| 22 | | Shai Ben-David,
Benny Chor,
Oded Goldreich,
Michael Luby:
On the Theory of Average Case Complexity (abstract).
Structure in Complexity Theory Conference 1989: 36 |
| 21 | EE | Benny Chor,
Michael Merritt,
David B. Shmoys:
Simple constant-time consensus protocols in realistic failure models.
J. ACM 36(3): 591-614 (1989) |
| 20 | EE | Benny Chor,
Oded Goldreich:
On the power of two-point based sampling.
J. Complexity 5(1): 96-106 (1989) |
| 1988 |
|---|
| 19 | | Benny Chor,
Ronald L. Rivest:
A knapsack-type public key cryptosystem based on arithmetic in finite fields.
IEEE Transactions on Information Theory 34(5): 901-909 (1988) |
| 18 | | 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): 194-209 (1988) |
| 17 | | Benny Chor,
Oded Goldreich:
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity.
SIAM J. Comput. 17(2): 230-261 (1988) |
| 16 | | Benny Chor,
Mihály Geréb-Graus:
On the Influence of Single Participant in Coin Flipping Schemes.
SIAM J. Discrete Math. 1(4): 411-415 (1988) |
| 1987 |
|---|
| 15 | | Benny Chor,
Michael O. Rabin:
Achieving Independence in Logarithmic Number of Rounds.
PODC 1987: 260-268 |
| 14 | | Benny Chor,
Amos Israeli,
Ming Li:
On Processor Coordination Using Asynchronous Hardware.
PODC 1987: 86-97 |
| 1986 |
|---|
| 13 | EE | 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 |
|---|
| 12 | EE | Benny Chor,
Oded Goldreich,
Shafi Goldwasser:
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos.
CRYPTO 1985: 448-457 |
| 11 | | 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 |
| 10 | | 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 |
| 9 | | Benny Chor,
Oded Goldreich:
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract)
FOCS 1985: 429-442 |
| 8 | | Benny Chor,
Michael Merritt,
David B. Shmoys:
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract).
PODC 1985: 152-162 |
| 7 | | Benny Chor,
Brian A. Coan:
A Simple and Efficient Randomized Byzantine Agreement Algorithm.
IEEE Trans. Software Eng. 11(6): 531-539 (1985) |
| 1984 |
|---|
| 6 | EE | Benny Chor,
Oded Goldreich:
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure.
CRYPTO 1984: 303-313 |
| 5 | EE | Benny Chor,
Ronald L. Rivest:
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields.
CRYPTO 1984: 54-65 |
| 4 | | Werner Alexi,
Benny Chor,
Oded Goldreich,
Claus-Peter Schnorr:
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure
FOCS 1984: 449-457 |
| 3 | | 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 |
|---|
| 2 | | Michael Ben-Or,
Benny Chor,
Adi Shamir:
On the Cryptographic Security of Single RSA Bits
STOC 1983: 421-430 |
| 1982 |
|---|
| 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: 92-99 |
