B. Elspas

1.5k total citations
20 papers, 1.0k citations indexed

About

B. Elspas is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, B. Elspas has authored 20 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 8 papers in Electrical and Electronic Engineering and 6 papers in Computer Networks and Communications. Recurrent topics in B. Elspas's work include Coding theory and cryptography (5 papers), graph theory and CDMA systems (4 papers) and Logic, programming, and type systems (3 papers). B. Elspas is often cited by papers focused on Coding theory and cryptography (5 papers), graph theory and CDMA systems (4 papers) and Logic, programming, and type systems (3 papers). B. Elspas collaborates with scholars based in United States. B. Elspas's co-authors include Karl Levitt, Robert S. Boyer, James Turner, J.K. Wolf, Robert Short, Abraham Waksman, Richard Waldinger, Harold S. Stone, William H. Kautz and Robert C. Minnick and has published in prestigious journals such as IEEE Transactions on Information Theory, ACM Computing Surveys and Computer.

In The Last Decade

B. Elspas

19 papers receiving 872 citations

Peers

Countries citing papers authored by B. Elspas

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of B. Elspas

This figure shows the co-authorship network connecting the top 25 collaborators of B. Elspas. A scholar is included among the top collaborators of B. Elspas 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 B. Elspas. B. Elspas is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Survey of Fault Tolerant Computer Security and Computer Safety. 1986 ·Defense Technical Information Center (DTIC) ·Jack Goldberg, B. Elspas, William H. Kautz, Karl Levitt	1
2	SELECT---a formal system for testing and debugging programs by symbolic execution 1975 ·Robert S. Boyer, B. Elspas, Karl Levitt	131
3	SELECT—a formal system for testing and debugging programs by symbolic execution 1975 ·ACM SIGPLAN Notices ·Robert S. Boyer, B. Elspas, Karl Levitt	257
4	An Assessment of Techniques for Proving Program Correctness 1972 ·ACM Computing Surveys ·B. Elspas, Karl Levitt, Richard Waldinger, Abraham Waksman	79
5	Software Reliability 1971 ·Computer ·B. Elspas, (unknown), Karl Levitt	8
6	Graphs with circulant adjacency matrices 1970 ·Journal of Combinatorial Theory ·B. Elspas, James Turner	140
7	PROPERTIES OF MODULAR MULTIFUNCTIONAL COMPUTER NETWORKS. 1968 ·Defense Technical Information Center (DTIC) ·B. Elspas, William H. Kautz, (unknown)	4
8	Decomposition of group functions and the synthesis of multirail cascades 1967 ·B. Elspas, Harold S. Stone	11
9	Single-error-correcting codes for constant-weight data words 1965 ·IEEE Transactions on Information Theory ·William H. Kautz, B. Elspas	5
10	A conjecture on binary nongroup codes (Corresp.) 1965 ·IEEE Transactions on Information Theory ·B. Elspas	2
11	Topological constraints on interconnection-limited logic 1964 ·B. Elspas	56
12	A Bound on the Run Measure of Switching Functions 1964 ·IEEE Transactions on Electronic Computers ·B. Elspas, Robert Short	10
13	INVESTIGATION OF PROPAGATION-LIMITED COMPUTER NETWORKS. 1964 ·Defense Technical Information Center (DTIC) ·B. Elspas, Robert Short, Jack Goldberg, Harold S. Stone, (unknown)	8
14	Symmetric Latin Squares 1963 ·IEEE Transactions on Electronic Computers ·Robert C. Minnick, B. Elspas, Robert Short	7
15	Error-locating codes--A new concept in error control 1963 ·IEEE Transactions on Information Theory ·J.K. Wolf, B. Elspas	49
16	A note on optimum burst-error-correcting codes 1962 ·IEEE Transactions on Information Theory ·B. Elspas, Robert Short	29
17	DESIGN AND INSTRUMENTATION OF ERROR-CORRECTING CODES 1961 ·Defense Technical Information Center (DTIC) ·B. Elspas	7
18	A note on<tex>p</tex>-nary adjacent-error-correcting codes 1960 ·IEEE Transactions on Information Theory ·B. Elspas	9
19	Self-Complementary Symmetry Types of Boolean Functions 1960 ·IEEE Transactions on Electronic Computers ·B. Elspas	6
20	The Theory of Autonomous Linear Sequential Networks 1959 ·IRE Transactions on Circuit Theory ·B. Elspas	195

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