| Expander graphs and their applications S Hoory, N Linial, A Wigderson Bulletin of the American Mathematical Society 43 (4), 439-561, 2006 | 2220 | 2006 |
| The Moore bound for irregular graphs N Alon, S Hoory, N Linial Graphs and Combinatorics 18, 53-57, 2002 | 227 | 2002 |
| Rank bounds and integrality gaps for cutting planes procedures J Buresh-Oppenheim, N Galesi, S Hoory, A Magen, T Pitassi 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 111 | 2003 |
| The non-backtracking spectrum of the universal cover of a graph O Angel, J Friedman, S Hoory Transactions of the American Mathematical Society 367 (6), 4287-4318, 2015 | 101 | 2015 |
| The size of bipartite graphs with a given girth S Hoory Journal of Combinatorial Theory, Series B 86 (2), 215-220, 2002 | 85 | 2002 |
| On the girth of random Cayley graphs A Gamburd, S Hoory, M Shahshahani, A Shalev, B Virág Random Structures & Algorithms 35 (1), 100-117, 2009 | 60 | 2009 |
| Learning and evaluating a differentially private pre-trained language model S Hoory, A Feder, A Tendler, S Erell, A Peled-Cohen, I Laish, H Nakhost, ... Findings of the Association for Computational Linguistics: EMNLP 2021, 1178-1189, 2021 | 57 | 2021 |
| Linear-time reductions of resolution proofs O Bar-Ilan, O Fuhrmann, S Hoory, O Shacham, O Strichman Hardware and Software: Verification and Testing: 4th International Haifa …, 2009 | 44 | 2009 |
| Computing unsatisfiable k-SAT instances with few occurrences per variable S Hoory, S Szeider Theoretical Computer Science 337 (1-3), 347-359, 2005 | 44 | 2005 |
| Customization scenarios for de-identification of clinical notes T Hartman, MD Howell, J Dean, S Hoory, R Slyper, I Laish, O Gilon, ... BMC medical informatics and decision making 20, 1-9, 2020 | 39 | 2020 |
| Universal traversal sequences for expander graphs S Hoory, A Wigderson Inf. Process. Lett. 46 (2), 67-69, 1993 | 36 | 1993 |
| On codes from hypergraphs Y Bilu, S Hoory European Journal of Combinatorics 25 (3), 339-354, 2004 | 34 | 2004 |
| A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable S Hoory, S Szeider SIAM Journal on Discrete Mathematics 20 (2), 523-528, 2006 | 32 | 2006 |
| A lower bound on the spectral radius of the universal cover of a graph S Hoory Journal of Combinatorial Theory, Series B 93 (1), 33-43, 2005 | 32 | 2005 |
| Monotone circuits for the majority function S Hoory, A Magen, T Pitassi International Workshop on Approximation Algorithms for Combinatorial …, 2006 | 29 | 2006 |
| Simple permutations mix even better A Brodsky, S Hoory Random Structures & Algorithms 32 (3), 274-289, 2008 | 27 | 2008 |
| System and method for registration of fluoroscopic images in a coordinate system of a medical system U Eichler, Y Vaknin, A Izmirli, S Hoory US Patent 10,546,396, 2020 | 23 | 2020 |
| Maximum matchings in regular graphs of high girth AD Flaxman, S Hoory the electronic journal of combinatorics, N1-N1, 2007 | 23 | 2007 |
| Simple permutations mix well S Hoory, A Magen, S Myers, C Rackoff Theoretical computer science 348 (2-3), 251-261, 2005 | 21 | 2005 |
| Automatically solving a truck configuration problem B Dubrov, Y Naveh, S Hoory, A Steinhoff, U Twisselmann US Patent App. 12/720,693, 2011 | 17 | 2011 |
