Manfred Kufleitner

610 total citations
30 papers, 98 citations indexed

About

Manfred Kufleitner is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Manfred Kufleitner has authored 30 papers receiving a total of 98 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 3 papers in Molecular Biology. Recurrent topics in Manfred Kufleitner's work include semigroups and automata theory (24 papers), Logic, programming, and type systems (13 papers) and Advanced Algebra and Logic (8 papers). Manfred Kufleitner is often cited by papers focused on semigroups and automata theory (24 papers), Logic, programming, and type systems (13 papers) and Advanced Algebra and Logic (8 papers). Manfred Kufleitner collaborates with scholars based in Germany, France and United Kingdom. Manfred Kufleitner's co-authors include Volker Diekert, Paul Gastin, Martin Horsch, Ph. Schnoebelen, Pascal Weil, Bodo Manthey, Gerhard Rosenberger, Mahmoud Fouz, Benjamin Steinberg and Ulrich Hertrampf and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Algorithmica.

In The Last Decade

Manfred Kufleitner

24 papers receiving 97 citations

Peers

Manfred Kufleitner

CTM

AI

MB

GT

DMC

Sylvain Lombardy France

Cyril Nicaud France

Georg Zetzsche Germany

Joost J. Joosten Spain

Dirk Siefkes Germany

Szymon Toruńczyk Poland

Jean-Michel Autebert France

Arseny M. Shur Russia

Pascal Tesson Canada

Klaus-Jörn Lange Germany

Sylvain Lombardy France

Manfred Kufleitner

130 ×1.5

CTM

100 ×1.3

AI

24 ×2.0

MB

10 ×1.1

GT

4 ×0.6

DMC

Citations per year, relative to Manfred Kufleitner Manfred Kufleitner (= 1×) peers Sylvain Lombardy

Countries citing papers authored by Manfred Kufleitner

Since Specialization

Citations

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

Fields of papers citing papers by Manfred Kufleitner

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Manfred Kufleitner

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Almeida, Jorge, et al.. (2018). Nilpotency and strong nilpotency for finite semigroups. The Quarterly Journal of Mathematics. 70(2). 619–648. 1 indexed citations

2.

Kufleitner, Manfred & Tobias Walter. (2017). Level Two of the Quantifier Alternation Hierarchy Over Infinite Words. Theory of Computing Systems. 62(3). 467–480.

3.

Diekert, Volker, Artur Jeż, & Manfred Kufleitner. (2016). Solutions of word equations over partially commutative structures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations

4.

Kufleitner, Manfred, et al.. (2016). The Half-Levels of the FO2 Alternation Hierarchy. Theory of Computing Systems. 61(2). 352–370.

5.

Diekert, Volker & Manfred Kufleitner. (2015). A survey on the local divisor technique. Theoretical Computer Science. 610. 13–23. 1 indexed citations

6.

Kufleitner, Manfred, et al.. (2014). On the index of Simon's congruence for piecewise testability. Information Processing Letters. 115(4). 515–519. 8 indexed citations

7.

Diekert, Volker & Manfred Kufleitner. (2013). Omega-Rational Expressions with Bounded Synchronization Delay. Theory of Computing Systems. 56(4). 686–696. 2 indexed citations

8.

Kufleitner, Manfred, et al.. (2013). Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

9.

Diekert, Volker, Manfred Kufleitner, & Gerhard Rosenberger. (2013). Diskrete algebraische Methoden. 1 indexed citations

10.

Diekert, Volker, Manfred Kufleitner, & Pascal Weil. (2012). Star-free languages are Church–Rosser congruential. Theoretical Computer Science. 454. 129–135. 4 indexed citations

11.

Kufleitner, Manfred & Pascal Weil. (2012). On logical hierarchies within FO^2-definable languages. Logical Methods in Computer Science. 8. 1 indexed citations

12.

Kufleitner, Manfred, et al.. (2012). AROUND DOT-DEPTH ONE. International Journal of Foundations of Computer Science. 23(6). 1323–1339. 5 indexed citations

13.

Fouz, Mahmoud, et al.. (2011). On Smoothed Analysis of Quicksort and Hoare’s Find. Algorithmica. 62(3-4). 879–905. 7 indexed citations

14.

Kufleitner, Manfred, et al.. (2011). Languages of Dot-Depth One over Infinite Words. 22. 23–32. 4 indexed citations

15.

Kufleitner, Manfred, et al.. (2011). PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA. International Journal of Foundations of Computer Science. 22(8). 1861–1876. 2 indexed citations

16.

Diekert, Volker & Manfred Kufleitner. (2010). Fragments of First-Order Logic over Infinite Words. Theory of Computing Systems. 48(3). 486–516. 4 indexed citations

17.

Diekert, Volker & Manfred Kufleitner. (2009). Fragments of First-Order Logic over Infinite Words (Extended Abstract). INRIA a CCSD electronic archive server. 325–336. 1 indexed citations

18.

Diekert, Volker & Manfred Kufleitner. (2009). Fragments of First-Order Logic over Infinite Words. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3. 325–336.

19.

Diekert, Volker, Martin Horsch, & Manfred Kufleitner. (2007). On First-Order Fragments for Mazurkiewicz Traces. Fundamenta Informaticae. 80(1). 1–29. 8 indexed citations

20.

Kufleitner, Manfred. (2007). Polynomials, fragments of temporal logic and the variety DA over traces. Theoretical Computer Science. 376(1-2). 89–100. 2 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