L. Berman

2.2k total citations · 1 hit paper
17 papers, 1.3k citations indexed

About

L. Berman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, L. Berman has authored 17 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 4 papers in Electrical and Electronic Engineering. Recurrent topics in L. Berman's work include semigroups and automata theory (5 papers), VLSI and FPGA Design Techniques (4 papers) and Advanced Database Systems and Queries (3 papers). L. Berman is often cited by papers focused on semigroups and automata theory (5 papers), VLSI and FPGA Design Techniques (4 papers) and Advanced Database Systems and Queries (3 papers). L. Berman collaborates with scholars based in United States. L. Berman's co-authors include George Markowsky, Lawrence T. Kou, Juris Hartmanis, Louise Trevillyan, Bala Ravikumar, Óscar H. Ibarra, J. Hartmanis, Robert Damiano, Hung Cao and David Jensen and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

L. Berman

17 papers receiving 1.2k citations

Hit Papers

A fast algorithm for Steiner trees 1981 2026 1996 2011 1981 250 500 750
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.

  1. A fast algorithm for Steiner trees
    1981 789 citations Lawrence T. Kou, George Markowsky et al. Acta Informatica profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
L. Berman United States 10 606 597 374 346 98 17 1.3k
Lawrence T. Kou United States 6 225 0.4× 656 1.1× 368 1.0× 135 0.4× 90 0.9× 9 1.0k
Thang Nguyen Bui United States 13 246 0.4× 370 0.6× 328 0.9× 269 0.8× 135 1.4× 19 863
Fǎnicǎ Gavril Israel 17 1.2k 2.1× 575 1.0× 183 0.5× 121 0.3× 78 0.8× 35 1.5k
Philip M. Spira United States 8 292 0.5× 679 1.1× 144 0.4× 179 0.5× 54 0.6× 17 941
Deng Tang China 16 308 0.5× 626 1.0× 501 1.3× 741 2.1× 106 1.1× 63 1.3k
Tsunehiko Kameda Canada 15 255 0.4× 524 0.9× 95 0.3× 217 0.6× 163 1.7× 56 817
Akers United States 6 586 1.0× 145 0.2× 470 1.3× 289 0.8× 436 4.4× 8 1.3k
Linda Pagli Italy 14 248 0.4× 244 0.4× 156 0.4× 147 0.4× 159 1.6× 74 613
Patrice Quinton France 14 282 0.5× 487 0.8× 228 0.6× 206 0.6× 565 5.8× 59 992
Torben Hagerup Germany 19 627 1.0× 502 0.8× 117 0.3× 636 1.8× 220 2.2× 65 1.3k

Countries citing papers authored by L. Berman

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of L. Berman

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

All Works

17 of 17 papers shown
1.
Cao, Hung, et al.. (2004). Distributed supply chain simulation using a generic job running framework. 1305–1312. 2 indexed citations
2.
Berman, L., Louise Trevillyan, & Daniël Brand. (2003). Applications of global flow analysis in logic synthesis. 901–904. 1 indexed citations
3.
4.
Damiano, Robert & L. Berman. (2002). Dual global flow. 49–53. 2 indexed citations
5.
Berman, L. & Louise Trevillyan. (1988). A global approach to circuit size reduction. 203–214. 15 indexed citations
6.
Ibarra, Óscar H., et al.. (1987). Some observations concerning alternating turing machines using small space. Information Processing Letters. 25(1). 1–9. 21 indexed citations
7.
Berman, L.. (1981). On Logic Comparison. Design Automation Conference. 854–861. 6 indexed citations
8.
Kou, Lawrence T., George Markowsky, & L. Berman. (1981). A fast algorithm for Steiner trees. Acta Informatica. 15(2). 141–145. 789 indexed citations breakdown →
9.
Berman, L.. (1980). The complexity of logical theories. Theoretical Computer Science. 11(1). 71–77. 81 indexed citations
10.
Hartmanis, Juris & L. Berman. (1978). On polynomial time isomorphisms of some new complete sets. Journal of Computer and System Sciences. 16(3). 418–422. 2 indexed citations
11.
Berman, L. & Juris Hartmanis. (1977). On Isomorphisms and Density of $NP$ and Other Complete Sets. SIAM Journal on Computing. 6(2). 305–322. 274 indexed citations
12.
13.
Berman, L.. (1977). Polynomial reducibilities and complete sets.. 57 indexed citations
14.
Hartmanis, Juris & L. Berman. (1976). On tape bounds for single letter alphabet language processing. Theoretical Computer Science. 3(2). 213–224. 15 indexed citations
15.
16.
Hartmanis, Juris & L. Berman. (1976). On isomorphisms and density of NP and other complete sets. 30–40. 15 indexed citations
17.
Hartmanis, J. & L. Berman. (1975). A note on tape bounds for sla language processing. 3. 65–70. 6 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

Breakdown of academic impact, for papers by Lawrence T. Kou Breakdown of academic impact, for papers by Thang Nguyen Bui Breakdown of academic impact, for papers by Fǎnicǎ Gavril Breakdown of academic impact, for papers by Philip M. Spira Breakdown of academic impact, for papers by Deng Tang Breakdown of academic impact, for papers by Tsunehiko Kameda Breakdown of academic impact, for papers by Akers Breakdown of academic impact, for papers by Linda Pagli Breakdown of academic impact, for papers by Patrice Quinton Breakdown of academic impact, for papers by Torben Hagerup
Rankless by CCL
2026