Uri Stav
Impact in
-
- Limits and Structures in Graph Theory
-
- Cooperative Communication and Network Coding
- Caching and Content Delivery
Papers in
-
- Cooperative Communication and Network Coding 4
- Error Correcting Code Techniques 3
- Optimization and Search Problems 1
-
- Advanced Graph Theory Research 5
- Complexity and Algorithms in Graphs 2
- Co-authors
- Eyal Lubetzky (4 shared papers)Noga Alon (6 shared papers)Avinatan Hassidim (1 shared paper)A. Shapira (1 shared paper)
- Journals
- Theoretical Computer Science (1 paper)Journal of Combinatorial Theory Series B (1 paper)Journal of Graph Theory (1 paper)SIAM Journal on Discrete Mathematics (1 paper)Combinatorics Probability Computing (1 paper)
- Partner nations
- IsraelUnited States
In The Last Decade
Uri Stav
10 papers receiving 305 citations
Peers
Comparison fields: 5 of 28
- Discrete Mathematics and Combinatorics 39
- Computer Networks and Communications 221
- Computational Theory and Mathematics 81
- Electrical and Electronic Engineering 183
- Geometry and Topology 18
Countries citing papers authored by Uri Stav
This map shows the geographic impact of Uri Stav'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 Uri Stav with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Uri Stav more than expected).
Fields of papers citing papers by Uri Stav
This network shows the impact of papers produced by Uri Stav. 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 Uri Stav. The network helps show where Uri Stav may publish in the future.
Co-authors
The 4 scholars most cited alongside Uri Stav, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 105 | |
| 2 | 2009 | 80 | |
| 3 | 2007 | 69 | |
| 4 | 2004 | 23 | |
| 5 | 2007 | 18 | |
| 6 | 2008 | 12 | |
| 7 | 2009 | 10 | |
| 8 | 2009 | 5 | |
| 9 | 2009 | 2 | |
| 10 | 2007 | 1 |
About Uri Stav
Uri Stav is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 10 papers that have together received 325 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (5 papers), Cooperative Communication and Network Coding (4 papers), Limits and Structures in Graph Theory (4 papers), Wireless Communication Security Techniques (4 papers), Error Correcting Code Techniques (3 papers), Complexity and Algorithms in Graphs (2 papers), Graph theory and applications (2 papers) and Optimization and Search Problems (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (39 citations), Computer Networks and Communications (221 citations), Computational Theory and Mathematics (81 citations), Electrical and Electronic Engineering (183 citations) and Geometry and Topology (18 citations). Uri Stav has collaborated with scholars based in Israel and United States. Frequent co-authors include Eyal Lubetzky, Noga Alon, Avinatan Hassidim and A. Shapira. Their work appears in journals such as Theoretical Computer Science, Journal of Combinatorial Theory Series B, Journal of Graph Theory, SIAM Journal on Discrete Mathematics and Combinatorics Probability Computing.
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.