B. Elspas
Impact in
- Software top 1%
- Software Testing and Debugging Techniques
- Software Reliability and Analysis Research
Papers in
-
- Coding theory and cryptography 5
- Logic, programming, and type systems 3
-
- graph theory and CDMA systems 4
- VLSI and FPGA Design Techniques 2
- Co-authors
- Karl Levitt (5 shared papers)Robert S. Boyer (2 shared papers)James Turner (1 shared paper)J.K. Wolf (1 shared paper)Robert Short (4 shared papers)Richard Waldinger (1 shared paper)Abraham Waksman (1 shared paper)Harold S. Stone (2 shared papers)
- Journals
- IEEE Transactions on Information Theory (5 papers)ACM SIGPLAN Notices (1 paper)Computer (1 paper)ACM Computing Surveys (1 paper)IRE Transactions on Circuit Theory (1 paper)
- Partner nations
- United States
In The Last Decade
B. Elspas
19 papers receiving 872 citations
Peers
Comparison fields: 5 of 56
- Software 366
- Discrete Mathematics and Combinatorics 99
- Computational Theory and Mathematics 307
- Hardware and Architecture 129
- Computer Networks and Communications 266
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
| # | Work | ||
|---|---|---|---|
| 1 | 1975 | 257 | |
| 2 | 1959 | 195 | |
| 3 | 1970 | 140 | |
| 4 | 1975 | 131 | |
| 5 | 1972 | 79 | |
| 6 | 1964 | 56 | |
| 7 | 1963 | 49 | |
| 8 | 1962 | 29 | |
| 9 | 1967 | 11 | |
| 10 | 1964 | 10 | |
| 11 | 1960 | 9 | |
| 12 | INVESTIGATION OF PROPAGATION-LIMITED COMPUTER NETWORKS. | 1964 | 8 |
| 13 | 1971 | 8 | |
| 14 | DESIGN AND INSTRUMENTATION OF ERROR-CORRECTING CODES | 1961 | 7 |
| 15 | 1963 | 7 | |
| 16 | 1960 | 6 | |
| 17 | 1965 | 5 | |
| 18 | PROPERTIES OF MODULAR MULTIFUNCTIONAL COMPUTER NETWORKS. | 1968 | 4 |
| 19 | 1965 | 2 | |
| 20 | Survey of Fault Tolerant Computer Security and Computer Safety. | 1986 | 1 |
About B. Elspas
B. Elspas is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications, Computational Theory and Mathematics and Hardware and Architecture, having authored 20 papers that have together received 1.0k indexed citations. Recurring topics across this work include Coding theory and cryptography (5 papers), graph theory and CDMA systems (4 papers), Logic, programming, and type systems (3 papers), Interconnection Networks and Systems (3 papers), Software Testing and Debugging Techniques (2 papers), VLSI and FPGA Design Techniques (2 papers), Software Engineering Research (2 papers) and VLSI and Analog Circuit Testing (2 papers). The work is most often cited by research in Software (366 citations), Discrete Mathematics and Combinatorics (99 citations), Computational Theory and Mathematics (307 citations), Hardware and Architecture (129 citations) and Computer Networks and Communications (266 citations). B. Elspas has collaborated with scholars based in United States. Frequent co-authors include Karl Levitt, Robert S. Boyer, James Turner, J.K. Wolf, Robert Short, Richard Waldinger, Abraham Waksman, Harold S. Stone, William H. Kautz and Jack Goldberg. Their work appears in journals such as IEEE Transactions on Information Theory, ACM SIGPLAN Notices, Computer, ACM Computing Surveys 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.