Philip M. Spira
- Computer Networks and Communications top 2%
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Electrical and Electronic Engineering
- Signal Processing top 10%
- Topics
- Polynomial and algebraic computation (3 papers)semigroups and automata theory (3 papers)Complexity and Algorithms in Graphs (3 papers)
- Cited by
- Computer Networks and CommunicationsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- United States
In The Last Decade
Philip M. Spira
17 papers receiving 839 citations
Hit Papers
Peers
Comparison fields: 5 of 65
- Computer Networks and Communications 679
- Computational Theory and Mathematics 292
- Artificial Intelligence 179
- Electrical and Electronic Engineering 144
- Signal Processing 94
Countries citing papers authored by Philip M. Spira
This map shows the geographic impact of Philip M. Spira'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 Philip M. Spira with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philip M. Spira more than expected).
Fields of papers citing papers by Philip M. Spira
This network shows the impact of papers produced by Philip M. Spira. 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 Philip M. Spira. The network helps show where Philip M. Spira may publish in the future.
Co-authorship network of co-authors of Philip M. Spira
This figure shows the co-authorship network connecting the top 25 collaborators of Philip M. Spira. A scholar is included among the top collaborators of Philip M. Spira 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 Philip M. Spira. Philip M. Spira is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | 3 | |
| 3 | A Distributed Algorithm for Minimum-Weight Spanning Treesbreakdown → | 664 |
| 4 | Communication Complexity of Distributed Minimum Spanning Tree Algorithms. | 15 |
| 5 | 39 | |
| 6 | 92 | |
| 7 | 8 | |
| 8 | 7 | |
| 9 | 67 | |
| 10 | 6 | |
| 11 | 1 | |
| 12 | 7 | |
| 13 | 1 | |
| 14 | 16 | |
| 15 | 1 | |
| 16 | On the computational complexity of finite functions | 3 |
| 17 | 4 |
About Philip M. Spira
Philip M. Spira is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Discrete Mathematics and Combinatorics, having authored 17 papers that have together received 941 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (3 papers), semigroups and automata theory (3 papers) and Complexity and Algorithms in Graphs (3 papers). The work is most often cited by research in Computer Networks and Communications (679 citations), Computational Theory and Mathematics (292 citations) and Computer Graphics and Computer-Aided Design (38 citations). Philip M. Spira has collaborated with scholars based in United States. Frequent co-authors include Robert G. Gallager, P.A. Humblet, Aimin Pan, Ian Munro and Michael A. Arbib. Their work appears in journals such as Journal of the ACM, IEEE Transactions on Computers and SIAM Journal on Computing.
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.