Chris J. Scheiman

1.1k total citations
24 papers, 721 citations indexed

About

Chris J. Scheiman is a scholar working on Computer Networks and Communications, Hardware and Architecture and Artificial Intelligence. According to data from OpenAlex, Chris J. Scheiman has authored 24 papers receiving a total of 721 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computer Networks and Communications, 17 papers in Hardware and Architecture and 4 papers in Artificial Intelligence. Recurrent topics in Chris J. Scheiman's work include Interconnection Networks and Systems (19 papers), Parallel Computing and Optimization Techniques (17 papers) and Distributed systems and fault tolerance (9 papers). Chris J. Scheiman is often cited by papers focused on Interconnection Networks and Systems (19 papers), Parallel Computing and Optimization Techniques (17 papers) and Distributed systems and fault tolerance (9 papers). Chris J. Scheiman collaborates with scholars based in United States. Chris J. Scheiman's co-authors include Klaus E. Schauser, Albert D. Alexandrov, Mihai Ionescu, Maximilian Ibel, P. Cappello, Arvind Krishnamurthy, David Culler, Katherine Yelick, Randolph Y. Wang and Meilin Liu and has published in prestigious journals such as IEEE Transactions on Parallel and Distributed Systems, ACM Transactions on Computer Systems and Journal of Parallel and Distributed Computing.

In The Last Decade

Chris J. Scheiman

23 papers receiving 649 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Chris J. Scheiman United States 9 625 516 134 71 51 24 721
Albert D. Alexandrov United States 7 559 0.9× 461 0.9× 133 1.0× 70 1.0× 42 0.8× 7 660
Marco Vanneschi Italy 13 680 1.1× 424 0.8× 223 1.7× 120 1.7× 75 1.5× 82 790
Kevin O’Brien United States 13 488 0.8× 575 1.1× 108 0.8× 58 0.8× 86 1.7× 30 647
Kathy Yelick United States 6 689 1.1× 592 1.1× 141 1.1× 111 1.6× 22 0.4× 13 778
R. Biswas United States 11 311 0.5× 222 0.4× 121 0.9× 61 0.9× 50 1.0× 32 434
Steven W. Schlosser United States 13 728 1.2× 390 0.8× 169 1.3× 96 1.4× 81 1.6× 28 815
Rajesh Nishtala United States 11 785 1.3× 471 0.9× 354 2.6× 65 0.9× 40 0.8× 17 894
Graham E. Fagg United States 17 836 1.3× 644 1.2× 184 1.4× 66 0.9× 89 1.7× 38 938
Seung-Jai Min South Korea 10 496 0.8× 504 1.0× 174 1.3× 106 1.5× 44 0.9× 23 684
Michel Steuwer United Kingdom 14 406 0.6× 560 1.1× 128 1.0× 160 2.3× 35 0.7× 51 655

Countries citing papers authored by Chris J. Scheiman

Since Specialization
Citations

This map shows the geographic impact of Chris J. Scheiman'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 Chris J. Scheiman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chris J. Scheiman more than expected).

Fields of papers citing papers by Chris J. Scheiman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Chris J. Scheiman. 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 Chris J. Scheiman. The network helps show where Chris J. Scheiman may publish in the future.

Co-authorship network of co-authors of Chris J. Scheiman

This figure shows the co-authorship network connecting the top 25 collaborators of Chris J. Scheiman. A scholar is included among the top collaborators of Chris J. Scheiman 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 Chris J. Scheiman. Chris J. Scheiman 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.
Scheiman, Chris J. & P. Cappello. (2002). A processor-time minimal systolic array for transitive closure. 75. 19–30. 3 indexed citations
2.
Liu, Meilin, et al.. (2002). Profiling the performance of TCP/IP on Windows NT. DigitalCommons - CalPoly (California State Polytechnic University). 133–137. 4 indexed citations
3.
Schauser, Klaus E. & Chris J. Scheiman. (2002). Experience with active messages on the Meiko CS-2. 140–149. 15 indexed citations
4.
Schauser, Klaus E., et al.. (2002). Exploiting the capabilities of communications co-processors. 109–115. 3 indexed citations
5.
Scheiman, Chris J. & P. Cappello. (2002). A period-processor-time-minimal schedule for cubical mesh algorithms. c 34. 261–272. 1 indexed citations
6.
Scheiman, Chris J. & P. Cappello. (2002). A period-processor-time-minimal systolic array for cubical mesh algorithms. c 34. 648–655.
7.
Scheiman, Chris J. & P. Cappello. (2002). A processor-time-minimal schedule for the standard tensor product algorithm. 3. 176–187. 1 indexed citations
8.
Scheiman, Chris J. & P. Cappello. (2002). A processor-time-minimal schedule for 3D rectilinear mesh algorithms. 5. 26–33. 1 indexed citations
9.
Cappello, P., Ömer Eğecioǧlu, & Chris J. Scheiman. (2000). PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS. Parallel algorithms and applications. 15(3-4). 167–199. 2 indexed citations
10.
Alexandrov, Albert D., Maximilian Ibel, Klaus E. Schauser, & Chris J. Scheiman. (1998). UFO. ACM Transactions on Computer Systems. 16(3). 207–233. 56 indexed citations
11.
Alexandrov, Albert D., Maximilian Ibel, Klaus E. Schauser, & Chris J. Scheiman. (1997). Extending the operating system at the user level: the Ufo global file system. USENIX Annual Technical Conference. 6–6. 46 indexed citations
12.
Alexandrov, Albert D., Maximilian Ibel, Klaus E. Schauser, & Chris J. Scheiman. (1997). SuperWeb: research issues in Java-based global computing. Concurrency Practice and Experience. 9(6). 535–553. 43 indexed citations
13.
Alexandrov, Albert D., Mihai Ionescu, Klaus E. Schauser, & Chris J. Scheiman. (1997). LogGP: Incorporating Long Messages into the LogP Model for Parallel Computation. Journal of Parallel and Distributed Computing. 44(1). 71–79. 137 indexed citations
14.
Schauser, Klaus E., et al.. (1996). Profiling a parallel language based on fine-grained communication. 17–17. 1 indexed citations
15.
Krishnamurthy, Arvind, Klaus E. Schauser, Chris J. Scheiman, et al.. (1996). Evaluation of architectural support for global address-based communication in large-scale parallel machines. ACM SIGOPS Operating Systems Review. 30(5). 37–48. 1 indexed citations
16.
Krishnamurthy, Arvind, Klaus E. Schauser, Chris J. Scheiman, et al.. (1996). Evaluation of architectural support for global address-based communication in large-scale parallel machines. 37–48. 15 indexed citations
17.
Scheiman, Chris J. & P. Cappello. (1996). A PROCESSOR-TIME-MINIMAL DESIGN FOR 3D RECTILINEAR MESH ALGORITHMS. Parallel Processing Letters. 6(4). 539–550. 1 indexed citations
18.
Alexandrov, Albert D., Mihai Ionescu, Klaus E. Schauser, & Chris J. Scheiman. (1995). LogGP. 95–105. 332 indexed citations
19.
Scheiman, Chris J. & P. Cappello. (1994). A period-processor-time-minimal schedule for cubical mesh algorithms. IEEE Transactions on Parallel and Distributed Systems. 5(3). 274–280. 6 indexed citations
20.
Scheiman, Chris J. & P. Cappello. (1992). A processor-time-minimal systolic array for transitive closure. IEEE Transactions on Parallel and Distributed Systems. 3(3). 257–269. 18 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026