Shay Mozes

1.3k total citations
35 papers, 416 citations indexed

About

Shay Mozes is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Shay Mozes has authored 35 papers receiving a total of 416 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 16 papers in Artificial Intelligence and 9 papers in Computer Networks and Communications. Recurrent topics in Shay Mozes's work include Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (13 papers) and Algorithms and Data Compression (10 papers). Shay Mozes is often cited by papers focused on Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (13 papers) and Algorithms and Data Compression (10 papers). Shay Mozes collaborates with scholars based in Israel, United States and Poland. Shay Mozes's co-authors include Oren Weimann, Philip N. Klein, Erik D. Demaine, Benjamin Rossman, Benni Reznik, Jonathan Oppenheim, Yahav Nussbaum, Daniel Nagaj, Ofer Biham and Daniel Shapira and has published in prestigious journals such as Physical Review A, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Shay Mozes

28 papers receiving 393 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Shay Mozes Israel	10	214	156	113	78	57	35	416
Ferdinando Cicalese Italy	10	213 1.0×	140 0.9×	125 1.1×	21 0.3×	27 0.5×	61	367
Aimin Pan China	9	45 0.2×	51 0.3×	165 1.5×	34 0.4×	20 0.4×	21	325
Tuğkan Batu United States	12	444 2.1×	271 1.7×	87 0.8×	9 0.1×	40 0.7×	16	552
Martin Fürer United States	13	294 1.4×	473 3.0×	201 1.8×	7 0.1×	32 0.6×	38	744
Hariharan Narayanan United States	11	126 0.6×	163 1.0×	69 0.6×	12 0.2×	17 0.3×	42	443
Bo Hong United States	15	146 0.7×	99 0.6×	393 3.5×	31 0.4×	45 0.8×	54	621
Christine Rüb Germany	6	158 0.7×	124 0.8×	158 1.4×	6 0.1×	45 0.8×	12	384
Bora Uçar France	12	96 0.4×	120 0.8×	289 2.6×	18 0.2×	23 0.4×	35	543
Danièle Gardy France	10	223 1.0×	147 0.9×	184 1.6×	5 0.1×	76 1.3×	33	586

Countries citing papers authored by Shay Mozes

Since Specialization

Citations

This map shows the geographic impact of Shay Mozes'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 Shay Mozes with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shay Mozes more than expected).

Fields of papers citing papers by Shay Mozes

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Shay Mozes. 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 Shay Mozes. The network helps show where Shay Mozes may publish in the future.

Co-authorship network of co-authors of Shay Mozes

This figure shows the co-authorship network connecting the top 25 collaborators of Shay Mozes. A scholar is included among the top collaborators of Shay Mozes 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 Shay Mozes. Shay Mozes 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

Gawrychowski, Paweł, et al.. (2023). Almost Optimal Exact Distance Oracles for Planar Graphs. Journal of the ACM. 70(2). 1–50.

Mozes, Shay, et al.. (2021). Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Gawrychowski, Paweł, et al.. (2021). An Almost Optimal Edit Distance Oracle. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20.

Kociumaka, Tomasz, et al.. (2020). Dynamic String Alignment.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 3 indexed citations

Mozes, Shay, et al.. (2019). Exact distance oracles for planar graphs with failing vertices. Symposium on Discrete Algorithms. 2110–2123. 5 indexed citations

Gawrychowski, Paweł, Shay Mozes, & Oren Weimann. (2019). Minimum Cut in $O(m\log^2 n)$ Time. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 2 indexed citations

Gawrychowski, Paweł, et al.. (2018). Near-Optimal Distance Emulator for Planar Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 1 indexed citations

Kaplan, Haim, Shay Mozes, Yahav Nussbaum, & Micha Sharir. (2017). Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Transactions on Algorithms. 13(2). 1–42. 9 indexed citations

Mozes, Shay, Yahav Nussbaum, & Oren Weimann. (2017). Faster shortest paths in dense distance graphs, with applications. Theoretical Computer Science. 711. 11–35. 2 indexed citations

10.

Mozes, Shay, et al.. (2016). Short and Simple Cycle Separators in Planar Graphs. ACM Journal of Experimental Algorithmics. 21. 1–24. 1 indexed citations

11.

Gawrychowski, Paweł, Gad M. Landau, Shay Mozes, & Oren Weimann. (2016). The Nearest Colored Node in a Tree. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

12.

Kaplan, Haim, Shay Mozes, Yahav Nussbaum, & Micha Sharir. (2012). Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. 9 indexed citations

13.

Mozes, Shay, et al.. (2010). Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes. Algorithms for Molecular Biology. 5(1). 11–11. 4 indexed citations

14.

Klein, Philip N., Shay Mozes, & Oren Weimann. (2009). Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2n)-time algorithm. Symposium on Discrete Algorithms. 236–245. 7 indexed citations

15.

Mozes, Shay, Dekel Tsur, Oren Weimann, & Michal Ziv-Ukelson. (2009). Fast algorithms for computing tree LCS. Theoretical Computer Science. 410(43). 4303–4314.

16.

Mozes, Shay, Krzysztof Onak, & Oren Weimann. (2008). Finding an optimal tree searching strategy in linear time. 1096–1105. 16 indexed citations

17.

Lifshits, Yury, Shay Mozes, Oren Weimann, & Michal Ziv-Ukelson. (2007). Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica. 54(3). 379–399. 21 indexed citations

18.

Oppenheim, Jonathan & Shay Mozes. (2005). Deterministic dense coding with partially entangled states (7 pages). Physical Review A. 71(1). 12311.

19.

Mozes, Shay, Jonathan Oppenheim, & Benni Reznik. (2005). Deterministic dense coding with partially entangled states. Physical Review A. 71(1). 53 indexed citations

20.

Shapira, Daniel, Shay Mozes, & Ofer Biham. (2003). Effect of unitary noise on Grover’s quantum search algorithm. Physical Review A. 67(4). 30 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