| Security against covert adversaries: Efficient protocols for realistic adversaries Y Aumann, Y Lindell Journal of Cryptology 23 (2), 281-343, 2010 | 519 | 2010 |
| A statistical theory for quantitative association rules Y Aumann, Y Lindell Proceedings of the fifth ACM SIGKDD international conference on Knowledge …, 1999 | 401 | 1999 |
| An O (log k) approximate min-cut max-flow theorem and approximation algorithm Y Aumann, Y Rabani SIAM Journal on Computing 27 (1), 291-301, 1998 | 338 | 1998 |
| Efficient calculation of interval scores for DNA copy number data analysis D Lipson, Y Aumann, A Ben-Dor, N Linial, Z Yakhini Journal of computational biology 13 (2), 215-228, 2006 | 173 | 2006 |
| Term-level text with mining with taxonomies R Feldman, Y Aumann, J Schler, D Landau, O Lipshtat, Y Ben-Yehuda US Patent 6,442,545, 2002 | 173 | 2002 |
| Everlasting security in the bounded storage model Y Aumann, YZ Ding, MO Rabin IEEE Transactions on Information Theory 48 (6), 1668-1680, 2002 | 172 | 2002 |
| Improved bounds for all optical routing Y Aumann, Y Rabani Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995 | 167 | 1995 |
| Knowledge management: A text mining approach R Feldman, M Fresko, H Hirsh, Y Aumann, O Liphsta, Y Schler, M Rajman Proc. the 2nd Int. Conf. on Practical Aspects of Knowledge Management …, 1998 | 158 | 1998 |
| Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. R Feldman, Y Aumann, A Amir, H Mannila DMKD, 0-, 1997 | 145 | 1997 |
| Method and system for displaying time-series data and correlated events derived from text mining D Landau, R Feldman, O Lipshatz, Y Aumann, H Shemtov US Patent 7,570,262, 2009 | 142 | 2009 |
| Pattern matching with swaps A Amir, Y Aumann, GM Landau, M Lewenstein, N Lewenstein Journal of algorithms 37 (2), 247-266, 2000 | 112 | 2000 |
| Determining trends using text mining R Feldman, Y Aumann, Y Ben-Yehuda, D Landau US Patent 6,532,469, 2003 | 105 | 2003 |
| Information theoretically secure communication in the limited storage space model Y Aumann, MO Rabin Annual International Cryptology Conference, 65-79, 1999 | 102 | 1999 |
| The efficiency of fair division with connected pieces Y Aumann, Y Dombb ACM Transactions on Economics and Computation (TEAC) 3 (4), 1-16, 2015 | 101* | 2015 |
| Authentication, enhanced security and error correcting codes Y Aumann, MO Rabin Annual International Cryptology Conference, 299-303, 1998 | 101 | 1998 |
| On the evaluation of election outcomes under uncertainty N Hazon, Y Aumann, S Kraus, M Wooldridge Artificial Intelligence 189, 1-18, 2012 | 100 | 2012 |
| Borders: An efficient algorithm for association generation in dynamic databases Y Aumann, R Feldman, O Lipshtat, H Manilla Journal of Intelligent Information Systems 12, 61-73, 1999 | 96 | 1999 |
| Function matching A Amir, Y Aumann, M Lewenstein, E Porat SIAM Journal on Computing 35 (5), 1007-1022, 2006 | 93* | 2006 |
| Efficient deniable authentication of long messages Y Aumann Int. Conf. on Theortical Computer Science in honour of Professor Manuel Blum …, 1998 | 91 | 1998 |
| Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. R Feldman, Y Aumann, A Amir, A Zilberstein, W Kloesgen KDD, 167-170, 1997 | 91 | 1997 |
Ronen FeldmanProfessor of Data Science, Hebrew Universityبريد إلكتروني تم التحقق منه على huji.ac.il
