Paul Slepian

412 total citations
23 papers, 295 citations indexed

About

Paul Slepian is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Paul Slepian has authored 23 papers receiving a total of 295 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computational Theory and Mathematics, 4 papers in Computer Networks and Communications and 4 papers in Electrical and Electronic Engineering. Recurrent topics in Paul Slepian's work include Interconnection Networks and Systems (4 papers), Matrix Theory and Algorithms (4 papers) and Graphene research and applications (1 paper). Paul Slepian is often cited by papers focused on Interconnection Networks and Systems (4 papers), Matrix Theory and Algorithms (4 papers) and Graphene research and applications (1 paper). Paul Slepian collaborates with scholars based in United States, India and Israel. Paul Slepian's co-authors include Franz E. Hohn, Louis Weinberg, Louis Brand, F. S. Van Vleck, Edward O. Thorp, Eugene Lukács, S. L. Hakimi and Robert M. Newcomb and has published in prestigious journals such as Physics Today, Annals of Mathematics and SIAM Review.

In The Last Decade

Paul Slepian

18 papers receiving 222 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Paul Slepian United States 7 57 52 44 34 28 23 295
D. Kershaw United Kingdom 9 89 1.6× 31 0.6× 45 1.0× 37 1.1× 16 0.6× 20 446
J. Robert Johnson United States 12 109 1.9× 101 1.9× 25 0.6× 37 1.1× 14 0.5× 35 303
John L. Troutman United States 6 46 0.8× 34 0.7× 73 1.7× 16 0.5× 10 0.4× 12 311
Jay P. Fillmore United States 9 45 0.8× 19 0.4× 63 1.4× 86 2.5× 10 0.4× 21 398
Theodore A. Bickart United States 11 103 1.8× 127 2.4× 54 1.2× 14 0.4× 11 0.4× 45 344
C. K. Mesztenyi United States 6 114 2.0× 60 1.2× 16 0.4× 5 0.1× 23 0.8× 12 358
H. Guggenheimer United States 14 87 1.5× 23 0.4× 35 0.8× 165 4.9× 11 0.4× 58 554
W. Gilbert Strang United States 6 189 3.3× 26 0.5× 123 2.8× 51 1.5× 5 0.2× 7 412
Alex N. Beavers United States 7 163 2.9× 19 0.4× 36 0.8× 14 0.4× 33 1.2× 10 303
Bernard Gostiaux France 3 52 0.9× 8 0.2× 37 0.8× 63 1.9× 13 0.5× 3 308

Countries citing papers authored by Paul Slepian

Since Specialization
Citations

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

Fields of papers citing papers by Paul Slepian

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Paul Slepian

This figure shows the co-authorship network connecting the top 25 collaborators of Paul Slepian. A scholar is included among the top collaborators of Paul Slepian 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 Paul Slepian. Paul Slepian 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.
Slepian, Paul, et al.. (1979). A class of nonrealizable paramount matrices. International Journal of Circuit Theory and Applications. 7(1). 1–8. 1 indexed citations
2.
Slepian, Paul, et al.. (1976). Minimal paramount matrices. Linear Algebra and its Applications. 15(3). 197–204. 2 indexed citations
3.
Slepian, Paul, et al.. (1975). Impedance and admittance matrices via Kirchhoff's third and fourth laws. International Journal of Circuit Theory and Applications. 3(3). 318–318. 1 indexed citations
4.
Slepian, Paul. (1968). Mathematical Foundations of Network Analysis. 24 indexed citations
5.
Slepian, Paul. (1967). Network Theory: Analysis and Synthesis (Shlomo Karni). SIAM Review. 9(2). 260–262. 1 indexed citations
6.
Slepian, Paul, et al.. (1966). The Number of Trees in a Network. IEEE Transactions on Circuit Theory. 13(3). 271–281. 16 indexed citations
7.
Slepian, Paul, et al.. (1966). An Application of Feussner's Method to Tree Counting. IEEE Transactions on Circuit Theory. 13(3). 336–339. 5 indexed citations
8.
Slepian, Paul. (1964). A Non-Hausdorff Topology Such That Each Convergent Sequence Has Exactly One Limit. American Mathematical Monthly. 71(7). 776–776. 2 indexed citations
9.
Vleck, F. S. Van, et al.. (1964). Mathematical Notes. American Mathematical Monthly. 71(7). 767–781. 1 indexed citations
10.
Weinberg, Louis & Paul Slepian. (1960). Positive Real Matrices. Indiana University Mathematics Journal. 9(1). 71–83. 10 indexed citations
11.
Weinberg, Louis & Paul Slepian. (1960). Takahasi's Results on Tchebycheff and Butterworth Ladder Networks. IRE Transactions on Circuit Theory. 7(2). 88–101. 27 indexed citations
12.
Slepian, Paul. (1960). On paramount matrices. Quarterly of Applied Mathematics. 18(3). 263–269. 2 indexed citations
13.
Hohn, Franz E. & Paul Slepian. (1960). Elementary Matrix Algebra. Physics Today. 13(2). 50–50. 141 indexed citations
14.
Slepian, Paul. (1958). Correction to 'On the Compactness of an RC Quadripole'. IRE Transactions on Circuit Theory. 5(2). 139–139. 1 indexed citations
15.
Slepian, Paul. (1958). On the Compactness of an RC Quadripole. IRE Transactions on Circuit Theory. 5(1). 61–65. 1 indexed citations
16.
Slepian, Paul. (1958). Theory of Lebesgue Area of Continuous Maps of 2-Manifolds into n-Space. Annals of Mathematics. 68(3). 669–669. 6 indexed citations
17.
Weinberg, Louis & Paul Slepian. (1958). Realizability Conditions on n-Port Networks. IRE Transactions on Circuit Theory. 5(3). 217–221. 15 indexed citations
18.
Slepian, Paul & Louis Weinberg. (1958). Necessary Conditions on the Matrix of an RC Grounded Quadripole. IRE Transactions on Circuit Theory. 5(2). 89–95. 4 indexed citations
19.
Slepian, Paul. (1958). On the Lebesgue area of a doubled map. Pacific Journal of Mathematics. 8(3). 613–620. 25 indexed citations
20.
Brand, Louis & Paul Slepian. (1957). Vector Analysis. Physics Today. 10(11). 34–36. 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 D. Kershaw Breakdown of academic impact, for papers by J. Robert Johnson Breakdown of academic impact, for papers by John L. Troutman Breakdown of academic impact, for papers by Jay P. Fillmore Breakdown of academic impact, for papers by Theodore A. Bickart Breakdown of academic impact, for papers by C. K. Mesztenyi Breakdown of academic impact, for papers by H. Guggenheimer Breakdown of academic impact, for papers by W. Gilbert Strang Breakdown of academic impact, for papers by Alex N. Beavers Breakdown of academic impact, for papers by Bernard Gostiaux
Rankless by CCL
2026