Benny Chor - RankMe

106 papers A* 25A 2B 14C 4Misc 2Journal 53Unranked 5

Year	Rank	Type	Title / Venue / Authors
2018	J	`jnl`	A deep neural network approach for learning intrinsic protein-RNA binding preferences. Bioinform. Ilan Ben-Bassat, Benny Chor, Yaron Orenstein
2016	J	`jnl`	CRISPR Detection From Short Reads Using Partial Overlap Graphs. J. Comput. Biol. Ilan Ben-Bassat, Benny Chor
2016	J	`jnl`	Extending partial haplotypes to full genome haplotypes using chromosome conformation capture data. Bioinform. Shay Ben-Elazar, Benny Chor, Zohar Yakhini
2016	Misc	`conf`	Teaching Computer Science in the Community. ICDCIT Benny Chor, Assaf Zaritsky
2015	B	`conf`	CRISPR Detection from Short Reads Using Partial Overlap Graphs. RECOMB Ilan Ben-Bassat, Benny Chor
2015	J	`jnl`	Representative Selection in Non Metric Datasets. CoRR Elad Liebman, Benny Chor, Peter Stone
2015	J	`jnl`	Representative Selection in Nonmetric Datasets. Appl. Artif. Intell. Elad Liebman, Benny Chor, Peter Stone
2014	J	`jnl`	Computational Thinking in Life Science Education. PLoS Comput. Biol. Amir Rubinstein, Benny Chor
2014	J	`jnl`	String graph construction using incremental hashing. Bioinform. Ilan Ben-Bassat, Benny Chor
2013	J	`jnl`	Preface: RECOMB 2012. J. Comput. Biol. Benny Chor
2012	B	`conf`	CS1001.py: a topic-based introduction to computer science. ITiCSE Benny Chor, Rani Hod
2012	J	`jnl`	Detecting Phylogenetic Signals in Eukaryotic Whole Genome Sequences. J. Comput. Biol. Eyal Cohen, Benny Chor
2012	B	`ed.`	Research in Computational Molecular Biology - 16th Annual International Conference, RECOMB 2012, Barcelona, Spain, April 21-24, 2012. Proceedings RECOMB Benny Chor
2010	J	`jnl`	Approximate Maximum Parsimony and Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
2010	B	`conf`	Genomic DNA RECOMB Benny Chor, David Horn, Nick Goldman, Yaron Levy, Tim Massingham
2010	J	`jnl`	Linear Separability of Gene Expression Data Sets. IEEE ACM Trans. Comput. Biol. Bioinform. Giora Unger, Benny Chor
2009	J	`jnl`	Large-scale analysis of Arabidopsis transcription reveals a basal co-regulation network. BMC Syst. Biol. Osnat Atias, Benny Chor, Daniel A. Chamovitz
2007	J	`jnl`	Analytic solutions for three taxon ML trees with variable rates across sites. Discret. Appl. Math. Benny Chor, Michael D. Hendy, David Penny
2007	J	`jnl`	Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length. J. Comput. Biol. Benny Chor, Tamir Tuller
2007	Misc	`conf`	Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
2007	J	`jnl`	Genetic code symmetry and efficient design of GC-constrained coding sequences. Bioinform. Matan Gavish, Amnon Peled, Benny Chor
2006	B	`conf`	Biological Networks: Comparison, Conservation, and Evolutionary Trees. RECOMB Benny Chor, Tamir Tuller
2006	J	`jnl`	Finding a maximum likelihood tree is hard. J. ACM Benny Chor, Tamir Tuller
2006	J	`jnl`	Maximum Likelihood Molecular Clock Comb: Analytic Solutions. J. Comput. Biol. Benny Chor, Amit Khetan, Sagi Snir
2006	J	`jnl`	The Average Common Substring Approach to Phylogenomic Reconstruction. J. Comput. Biol. Igor Ulitsky, David Burstein, Tamir Tuller, Benny Chor
2005	B	`conf`	Information Theoretic Approaches to Whole Genome Phylogenies. RECOMB David Burstein, Igor Ulitsky, Tamir Tuller, Benny Chor
2005	B	`conf`	Maximum Likelihood of Evolutionary Trees Is Hard. RECOMB Benny Chor, Tamir Tuller
2005	—	`conf`	Maximum likelihood of evolutionary trees: hardness and approximation. ISMB (Supplement of Bioinformatics) Benny Chor, Tamir Tuller
2005	J	`jnl`	Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2005	C	`conf`	Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds. WABI Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. Chamovitz, Benny Chor
2004	C	`conf`	Adding Hidden Nodes to Gene Networks (Extended Abstract). WABI Benny Chor, Tamir Tuller
2004	J	`jnl`	Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
2004	B	`conf`	Linear Kernels in Linear Time, or How to Save k Colors in O(n WG Benny Chor, Mike Fellows, David W. Juedes
2004	A	`conf`	Tight Lower Bounds for Certain Parameterized NP-Hard Problems. CCC Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2003	C	`conf`	Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
2003	J	`jnl`	Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. J. Comput. Biol. Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
2003	B	`conf`	Maximum likelihood on four taxa phylogenetic trees: analytic solutions. RECOMB Benny Chor, Amit Khetan, Sagi Snir
2002	B	`conf`	Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
2001	C	`conf`	Analytic Solutions for Three-Taxon ML WABI Benny Chor, Michael D. Hendy, David Penny
2001	J	`jnl`	On Privacy and Partition Arguments. Inf. Comput. Benny Chor, Yuval Ishai
2000	B	`conf`	Multiple maxima of likelihood in phylogenetic trees: an analytic approach. RECOMB Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny
2000	J	`jnl`	On the number of ordered factorizations of natural numbers. Discret. Math. Benny Chor, Paul Lemke, Ziv Mador
2000	J	`jnl`	Tracing traitors. IEEE Trans. Inf. Theory Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
1999	J	`jnl`	Solvability in Asynchronous Environments II: Finite Interactive Tasks. SIAM J. Comput. Benny Chor, Lee-Bath Nelson
1998	J	`jnl`	A Geometric Approach to Betweenness. SIAM J. Discret. Math. Benny Chor, Madhu Sudan
1998	J	`jnl`	Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships. J. Comput. Biol. Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
1998	B	`conf`	From Quartets to Phylogenetic Trees. SOFSEM Benny Chor
1998	B	`conf`	From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. RECOMB Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
1998	J	`jnl`	Private Information Retrieval by Keywords. IACR Cryptol. ePrint Arch. Benny Chor, Niv Gilboa, Moni Naor
1998	J	`jnl`	Private Information Retrieval. J. ACM Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan
1998	J	`jnl`	Secret Sharing with Public Reconstruction. IEEE Trans. Inf. Theory Amos Beimel, Benny Chor
1997	A*	`conf`	Computationally Private Information Retrieval (Extended Abstract). STOC Benny Chor, Niv Gilboa
1997	J	`jnl`	On Constructing Radiation Hybrid Maps. J. Comput. Biol. Amir Ben-Dor, Benny Chor
1997	B	`conf`	On constructing radiation hybrid maps (extended abstract). RECOMB Amir Ben-Dor, Benny Chor
1996	J	`jnl`	Communication in key distribution schemes. IEEE Trans. Inf. Theory Amos Beimel, Benny Chor
1996	—	`conf`	On Privacy and Partition Arguments. ISTCS Benny Chor, Yuval Ishai
1995	A	`conf`	A Geometric Approach to Betweenness. ESA Benny Chor, Madhu Sudan
1995	J	`jnl`	Private Computations over the Integers. SIAM J. Comput. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
1995	A*	`conf`	Private Information Retrieval. FOCS Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
1995	A*	`conf`	Secret Sharing with Public Reconstruction (Extended Abstract). CRYPTO Amos Beimel, Benny Chor
1995	J	`jnl`	The Privacy of Dense Symmetric Functions. Comput. Complex. Benny Chor, Netta Shani
1994	J	`jnl`	On the Structure of the Privacy Hierarchy. J. Cryptol. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
1994	A*	`conf`	Resilience of General Interactive Tasks. PODC Benny Chor, Lee-Bath Nelson
1994	J	`jnl`	The Random Oracle Hypothesis Is False. J. Comput. Syst. Sci. Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
1994	A*	`conf`	Tracing Traitors. CRYPTO Benny Chor, Amos Fiat, Moni Naor
1994	J	`jnl`	Universally ideal secret-sharing schemes. IEEE Trans. Inf. Theory Amos Beimel, Benny Chor
1994	J	`jnl`	Wait-Free Consensus Using Asynchronous Hardware. SIAM J. Comput. Benny Chor, Amos Israeli, Ming Li
1993	J	`jnl`	A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. Benny Chor, Eyal Kushilevitz
1993	A*	`conf`	Interaction in Key Distribution Schemes (Extended Abstract). CRYPTO Amos Beimel, Benny Chor
1993	J	`jnl`	Privacy, additional information and communication. IEEE Trans. Inf. Theory Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
1993	J	`jnl`	Secret Sharing Over Infinite Domains. J. Cryptol. Benny Chor, Eyal Kushilevitz
1992	J	`jnl`	On the Theory of Average Case Complexity. J. Comput. Syst. Sci. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
1992	A*	`conf`	Universally Ideal Secret Sharing Schemes (Preliminary Version). CRYPTO Amos Beimel, Benny Chor
1991	J	`jnl`	A Zero-One Law for Boolean Privacy. SIAM J. Discret. Math. Benny Chor, Eyal Kushilevitz
1991	A*	`conf`	Resiliency of Interactive Distributed Tasks (Extended Abstract). PODC Benny Chor, Lee-Bath Nelson
1990	J	`jnl`	An Improved Parallel Algorithm for Integer GCD. Algorithmica Benny Chor, Oded Goldreich
1990	—	`conf`	Privacy, Additional Information, and Communication. SCT Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz
1990	A*	`conf`	Private Computations Over the Integers (Extended Abstract) FOCS Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
1989	A*	`conf`	A Zero-One Law for Boolean Privacy (extended abstract) STOC Benny Chor, Eyal Kushilevitz
1989	A*	`conf`	On the Theory of Average Case Complexity STOC Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
1989	—	`conf`	On the Theory of Average Case Complexity (abstract). SCT Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
1989	J	`jnl`	On the power of two-point based sampling. J. Complex. Benny Chor, Oded Goldreich
1989	J	`jnl`	Randomization in Byzantine Agreement. Adv. Comput. Res. Benny Chor, Cynthia Dwork
1989	A*	`conf`	Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO Benny Chor, Eyal Kushilevitz
1989	J	`jnl`	Simple constant-time consensus protocols in realistic failure models. J. ACM Benny Chor, Michael Merritt, David B. Shmoys
1989	A*	`conf`	Solvability in Asynchronous Environments (Extended Abstract) FOCS Benny Chor, Lior Moscovici
1988	J	`jnl`	A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theory Benny Chor, Ronald L. Rivest
1988	J	`jnl`	On the Influence of Single Participant in Coin Flipping Schemes. SIAM J. Discret. Math. Benny Chor, Mihály Geréb-Graus
1988	J	`jnl`	RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Comput. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
1988	J	`jnl`	Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput. Benny Chor, Oded Goldreich
1987	A*	`conf`	Achieving Independence in Logarithmic Number of Rounds. PODC Benny Chor, Michael O. Rabin
1987	A*	`conf`	On Processor Coordination Using Asynchronous Hardware. PODC Benny Chor, Amos Israeli, Ming Li
1986	J	`jnl`	An application of number theory to the organization of raster-graphics memory. J. ACM Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer
1985	J	`jnl`	A Simple and Efficient Randomized Byzantine Agreement Algorithm. IEEE Trans. Software Eng. Benny Chor, Brian A. Coan
1985	A*	`conf`	Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC Benny Chor, Michael Merritt, David B. Shmoys
1985	A*	`conf`	The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) FOCS Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
1985	A*	`conf`	The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. CRYPTO Benny Chor, Oded Goldreich, Shafi Goldwasser
1985	—	`—`	Two issues in public key cryptography : RSA bit security and a new knapsack type system Benny Chor
1985	A*	`conf`	Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) FOCS Benny Chor, Oded Goldreich
1985	A*	`conf`	Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) FOCS Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch
1984	A*	`conf`	A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. CRYPTO Benny Chor, Ronald L. Rivest
1984	—	`conf`	A Simple and Efficient Randomized Byzantine Agreement Algorithm. Symposium on Reliability in Distributed Software and Database Systems Benny Chor, Brian A. Coan
1984	A*	`conf`	RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure FOCS Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
1984	A*	`conf`	RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. CRYPTO Benny Chor, Oded Goldreich
1983	A*	`conf`	On the Cryptographic Security of Single RSA Bits STOC Michael Ben-Or, Benny Chor, Adi Shamir
1982	A*	`conf`	An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) FOCS Benny Chor, Charles E. Leiserson, Ronald L. Rivest