| Private information retrieval B Chor, E Kushilevitz, O Goldreich, M Sudan Journal of the ACM (JACM) 45 (6), 965-981, 1998 | 3600 | 1998 |
| Verifiable secret sharing and achieving simultaneity in the presence of faults B Chor, S Goldwasser, S Micali, B Awerbuch 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 383-395, 1985 | 1460 | 1985 |
| Tracing traitors B Chor, A Fiat, M Naor Annual international cryptology conference, 257-270, 1994 | 1005 | 1994 |
| Discovering local structure in gene expression data: the order-preserving submatrix problem A Ben-Dor, B Chor, R Karp, Z Yakhini Proceedings of the sixth annual international conference on Computational …, 2002 | 955 | 2002 |
| Unbiased bits from sources of weak randomness and probabilistic communication complexity B Chor, O Goldreich SIAM Journal on Computing 17 (2), 230-261, 1988 | 848 | 1988 |
| The bit extraction problem or t-resilient functions B Chor, O Goldreich, J Hasted, J Freidmann, S Rudich, R Smolensky 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 396-407, 1985 | 572 | 1985 |
| RSA and Rabin functions: Certain parts are as hard as the whole W Alexi, B Chor, O Goldreich, CP Schnorr SIAM Journal on Computing 17 (2), 194-209, 1988 | 542 | 1988 |
| A knapsack-type public key cryptosystem based on arithmetic in finite fields B Chor, RL Rivest IEEE Transactions on Information Theory 34 (5), 901-909, 1988 | 490 | 1988 |
| Computationally private information retrieval B Chor, N Gilboa Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 456 | 1997 |
| Tracing traitors B Chor, A Fiat, M Naor, B Pinkas IEEE Transactions on Information Theory 46 (3), 893-910, 2002 | 389 | 2002 |
| Private information retrieval by keywords B Chor, N Gilboa, M Naor Technion-IIT, Department of Computer Science, 1997 | 342 | 1997 |
| On the theory of average case complexity S Ben-David, B Chor, O Goldreich Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 336 | 1989 |
| Genomic DNA k-mer spectra: models and modalities B Chor, D Horn, N Goldman, Y Levy, T Massingham Genome biology 10 (10), R108, 2009 | 304 | 2009 |
| A zero-one law for boolean privacy B Chor, E Kushilevitz Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 274 | 1989 |
| On the power of two-point based sampling B Chor, O Goldreich Journal of Complexity 5 (1), 96-106, 1989 | 272 | 1989 |
| Tight lower bounds for certain parameterized NP-hard problems J Chen, B Chor, M Fellows, X Huang, D Juedes, IA Kanj, G Xia Information and Computation 201 (2), 216-231, 2005 | 271 | 2005 |
| The average common substring approach to phylogenomic reconstruction I Ulitsky, D Burstein, T Tuller, B Chor Journal of Computational Biology 13 (2), 336-350, 2006 | 243 | 2006 |
| Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps B Chor, M Fellows, D Juedes International workshop on graph-theoretic concepts in computer science, 257-269, 2004 | 178 | 2004 |
| Randomization in byzantine agreement B Chor Randomness and Computation, 1989 | 170 | 1989 |
| Universally ideal secret-sharing schemes A Beimel, B Chor IEEE Transactions on Information Theory 40 (3), 786-794, 2002 | 169* | 2002 |
Eyal KushilevitzComputer Science Department, TechnionVerified email at cs.technion.ac.il
