Leonard Berman
Impact in
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Advanced Graph Theory Research
-
- Network Traffic and Congestion Control
- Mobile Ad Hoc Networks
Papers in
-
- Complexity and Algorithms in Graphs 9
- semigroups and automata theory 5
- Computability, Logic, AI Algorithms 5
- Formal Methods in Verification 3
- Advanced Graph Theory Research 2
-
- VLSI and FPGA Design Techniques 7
- Co-authors
- George Markowsky (1 shared paper)Lawrence T. Kou (1 shared paper)Juris Hartmanis (4 shared papers)Louise H. Trevillyan (4 shared papers)Jik Hyun Chang (1 shared paper)Óscar H. Ibarra (1 shared paper)Bala Ravikumar (1 shared paper)J. Hartmanis (1 shared paper)
- Journals
- Theoretical Computer Science (2 papers)SIAM Journal on Computing (1 paper)Journal of Computer and System Sciences (1 paper)Acta Informatica (1 paper)Lecture notes in computer science (2 papers)
- Partner nations
- United States
In The Last Decade
Leonard Berman
21 papers receiving 1.5k citations
Leonard Berman's Hit Papers
Peers
Comparison fields: 5 of 52
- Computational Theory and Mathematics 922
- Computer Networks and Communications 505
- Artificial Intelligence 198
- Computer Graphics and Computer-Aided Design 24
- Electrical and Electronic Engineering 146
Countries citing papers authored by Leonard Berman
This map shows the geographic impact of Leonard 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 Leonard Berman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonard Berman more than expected).
Fields of papers citing papers by Leonard Berman
This network shows the impact of papers produced by Leonard 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 Leonard Berman. The network helps show where Leonard Berman may publish in the future.
Co-authors
The 12 scholars most cited alongside Leonard Berman, 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 | A fast algorithm for Steiner trees Hit paper breakdown → | 1981 | 899 |
| 2 | 1977 | 374 | |
| 3 | 1980 | 114 | |
| 4 | Polynomial reducibilities and complete sets. | 1977 | 89 |
| 5 | 1976 | 51 | |
| 6 | 1977 | 30 | |
| 7 | 1987 | 28 | |
| 8 | 1976 | 24 | |
| 9 | 1976 | 17 | |
| 10 | A global approach to circuit size reduction | 1988 | 17 |
| 11 | 1981 | 9 | |
| 12 | 1977 | 6 | |
| 13 | 1975 | 5 | |
| 14 | 1981 | 5 | |
| 15 | 1978 | 3 | |
| 16 | 2003 | 3 | |
| 17 | 1988 | 2 | |
| 18 | 2003 | 2 | |
| 19 | 2004 | 2 | |
| 20 | 1988 | 1 |
About Leonard Berman
Leonard Berman is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Management Science and Operations Research, Software and Hardware and Architecture, having authored 22 papers that have together received 1.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (9 papers), VLSI and FPGA Design Techniques (7 papers), semigroups and automata theory (5 papers), Computability, Logic, AI Algorithms (5 papers), Formal Methods in Verification (3 papers), Advanced Graph Theory Research (2 papers), Simulation Techniques and Applications (2 papers) and Logic, programming, and type systems (1 paper). The work is most often cited by research in Computational Theory and Mathematics (922 citations), Computer Networks and Communications (505 citations), Artificial Intelligence (198 citations), Computer Graphics and Computer-Aided Design (24 citations) and Electrical and Electronic Engineering (146 citations). Leonard Berman has collaborated with scholars based in United States. Frequent co-authors include George Markowsky, Lawrence T. Kou, Juris Hartmanis, Louise H. Trevillyan, Jik Hyun Chang, Óscar H. Ibarra, Bala Ravikumar, J. Hartmanis, Steven Rudich and Hung Cao. Their work appears in journals such as Theoretical Computer Science, SIAM Journal on Computing, Journal of Computer and System Sciences, Acta Informatica and Lecture notes in computer science.
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.