Jun Nakano
- Electrical and Electronic Engineering top 10%
- Hardware and Architecture top 2%
- Computer Networks and Communications top 10%
- Artificial Intelligence
- Computational Theory and Mathematics
- Co-authors
- Josep TorrellasBrian GreskampSmruti R. SarangiRadu TeodorescuAbhishek TiwariTakeshi TokuyamaPablo MontesinosKourosh Gharachorloo
- Topics
- Complexity and Algorithms in Graphs (3 papers)Computational Geometry and Mesh Generation (3 papers)Parallel Computing and Optimization Techniques (3 papers)
- Cited by
- Hardware and ArchitectureComputer Networks and CommunicationsElectrical and Electronic Engineering
- Partner nations
- United StatesJapan
In The Last Decade
Jun Nakano
7 papers receiving 410 citations
Peers
Comparison fields: 5 of 42
- Electrical and Electronic Engineering 342
- Hardware and Architecture 261
- Computer Networks and Communications 164
- Artificial Intelligence 22
- Computational Theory and Mathematics 19
Countries citing papers authored by Jun Nakano
This map shows the geographic impact of Jun Nakano'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 Jun Nakano with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jun Nakano more than expected).
Fields of papers citing papers by Jun Nakano
This network shows the impact of papers produced by Jun Nakano. 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 Jun Nakano. The network helps show where Jun Nakano may publish in the future.
Co-authorship network of co-authors of Jun Nakano
This figure shows the co-authorship network connecting the top 25 collaborators of Jun Nakano. A scholar is included among the top collaborators of Jun Nakano 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 Jun Nakano. Jun Nakano is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 312 | |
| 2 | 52 | |
| 3 | Techniques to address unreliability and variability of computing systems | 0 |
| 4 | 27 | |
| 5 | 11 | |
| 6 | 16 | |
| 7 | Efficient algorithms for the Hitchcock transportation problem | 4 |
| 8 | 12 |
About Jun Nakano
Jun Nakano is a scholar working on Computer Graphics and Computer-Aided Design, Hardware and Architecture and Computational Theory and Mathematics, having authored 8 papers that have together received 434 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (3 papers), Computational Geometry and Mesh Generation (3 papers) and Parallel Computing and Optimization Techniques (3 papers). The work is most often cited by research in Hardware and Architecture (261 citations), Computer Networks and Communications (164 citations) and Electrical and Electronic Engineering (342 citations). Jun Nakano has collaborated with scholars based in United States and Japan. Frequent co-authors include Josep Torrellas, Brian Greskamp, Smruti R. Sarangi, Radu Teodorescu, Abhishek Tiwari, Takeshi Tokuyama, Pablo Montesinos and Kourosh Gharachorloo. Their work appears in journals such as SIAM Journal on Computing, IEEE Micro and IEEE Transactions on Semiconductor Manufacturing.
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.