This map shows the geographic impact of Yijie Han'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 Yijie Han with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yijie Han more than expected).
This network shows the impact of papers produced by Yijie Han. 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 Yijie Han. The network helps show where Yijie Han may publish in the future.
Co-authorship network of co-authors of Yijie Han
This figure shows the co-authorship network connecting the top 25 collaborators of Yijie Han.
A scholar is included among the top collaborators of Yijie Han 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 Yijie Han. Yijie Han is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Han, Yijie, et al.. (2020). Sort Integers into a Linked List. Computer and Information Science. 13(1). 51–51.1 indexed citations
Han, Yijie. (2016). A $\theta(n^2)$ Time Matrix Multiplication Algorithm. arXiv (Cornell University).
4.
Han, Yijie, et al.. (2007). Multi-Agent Teacher Assistant, A Case Study Intended for Multi-Agent Applications.. Software Engineering Research and Practice. 501–510.1 indexed citations
Han, Yijie. (2006). An Efficient Parallel Algorithm for Building the Separating Tree.. Parallel and Distributed Processing Techniques and Applications. 369–373.1 indexed citations
7.
Han, Yijie. (2006). Achieving O(n 3 /log n) Time for All Pairs Shortest Paths by Using a Smaller Table.. Computers and Their Applications. 36–37.1 indexed citations
Han, Yijie, et al.. (1999). On the parallel time complexity of undirected connectivity and minimum spanning trees. The HKU Scholars Hub (University of Hong Kong). 225–234.6 indexed citations
15.
Han, Yijie & Xiaojun Shen. (1999). Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. Symposium on Discrete Algorithms. 419–428.2 indexed citations
Han, Yijie, et al.. (1989). Indexing Functions and Time Lower Bounds for Sorting on a Mesh-Connected Computer. Kyoto University Research Information Repository (Kyoto University). 695. 145–154.2 indexed citations
19.
Han, Yijie & Raphael A. Finkel. (1988). An Optimal Scheme for Disseminating Information.. Proceedings of the International Conference on Parallel Processing. 198–203.12 indexed citations
20.
Han, Yijie & Robert A. Wagner. (1986). Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem.. Proceedings of the International Conference on Parallel Processing. 924–930.21 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.