L. 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
-
- semigroups and automata theory 6
- Advanced Graph Theory Research 4
- Computability, Logic, AI Algorithms 3
- Formal Methods in Verification 3
- Advanced Algebra and Logic 2
-
- Algorithms and Data Compression 3
- Co-authors
- Lawrence T. Kou (1 shared paper)George Markowsky (1 shared paper)Juris Hartmanis (4 shared papers)Louise Trevillyan (3 shared papers)Bala Ravikumar (1 shared paper)Óscar H. Ibarra (1 shared paper)J. Hartmanis (1 shared paper)Steven Rudich (1 shared paper)
- Journals
- Theoretical Computer Science (2 papers)Acta Informatica (1 paper)SIAM Journal on Computing (1 paper)Journal of Computer and System Sciences (1 paper)Lecture notes in computer science (2 papers)
- Partner nations
- United States
In The Last Decade
L. Berman
19 papers receiving 1.5k citations
L. Berman's Hit Papers
Peers
Comparison fields: 5 of 74
- Computational Theory and Mathematics 837
- Computer Networks and Communications 688
- Hardware and Architecture 113
- Artificial Intelligence 449
- Computer Graphics and Computer-Aided Design 45
Countries citing papers authored by L. Berman
This map shows the geographic impact of L. 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 L. Berman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. Berman more than expected).
Fields of papers citing papers by L. Berman
This network shows the impact of papers produced by L. 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 L. Berman. The network helps show where L. Berman may publish in the future.
Co-authors
The 11 scholars most cited alongside L. 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
| # | Work | ||
|---|---|---|---|
| 1 | A fast algorithm for Steiner trees Hit paper breakdown → | 1981 | 899 |
| 2 | 1977 | 371 | |
| 3 | 1980 | 107 | |
| 4 | Polynomial reducibilities and complete sets. | 1977 | 87 |
| 5 | 1976 | 52 | |
| 6 | 1977 | 31 | |
| 7 | 1987 | 28 | |
| 8 | 1976 | 23 | |
| 9 | A global approach to circuit size reduction | 1988 | 17 |
| 10 | 1976 | 17 | |
| 11 | 1981 | 10 | |
| 12 | 1975 | 7 | |
| 13 | 1977 | 7 | |
| 14 | 1978 | 4 | |
| 15 | 2003 | 2 | |
| 16 | 2004 | 2 | |
| 17 | 2002 | 2 | |
| 18 | 1988 | 2 | |
| 19 | 2003 | 1 | |
| 20 | 1988 | 1 |
About L. Berman
L. Berman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications and Hardware and Architecture, having authored 20 papers that have together received 1.7k indexed citations. Recurring topics across this work include semigroups and automata theory (6 papers), VLSI and FPGA Design Techniques (4 papers), Advanced Graph Theory Research (4 papers), Advanced Database Systems and Queries (3 papers), Algorithms and Data Compression (3 papers), Computability, Logic, AI Algorithms (3 papers), Formal Methods in Verification (3 papers) and Advanced Algebra and Logic (2 papers). The work is most often cited by research in Computational Theory and Mathematics (837 citations), Computer Networks and Communications (688 citations), Hardware and Architecture (113 citations), Artificial Intelligence (449 citations) and Computer Graphics and Computer-Aided Design (45 citations). L. Berman has collaborated with scholars based in United States. Frequent co-authors include Lawrence T. Kou, George Markowsky, Juris Hartmanis, Louise Trevillyan, Bala Ravikumar, Óscar H. Ibarra, J. Hartmanis, Steven Rudich, Daniël Brand and Robert Damiano. Their work appears in journals such as Theoretical Computer Science, Acta Informatica, SIAM Journal on Computing, Journal of Computer and System Sciences 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.