Uzi Vishkin
About
In The Last Decade
Uzi Vishkin
158 papers receiving 5.2k citations
Peers
Comparison fields: 5 of 88
- Artificial Intelligence 2.7k
- Computational Theory and Mathematics 2.7k
- Computer Networks and Communications 2.5k
- Hardware and Architecture 1.8k
- Molecular Biology 831
Countries citing papers authored by Uzi Vishkin
This map shows the geographic impact of Uzi Vishkin'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 Uzi Vishkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Uzi Vishkin more than expected).
Fields of papers citing papers by Uzi Vishkin
This network shows the impact of papers produced by Uzi Vishkin. 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 Uzi Vishkin. The network helps show where Uzi Vishkin may publish in the future.
Co-authorship network of co-authors of Uzi Vishkin
This figure shows the co-authorship network connecting the top 25 collaborators of Uzi Vishkin. A scholar is included among the top collaborators of Uzi Vishkin 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 Uzi Vishkin. Uzi Vishkin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 78 | |
| 2 | Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (Extended Abstract) | 9 |
| 3 | 1 | |
| 4 | On a Parallel-Algorithms Method for String Matching Problems. | 1 |
| 5 | 11 | |
| 6 | 48 | |
| 7 | Structural parallel algorithmics | 0 |
| 8 | 13 | |
| 9 | Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) | 0 |
| 10 | 36 | |
| 11 | 12 | |
| 12 | 5 | |
| 13 | 92 | |
| 14 | 75 | |
| 15 | 15 | |
| 16 | Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) | 25 |
| 17 | 32 | |
| 18 | 10 | |
| 19 | Granularity of Memory in Parallel Computation. | 1 |
| 20 | Parallel Dictionaries in 2-3 Trees | 6 |
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.