B. Elspas
Impact in
- Software top 1%
- Software Testing and Debugging Techniques
- Software Reliability and Analysis Research
Papers in
-
- VLSI and Analog Circuit Testing 2
-
- Formal Methods in Verification 3
- Co-authors
- Karl Levitt (5 shared papers)Robert S. Boyer (2 shared papers)James Turner (1 shared paper)ROBERT A. SHORT (4 shared papers)Jack K. Wolf (1 shared paper)Richard J. Waldinger (1 shared paper)Abraham Waksman (1 shared paper)Harold Samuel Stone (2 shared papers)
- Journals
- IEEE Transactions on Information Theory (5 papers)Computer (1 paper)ACM Computing Surveys (1 paper)ACM SIGPLAN Notices (1 paper)IRE Transactions on Circuit Theory (1 paper)
- Partner nations
- United States
In The Last Decade
B. Elspas
20 papers receiving 991 citations
Peers
Comparison fields: 5 of 56
- Software 419
- Discrete Mathematics and Combinatorics 111
- Computational Theory and Mathematics 371
- Hardware and Architecture 143
- Computer Networks and Communications 294
Countries citing papers authored by B. Elspas
This map shows the geographic impact of B. Elspas'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 B. Elspas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites B. Elspas more than expected).
Fields of papers citing papers by B. Elspas
This network shows the impact of papers produced by B. Elspas. 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 B. Elspas. The network helps show where B. Elspas may publish in the future.
Co-authors
The 11 scholars most cited alongside B. Elspas, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 22 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1975 | 304 | |
| 2 | 1959 | 224 | |
| 3 | 1970 | 160 | |
| 4 | 1975 | 149 | |
| 5 | 1972 | 90 | |
| 6 | 1964 | 59 | |
| 7 | 1963 | 52 | |
| 8 | 1962 | 31 | |
| 9 | 1964 | 13 | |
| 10 | 1967 | 11 | |
| 11 | 1960 | 11 | |
| 12 | INVESTIGATION OF PROPAGATION-LIMITED COMPUTER NETWORKS. | 1964 | 9 |
| 13 | 1971 | 9 | |
| 14 | 1963 | 7 | |
| 15 | DESIGN AND INSTRUMENTATION OF ERROR-CORRECTING CODES | 1961 | 7 |
| 16 | 1965 | 6 | |
| 17 | 1960 | 6 | |
| 18 | 1971 | 4 | |
| 19 | PROPERTIES OF MODULAR MULTIFUNCTIONAL COMPUTER NETWORKS. | 1968 | 4 |
| 20 | 1965 | 2 |
About B. Elspas
B. Elspas is a scholar working on Hardware and Architecture, Computational Theory and Mathematics, Artificial Intelligence, Software and Computer Networks and Communications, having authored 22 papers that have together received 1.2k indexed citations. Recurring topics across this work include Coding theory and cryptography (5 papers), graph theory and CDMA systems (4 papers), Formal Methods in Verification (3 papers), Logic, programming, and type systems (3 papers), Interconnection Networks and Systems (3 papers), Cooperative Communication and Network Coding (2 papers), VLSI and Analog Circuit Testing (2 papers) and Software Testing and Debugging Techniques (2 papers). The work is most often cited by research in Software (419 citations), Discrete Mathematics and Combinatorics (111 citations), Computational Theory and Mathematics (371 citations), Hardware and Architecture (143 citations) and Computer Networks and Communications (294 citations). B. Elspas has collaborated with scholars based in United States. Frequent co-authors include Karl Levitt, Robert S. Boyer, James Turner, ROBERT A. SHORT, Jack K. Wolf, Richard J. Waldinger, Abraham Waksman, Harold Samuel Stone, William H. Kautz and Robert C. Minnick. Their work appears in journals such as IEEE Transactions on Information Theory, Computer, ACM Computing Surveys, ACM SIGPLAN Notices and IRE Transactions on Circuit Theory.
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.