W. Mayeda

468 total citations
32 papers, 327 citations indexed

About

W. Mayeda is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, W. Mayeda has authored 32 papers receiving a total of 327 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computer Networks and Communications, 11 papers in Computational Theory and Mathematics and 8 papers in Hardware and Architecture. Recurrent topics in W. Mayeda's work include Interconnection Networks and Systems (7 papers), Embedded Systems Design Techniques (6 papers) and Graph theory and applications (5 papers). W. Mayeda is often cited by papers focused on Interconnection Networks and Systems (7 papers), Embedded Systems Design Techniques (6 papers) and Graph theory and applications (5 papers). W. Mayeda collaborates with scholars based in United States and Japan. W. Mayeda's co-authors include S. Seshu, C. V. Ramamoorthy, T.N. Trick, Adel A. Sakla, S. L. Hakimi, Wai‐Kai Chen, Narsingh Deo, Edward S. Davidson, Harold S. Stone and M. E. Van Valkenburg and has published in prestigious journals such as IEEE Transactions on Software Engineering, IEEE Transactions on Computers and IBM Journal of Research and Development.

In The Last Decade

W. Mayeda

27 papers receiving 246 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
W. Mayeda United States 11 130 107 102 86 49 32 327
C. L. Coates United States 10 103 0.8× 89 0.8× 33 0.3× 48 0.6× 25 0.5× 25 314
Ashok T. Amin United States 7 102 0.8× 84 0.8× 323 3.2× 202 2.3× 38 0.8× 12 418
Frank Hadlock United States 4 140 1.1× 133 1.2× 86 0.8× 45 0.5× 5 0.1× 15 318
K. Thulasiraman United States 12 330 2.5× 62 0.6× 409 4.0× 26 0.3× 51 1.0× 48 560
Ondřej Sýkora Slovakia 11 104 0.8× 175 1.6× 89 0.9× 19 0.2× 7 0.1× 47 328
Curt Jones United States 4 239 1.8× 120 1.1× 238 2.3× 124 1.4× 7 0.1× 5 438
K.H. Kim United States 11 113 0.9× 46 0.4× 405 4.0× 346 4.0× 88 1.8× 44 537
R. Sridhar United States 11 189 1.5× 46 0.4× 146 1.4× 109 1.3× 7 0.1× 57 376
Eliezer Dekel United States 7 67 0.5× 156 1.5× 252 2.5× 143 1.7× 9 0.2× 26 411
Chin-Long Chen United States 11 268 2.1× 88 0.8× 139 1.4× 95 1.1× 9 0.2× 18 431

Countries citing papers authored by W. Mayeda

Since Specialization
Citations

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

Fields of papers citing papers by W. Mayeda

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of W. Mayeda

This figure shows the co-authorship network connecting the top 25 collaborators of W. Mayeda. A scholar is included among the top collaborators of W. Mayeda 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 W. Mayeda. W. Mayeda 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.
Mayeda, W. & Hua Zhao. (1990). Properties of W-Tree. International Symposium on Circuits and Systems. 316–320. 1 indexed citations
2.
Zhao, Qilai & W. Mayeda. (1989). Wild components for layout design. 980–984. 1 indexed citations
3.
Mayeda, W., et al.. (1987). Priority Exhaustive‐Service‐Type Multipacket Transmission. Electronics and Communications in Japan (Part I Communications). 70(2). 66–76. 1 indexed citations
4.
Onaga, Kenji & W. Mayeda. (1979). A boolean theory of network flows and metrics and its applications to particle transmission and clustering. Networks. 9(3). 249–281. 2 indexed citations
5.
Trick, T.N., W. Mayeda, & Adel A. Sakla. (1979). Calculation of parameter values from node voltage measurements. IEEE Transactions on Circuits and Systems. 26(7). 466–474. 42 indexed citations
6.
Mayeda, W. & Wai‐Kai Chen. (1973). Graph Theory. IEEE Transactions on Systems Man and Cybernetics. 8 indexed citations
7.
Mayeda, W. & Wai‐Kai Chen. (1973). Graph Theory. IEEE Transactions on Systems Man and Cybernetics. SMC-3(3). 300–300. 3 indexed citations
8.
Mayeda, W.. (1972). Flow reliability of communication net. IEEE Transactions on Circuit Theory. 19(4). 373–374. 1 indexed citations
9.
Aggarwal, J.K., W. Mayeda, & C. V. Ramamoorthy. (1970). On multiple transmission. IEEE Transactions on Circuit Theory. 17(2). 245–248. 1 indexed citations
10.
Mayeda, W.. (1970). A proof of Tutte's realizability condition. IEEE Transactions on Circuit Theory. 17(4). 506–511.
11.
Mayeda, W. & S. Seshu. (1965). Generation of Trees without Duplications. IEEE Transactions on Circuit Theory. 12(2). 181–185. 64 indexed citations
12.
Mayeda, W.. (1964). PROPERTIES OF CLASSES OF PATHS.. IDEALS (University of Illinois Urbana-Champaign). 1 indexed citations
13.
Mayeda, W.. (1964). APPLICATION OF LINEAR GRAPHS TO ELECTRICAL NETWORKS, SWITCHING NETWORKS AND COMMUNICATION NETS.. Defense Technical Information Center (DTIC). 2 indexed citations
14.
Mayeda, W.. (1963). Realizability of Fundamental Cut Set Matrices of Oriented Graphs. IEEE Transactions on Circuit Theory. 10(1). 133–134. 2 indexed citations
15.
Mayeda, W.. (1961). On the Realizability of a Set of Trees. 7 indexed citations
16.
Hakimi, S. L. & W. Mayeda. (1960). On Coefficients of Polynomials in Network Functions. IRE Transactions on Circuit Theory. 7(1). 40–45. 8 indexed citations
17.
Younger, D. H., et al.. (1960). On iterative factorization in network analysis by digital computer. 241–253. 4 indexed citations
18.
Mayeda, W.. (1960). Synthesis of Switching Functions by Linear Graph Theory. IBM Journal of Research and Development. 4(3). 321–328. 6 indexed citations
19.
Mayeda, W.. (1958). The Application of Mathematical Logic to Network Theory. 12 indexed citations
20.
Mayeda, W. & M. E. Van Valkenburg. (1957). Analysis of Nonreciprocal Networks by Digital Computer. 70–75. 1 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

Breakdown of academic impact, for papers by C. L. Coates Breakdown of academic impact, for papers by Ashok T. Amin Breakdown of academic impact, for papers by Frank Hadlock Breakdown of academic impact, for papers by K. Thulasiraman Breakdown of academic impact, for papers by Ondřej Sýkora Breakdown of academic impact, for papers by Curt Jones Breakdown of academic impact, for papers by K.H. Kim Breakdown of academic impact, for papers by R. Sridhar Breakdown of academic impact, for papers by Eliezer Dekel Breakdown of academic impact, for papers by Chin-Long Chen
Rankless by CCL
2026