Shay Mozes
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 20
- Advanced Graph Theory Research 13
-
- Algorithms and Data Compression 10
- Cryptography and Data Security 4
- Quantum Computing Algorithms and Architecture 3
- Co-authors
- Oren Weimann (17 shared papers)Philip N. Klein (6 shared papers)Erik D. Demaine (1 shared paper)Benjamin Rossman (1 shared paper)Jonathan Oppenheim (2 shared papers)Benni Reznik (1 shared paper)Yahav Nussbaum (5 shared papers)Daniel Nagaj (1 shared paper)
- Journals
- ACM Transactions on Algorithms (5 papers)Theoretical Computer Science (3 papers)Physical Review A (3 papers)Journal of the ACM (1 paper)Algorithmica (1 paper)
- Partner nations
- IsraelUnited StatesPoland
In The Last Decade
Shay Mozes
28 papers receiving 393 citations
Peers
Comparison fields: 5 of 58
- Computer Graphics and Computer-Aided Design 43
- Computational Theory and Mathematics 156
- Artificial Intelligence 214
- Signal Processing 57
- Computer Networks and Communications 113
Countries citing papers authored by Shay Mozes
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
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-authors
The 25 scholars most cited alongside Shay Mozes, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 35 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 105 | |
| 2 | 2005 | 53 | |
| 3 | 2010 | 45 | |
| 4 | 2003 | 30 | |
| 5 | 2011 | 23 | |
| 6 | 2007 | 21 | |
| 7 | 2007 | 21 | |
| 8 | 2017 | 21 | |
| 9 | 2013 | 19 | |
| 10 | Finding an optimal tree searching strategy in linear time | 2008 | 16 |
| 11 | 2017 | 9 | |
| 12 | 2012 | 9 | |
| 13 | 2009 | 7 | |
| 14 | 2019 | 5 | |
| 15 | 2015 | 5 | |
| 16 | 2010 | 4 | |
| 17 | 2009 | 4 | |
| 18 | 2020 | 3 | |
| 19 | 2022 | 3 | |
| 20 | 2021 | 2 |
About Shay Mozes
Shay Mozes is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Computer Graphics and Computer-Aided Design and Molecular Biology, having authored 35 papers that have together received 416 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (20 papers), Advanced Graph Theory Research (13 papers), Algorithms and Data Compression (10 papers), Computational Geometry and Mesh Generation (9 papers), Optimization and Search Problems (6 papers), Cryptography and Data Security (4 papers), VLSI and FPGA Design Techniques (3 papers) and Quantum Computing Algorithms and Architecture (3 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (43 citations), Computational Theory and Mathematics (156 citations), Artificial Intelligence (214 citations), Signal Processing (57 citations) and Computer Networks and Communications (113 citations). Shay Mozes has collaborated with scholars based in Israel, United States and Poland. Frequent co-authors include Oren Weimann, Philip N. Klein, Erik D. Demaine, Benjamin Rossman, Jonathan Oppenheim, Benni Reznik, Yahav Nussbaum, Daniel Nagaj, Daniel Shapira and Ofer Biham. Their work appears in journals such as ACM Transactions on Algorithms, Theoretical Computer Science, Physical Review A, Journal of the ACM and Algorithmica.
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.