Norbert Blüm

725 total citations
22 papers, 301 citations indexed

About

Norbert Blüm is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Norbert Blüm has authored 22 papers receiving a total of 301 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 5 papers in Molecular Biology. Recurrent topics in Norbert Blüm's work include Advanced Graph Theory Research (7 papers), semigroups and automata theory (6 papers) and Algorithms and Data Compression (5 papers). Norbert Blüm is often cited by papers focused on Advanced Graph Theory Research (7 papers), semigroups and automata theory (6 papers) and Algorithms and Data Compression (5 papers). Norbert Blüm collaborates with scholars based in Germany and United States. Norbert Blüm's co-authors include Kurt Mehlhorn, Michael T. Y. Paul, Hans Wilhelm Alt, Robert J. Koch, Yan Liang and Hans Friedrich Zacher and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Algorithms.

In The Last Decade

Norbert Blüm

21 papers receiving 270 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Norbert Blüm Germany 7 182 145 98 43 37 22 301
Peter Emde Boas Netherlands 2 117 0.6× 179 1.2× 125 1.3× 34 0.8× 62 1.7× 2 325
Mark R. Brown United States 7 83 0.5× 157 1.1× 103 1.1× 18 0.4× 43 1.2× 9 244
Glenn K. Manacher United States 9 165 0.9× 122 0.8× 83 0.8× 20 0.5× 31 0.8× 22 324
Omer Berkman United States 9 194 1.1× 253 1.7× 119 1.2× 32 0.7× 34 0.9× 17 396
Naomi Nishimura Canada 12 300 1.6× 79 0.5× 180 1.8× 27 0.6× 16 0.4× 34 385
Martti Penttonen Finland 10 162 0.9× 216 1.5× 103 1.1× 30 0.7× 24 0.6× 29 337
Oded Margalit Israel 10 218 1.2× 109 0.8× 184 1.9× 15 0.3× 41 1.1× 20 372
Richard Schroeppel United States 7 68 0.4× 149 1.0× 78 0.8× 24 0.6× 14 0.4× 11 241
Oliver Kullmann United Kingdom 10 267 1.5× 185 1.3× 137 1.4× 25 0.6× 17 0.5× 23 357
Dorit Dor Israel 6 128 0.7× 95 0.7× 45 0.5× 72 1.7× 11 0.3× 10 250

Countries citing papers authored by Norbert Blüm

Since Specialization
Citations

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

Fields of papers citing papers by Norbert Blüm

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Norbert Blüm

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

All Works

20 of 20 papers shown
1.
Blüm, Norbert. (2004). Der Generationenvertrag. Rechtsgeschichte - Legal History. 2004(5). 21–28. 1 indexed citations
2.
Blüm, Norbert. (2004). Algorithmen und Datenstrukturen. Oldenbourg Wissenschaftsverlag eBooks. 2 indexed citations
3.
Blüm, Norbert. (2001). On parsing LL-languages. Theoretical Computer Science. 267(1-2). 49–59. 1 indexed citations
4.
Blüm, Norbert. (2001). Theoretische Informatik. 1 indexed citations
5.
Blüm, Norbert. (2001). A Simplified Realization of the Hopcroft-Karp Approach to Maximum Matching in General Graphs. 5 indexed citations
6.
Blüm, Norbert. (2000). Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. Journal of Algorithms. 35(2). 129–168. 1 indexed citations
7.
Blüm, Norbert & Robert J. Koch. (1999). Greibach Normal Form Transformation Revisited. Information and Computation. 150(1). 112–118. 18 indexed citations
8.
Blüm, Norbert. (1996). An O(n log n) implementation of the standard method for minimizing n-state finite automata. Information Processing Letters. 57(2). 65–69. 11 indexed citations
9.
Liang, Yan & Norbert Blüm. (1995). Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits. Information Processing Letters. 56(4). 215–219. 16 indexed citations
10.
Blüm, Norbert, et al.. (1989). Wie kann die Langzeitarbeitslosigkeit abgebaut werden. Wirtschaftsdienst. 69(7). 323–331. 1 indexed citations
11.
Blüm, Norbert & Hans Friedrich Zacher. (1989). 40 Jahre Sozialstaat Bundesrepublik Deutschland. Medical Entomology and Zoology. 1 indexed citations
12.
Blüm, Norbert. (1986). On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. SIAM Journal on Computing. 15(4). 1021–1024. 34 indexed citations
13.
Blüm, Norbert. (1985). An Ω(n43) lower bound on the monotone network complexity of the nth degree convolution. Theoretical Computer Science. 36. 59–69. 3 indexed citations
14.
Blüm, Norbert. (1985). An area-maximum edge length trade-off for VSLI layout. Information and Control. 66(1-2). 45–52. 3 indexed citations
15.
Blüm, Norbert. (1984). An area-maximum edge length tradeoff for VLSI layout. 92–97. 6 indexed citations
16.
Blüm, Norbert. (1983). More on the power of chain rules in context-free grammars. Theoretical Computer Science. 27(3). 287–295. 4 indexed citations
17.
Blüm, Norbert. (1983). A Boolean function requiring 3n network size. Theoretical Computer Science. 28(3). 337–345. 58 indexed citations
18.
Blüm, Norbert. (1983). A note on the ‘parallel computation thesis’. Information Processing Letters. 17(4). 203–205. 3 indexed citations
19.
Blüm, Norbert. (1982). On the power of chain rules in context free grammars. Acta Informatica. 17(4). 1 indexed citations
20.
Blüm, Norbert & Kurt Mehlhorn. (1980). On the average number of rebalancing operations in weight-balanced trees. Theoretical Computer Science. 11(3). 303–320. 39 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 Peter Emde Boas Breakdown of academic impact, for papers by Mark R. Brown Breakdown of academic impact, for papers by Glenn K. Manacher Breakdown of academic impact, for papers by Omer Berkman Breakdown of academic impact, for papers by Naomi Nishimura Breakdown of academic impact, for papers by Martti Penttonen Breakdown of academic impact, for papers by Oded Margalit Breakdown of academic impact, for papers by Richard Schroeppel Breakdown of academic impact, for papers by Oliver Kullmann Breakdown of academic impact, for papers by Dorit Dor
Rankless by CCL
2026