Karl Abrahamson

1.1k total citations
23 papers, 553 citations indexed

About

Karl Abrahamson is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Karl Abrahamson has authored 23 papers receiving a total of 553 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Karl Abrahamson's work include Complexity and Algorithms in Graphs (9 papers), semigroups and automata theory (8 papers) and Algorithms and Data Compression (6 papers). Karl Abrahamson is often cited by papers focused on Complexity and Algorithms in Graphs (9 papers), semigroups and automata theory (8 papers) and Algorithms and Data Compression (6 papers). Karl Abrahamson collaborates with scholars based in Canada and United States. Karl Abrahamson's co-authors include David Kirkpatrick, Teresa M. Przytycka, Lisa Highám, Michael R. Fellows, David Kirkpatrick, Bernard M. E. Moret, Michael A. Langston and John Ellis and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Journal of Computer and System Sciences.

In The Last Decade

Karl Abrahamson

22 papers receiving 512 citations

Peers

Karl Abrahamson
Omer Berkman United States
Rüdiger Reischuk Germany
Theis Rauhe Denmark
Leslie M. Goldschlager Australia
Martti Penttonen Finland
Peter Emde Boas Netherlands
Ivan M. Havel Czechia
Amir Abboud United States
Paul F. Dietz United States
Manuela Fischer Switzerland
Omer Berkman United States
Karl Abrahamson
Citations per year, relative to Karl Abrahamson Karl Abrahamson (= 1×) peers Omer Berkman

Countries citing papers authored by Karl Abrahamson

Since Specialization
Citations

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

Fields of papers citing papers by Karl Abrahamson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Karl Abrahamson

This figure shows the co-authorship network connecting the top 25 collaborators of Karl Abrahamson. A scholar is included among the top collaborators of Karl Abrahamson 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 Karl Abrahamson. Karl Abrahamson 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.
Abrahamson, Karl, et al.. (2003). Parallel self-reducibility. 67–70.
2.
Highám, Lisa, et al.. (1997). Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. Journal of Algorithms. 23(2). 291–328. 2 indexed citations
3.
Abrahamson, Karl, et al.. (1994). Tight lower bounds for probabilistic solitude verification on anonymous rings. Journal of the ACM. 41(2). 277–310. 5 indexed citations
4.
Abrahamson, Karl, Michael R. Fellows, Michael A. Langston, & Bernard M. E. Moret. (1991). Constructive complexity. Discrete Applied Mathematics. 34(1-3). 3–16. 2 indexed citations
5.
Abrahamson, Karl. (1991). Time-space tradeoffs for algebraic problems on general sequential machines. Journal of Computer and System Sciences. 43(2). 269–289. 14 indexed citations
6.
Abrahamson, Karl, et al.. (1990). Optimal Algorithms for Probalistic Solitude Detection On Anomymous Rings. 1 indexed citations
7.
Abrahamson, Karl. (1990). On the modality of convex polygons. Discrete & Computational Geometry. 5(4). 409–419. 2 indexed citations
8.
Abrahamson, Karl, et al.. (1989). On the Complexity of Fixed Parameter Problems (Extended Abstract). 210–215. 2 indexed citations
9.
Abrahamson, Karl, et al.. (1989). Randomized function evaluation on a ring. Distributed Computing. 3(3). 107–117. 7 indexed citations
10.
Abrahamson, Karl, et al.. (1989). The Bit Complexity of Randomized Leader Election on a Ring. SIAM Journal on Computing. 18(1). 12–29. 11 indexed citations
11.
Abrahamson, Karl, et al.. (1989). A simple parallel tree contraction algorithm. Journal of Algorithms. 10(2). 287–302. 159 indexed citations
12.
Abrahamson, Karl, et al.. (1989). On the complexity of fixed parameter problems. 210–215. 13 indexed citations
13.
Abrahamson, Karl. (1988). Randomized evaluation on a ring. 312. 324–331. 4 indexed citations
14.
Abrahamson, Karl, et al.. (1987). A Parallel Tree Contraction Algorithm. 3 indexed citations
15.
Abrahamson, Karl. (1987). Generalized String Matching. SIAM Journal on Computing. 16(6). 1039–1051. 165 indexed citations
16.
Abrahamson, Karl, et al.. (1987). Probabilistic Solitude Detection II: Ring Size Known Exactly. 2 indexed citations
17.
Abrahamson, Karl. (1987). Succinct representation of regular sets using gotos and boolean variables. Journal of Computer and System Sciences. 34(1). 129–148. 3 indexed citations
18.
19.
Abrahamson, Karl, et al.. (1986). Probabilistic solitude verification on a ring. 161–173. 13 indexed citations
20.
Abrahamson, Karl. (1980). Decidability and expressiveness of logics of processes. Defense Technical Information Center (DTIC). 40 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 Omer Berkman Breakdown of academic impact, for papers by Rüdiger Reischuk Breakdown of academic impact, for papers by Theis Rauhe Breakdown of academic impact, for papers by Leslie M. Goldschlager Breakdown of academic impact, for papers by Martti Penttonen Breakdown of academic impact, for papers by Peter Emde Boas Breakdown of academic impact, for papers by Ivan M. Havel Breakdown of academic impact, for papers by Amir Abboud Breakdown of academic impact, for papers by Paul F. Dietz Breakdown of academic impact, for papers by Manuela Fischer
Rankless by CCL
2026