Abraham Berman

6.9k total citations · 1 hit paper
113 papers, 4.5k citations indexed

About

Abraham Berman is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Electrical and Electronic Engineering. According to data from OpenAlex, Abraham Berman has authored 113 papers receiving a total of 4.5k indexed citations (citations by other indexed papers that have themselves been cited), including 70 papers in Computational Theory and Mathematics, 34 papers in Numerical Analysis and 34 papers in Electrical and Electronic Engineering. Recurrent topics in Abraham Berman's work include Matrix Theory and Algorithms (57 papers), graph theory and CDMA systems (33 papers) and Advanced Optimization Algorithms Research (32 papers). Abraham Berman is often cited by papers focused on Matrix Theory and Algorithms (57 papers), graph theory and CDMA systems (33 papers) and Advanced Optimization Algorithms Research (32 papers). Abraham Berman collaborates with scholars based in Israel, United States and Canada. Abraham Berman's co-authors include Robert J. Plemmons, Naomi Shaked-Monderer, Robert J. Plemmons, Xiao‐Dong Zhang, Daniel Hershkowitz, Boris Koichu, Роза Лейкин, George P. Barker, Adi Ben-Israel and Michael Neumann and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Numerical Analysis and Journal of Mathematical Analysis and Applications.

In The Last Decade

Abraham Berman

108 papers receiving 4.2k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Nonnegative Matrices in the Mathematical Sciences

1994 2.5k citations Abraham Berman et al. profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Abraham Berman	2.3k	1.3k	706	701	604	113	4.5k
T. N. E. Greville	2.4k 1.0×	1.1k 0.9×	596 0.8×	925 1.3×	222 0.4×	36	5.0k
Felix R. Gantmacher	2.3k 1.0×	1.1k 0.9×	790 1.1×	1.4k 2.0×	653 1.1×	9	6.9k
Hans Schneider	2.2k 0.9×	648 0.5×	624 0.9×	530 0.8×	190 0.3×	204	3.8k
Robert J. Plemmons	1.2k 0.5×	603 0.5×	415 0.6×	435 0.6×	463 0.8×	14	2.7k
Miroslav Fiedler	2.9k 1.2×	696 0.6×	1.3k 1.8×	441 0.6×	1.4k 2.3×	159	6.5k
Steve Smale	2.0k 0.8×	819 0.7×	189 0.3×	631 0.9×	1.3k 2.1×	54	7.3k
E. K. Blum	2.5k 1.1×	1.7k 1.4×	260 0.4×	1.2k 1.7×	275 0.5×	47	6.3k
Predrag S. Stanimirović	1.7k 0.7×	1.0k 0.8×	298 0.4×	1.0k 1.4×	128 0.2×	283	4.0k
Paul Van Dooren	3.1k 1.3×	2.2k 1.8×	903 1.3×	3.8k 5.5×	813 1.3×	320	9.5k
Marvin Marcus	2.5k 1.1×	565 0.5×	965 1.4×	243 0.3×	203 0.3×	216	5.1k

Countries citing papers authored by Abraham Berman

Since Specialization

Citations

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

Fields of papers citing papers by Abraham Berman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Abraham Berman

This figure shows the co-authorship network connecting the top 25 collaborators of Abraham Berman. A scholar is included among the top collaborators of Abraham Berman 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 Abraham Berman. Abraham Berman 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

Berman, Abraham, et al.. (2024). Problem-Solving Before Instruction: A Case Study of a Matrix Theory Course. PRIMUS. 35(9-10). 1055–1070.

Berman, Abraham, et al.. (2018). Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum. Linear Algebra and its Applications. 564. 58–71. 5 indexed citations

Berman, Abraham, et al.. (2018). A family of graphs that are determined by their normalized Laplacian spectra. Linear Algebra and its Applications. 548. 66–76. 6 indexed citations

Shaked-Monderer, Naomi, et al.. (2014). SPN completable graphs. Linear Algebra and its Applications. 498. 58–73. 5 indexed citations

Berman, Abraham, et al.. (2014). Zero forcing for sign patterns. Linear Algebra and its Applications. 447. 56–67. 2 indexed citations

Wirth, Fabian, et al.. (2012). On the higher moments of TCP. Linear Algebra and its Applications. 439(4). 899–913.

Berman, Abraham, et al.. (2005). How not to formulate multiple choice problems. International Journal of Mathematical Education in Science and Technology. 36(4). 428–437.

Koichu, Boris, Abraham Berman, & Michael Moore. (2004). Promotion of Heuristic Literacy in a Regular Mathematics Classroom.. for the learning of mathematics. 24(1). 33–39. 7 indexed citations

Berman, Abraham, Robert Shorten, & Douglas J. Leith. (2004). Positive matrices associated with synchronised communication networks. Linear Algebra and its Applications. 393. 47–54. 28 indexed citations

10.

Berman, Abraham, et al.. (2004). 5×5 Completely positive matrices. Linear Algebra and its Applications. 393. 55–71. 7 indexed citations

11.

Berman, Abraham & Shay Gueron. (2002). 86.35 On the inverse of the Hilbert matrix. The Mathematical Gazette. 86(506). 274–277. 2 indexed citations

12.

Berman, Abraham, et al.. (2000). 'Proof reading' and multiple choice tests. International Journal of Mathematical Education in Science and Technology. 31(4). 613–619. 3 indexed citations

13.

Лейкин, Роза, Abraham Berman, & Orit Zaslavsky. (2000). Applications of symmetry to problem solving. International Journal of Mathematical Education in Science and Technology. 31(6). 799–809. 23 indexed citations

14.

Berman, Abraham & Robert Grone. (1988). Bipartite completely positive matrices. Mathematical Proceedings of the Cambridge Philosophical Society. 103(2). 269–276. 23 indexed citations

15.

Berman, Abraham. (1988). Complete positivity. Linear Algebra and its Applications. 107. 57–63. 18 indexed citations

16.

Kessler, Ofra & Abraham Berman. (1985). Matrices with a transitive graph and inverse M-matrices. Linear Algebra and its Applications. 71. 175–185. 4 indexed citations

17.

Aharoni, Ron, Abraham Berman, & Yair Censor. (1983). An interior points algorithm for the convex feasibility problem. Advances in Applied Mathematics. 4(4). 479–489. 25 indexed citations

18.

Berman, Abraham & Robert C. Ward. (1978). ALPS: Classes of stable and semipositive matrices. Linear Algebra and its Applications. 21(2). 163–174. 17 indexed citations

19.

Berman, Abraham, R. S. Varga, & Robert C. Ward. (1978). A L P S: Matrices with nonpositive off-diagonal entries. Linear Algebra and its Applications. 21(3). 233–244. 22 indexed citations

20.

Berman, Abraham, et al.. (1972). A generalization of irreducible monotonicity. Linear Algebra and its Applications. 5(1). 29–38. 10 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