Shlomo Hoory

2.7k total citations · 1 hit paper
31 papers, 1.2k citations indexed

About

Shlomo Hoory is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Shlomo Hoory has authored 31 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Discrete Mathematics and Combinatorics, 12 papers in Computational Theory and Mathematics and 9 papers in Artificial Intelligence. Recurrent topics in Shlomo Hoory's work include Limits and Structures in Graph Theory (9 papers), Graph Labeling and Dimension Problems (4 papers) and graph theory and CDMA systems (4 papers). Shlomo Hoory is often cited by papers focused on Limits and Structures in Graph Theory (9 papers), Graph Labeling and Dimension Problems (4 papers) and graph theory and CDMA systems (4 papers). Shlomo Hoory collaborates with scholars based in Israel, Canada and United States. Shlomo Hoory's co-authors include Nathan Linial, Avi Wigderson, Ilan Alon, U. Feldman, Avner Magen, Omer Angel, Joel Friedman, B. S. Fraenkel, Yonatan Bilu and Toniann Pitassi and has published in prestigious journals such as Nature, The Astrophysical Journal and Transactions of the American Mathematical Society.

In The Last Decade

Shlomo Hoory

30 papers receiving 1.1k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Expander graphs and their applications

2006 780 citations Shlomo Hoory, Nathan Linial et al. Bulletin of the American Mathematical Society profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Shlomo Hoory Israel	13	505	319	313	300	274	31	1.2k
Graham Brightwell United Kingdom	19	638 1.3×	184 0.6×	269 0.9×	228 0.8×	368 1.3×	90	1.4k
Steven Roman United States	18	442 0.9×	123 0.4×	309 1.0×	332 1.1×	539 2.0×	41	2.0k
Alexander Barvinok United States	20	632 1.3×	107 0.3×	289 0.9×	278 0.9×	375 1.4×	63	1.5k
René Schott France	17	202 0.4×	186 0.6×	217 0.7×	135 0.5×	110 0.4×	124	1.1k
Jeong Han Kim United States	19	616 1.2×	181 0.6×	210 0.7×	222 0.7×	477 1.7×	80	1.4k
Nikhil Srivastava United States	13	415 0.8×	187 0.6×	355 1.1×	169 0.6×	69 0.3×	34	1.1k
József Beck United States	21	590 1.2×	80 0.3×	168 0.5×	217 0.7×	392 1.4×	67	1.4k
Ivan Niven United States	18	526 1.0×	148 0.5×	375 1.2×	593 2.0×	321 1.2×	66	2.2k
Howard Rumsey United States	14	224 0.4×	171 0.5×	394 1.3×	284 0.9×	401 1.5×	32	1.2k
G. H. Hardy United States	6	224 0.4×	68 0.2×	211 0.7×	345 1.1×	203 0.7×	16	1.3k

Countries citing papers authored by Shlomo Hoory

Since Specialization

Citations

This map shows the geographic impact of Shlomo Hoory's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Shlomo Hoory with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shlomo Hoory more than expected).

Fields of papers citing papers by Shlomo Hoory

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Shlomo Hoory. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Shlomo Hoory. The network helps show where Shlomo Hoory may publish in the future.

Co-authorship network of co-authors of Shlomo Hoory

This figure shows the co-authorship network connecting the top 25 collaborators of Shlomo Hoory. A scholar is included among the top collaborators of Shlomo Hoory based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Shlomo Hoory. Shlomo Hoory is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hoory, Shlomo, Amir Feder, Avichai Tendler, et al.. (2021). Learning and Evaluating a Differentially Private Pre-trained Language Model. 1178–1189. 22 indexed citations

Angel, Omer, Joel Friedman, & Shlomo Hoory. (2014). The non-backtracking spectrum of the universal cover of a graph. Transactions of the American Mathematical Society. 367(6). 4287–4318. 39 indexed citations

Gamburd, Alex, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, & Bálint Virág. (2009). On the girth of random Cayley graphs. Random Structures and Algorithms. 35(1). 100–117. 14 indexed citations

Yom‐Tov, Elad, et al.. (2008). Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections. 144. 307–316. 1 indexed citations

Galesi, Nicola, et al.. (2006). . Theory of Computing. 2(1). 65–90. 24 indexed citations

Hoory, Shlomo, Nathan Linial, & Avi Wigderson. (2006). Expander graphs and their applications. Bulletin of the American Mathematical Society. 43(4). 439–561. 780 indexed citations breakdown →

Hoory, Shlomo & Stefan Szeider. (2006). A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM Journal on Discrete Mathematics. 20(2). 523–528. 11 indexed citations

Hoory, Shlomo & Stefan Szeider. (2005). Computing unsatisfiablek-SAT instances with few occurrences per variable. Theoretical Computer Science. 337(1-3). 347–359. 9 indexed citations

Hoory, Shlomo & Nathan Linial. (2005). A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex. Journal of Combinatorial Theory Series B. 95(2). 346–349. 7 indexed citations

10.

Hoory, Shlomo, Avner Magen, Steven Myers, & Charles Rackoff. (2005). Simple permutations mix well. Theoretical Computer Science. 348(2-3). 251–261. 14 indexed citations

11.

Hoory, Shlomo. (2005). A lower bound on the spectral radius of the universal cover of a graph. Journal of Combinatorial Theory Series B. 93(1). 33–43. 12 indexed citations

12.

Hoory, Shlomo & Nathan Linial. (2004). Colorings of the d-regular infinite tree. Journal of Combinatorial Theory Series B. 91(2). 161–167. 1 indexed citations

13.

Galesi, Nicola, et al.. (2003). Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.. 318–327.

14.

Bilu, Yonatan & Shlomo Hoory. (2003). On codes from hypergraphs. European Journal of Combinatorics. 25(3). 339–354. 19 indexed citations

15.

Hoory, Shlomo. (2002). The Size of Bipartite Graphs with a Given Girth. Journal of Combinatorial Theory Series B. 86(2). 215–220. 30 indexed citations

16.

Hoory, Shlomo, et al.. (2002). A Continuous Analogue of the Girth Problem. Journal of Combinatorial Theory Series B. 84(2). 340–363. 2 indexed citations

17.

Hoory, Shlomo & Avi Wigderson. (1993). Universal traversal sequences for expander graphs. Information Processing Letters. 46(2). 67–69. 17 indexed citations

18.

Hoory, Shlomo, S. Goldsmith, U. Feldman, W. E. Behring, & L. Cohen. (1971). Boron-Like Spectra: Mg viii, Al ix, and Si x. Journal of the Optical Society of America. 61(4). 504–504. 10 indexed citations

19.

Feldman, U., B. S. Fraenkel, & Shlomo Hoory. (1965). Identification of Solar Ultraviolet Lines Resulting from a Study of the AR i and K i Isolelctronic Sequences.. The Astrophysical Journal. 142. 719–719. 10 indexed citations

20.

Alexander, E., U. Feldman, B. S. Fraenkel, & Shlomo Hoory. (1965). 3p6–3p53d Transitions of Fe IX and Ni XI in the Solar Spectrum. Nature. 206(4980). 176–176. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact