Andreas Malcher

1.0k total citations
58 papers, 264 citations indexed

About

Andreas Malcher is a scholar working on Computational Theory and Mathematics, Molecular Biology and Artificial Intelligence. According to data from OpenAlex, Andreas Malcher has authored 58 papers receiving a total of 264 indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Computational Theory and Mathematics, 39 papers in Molecular Biology and 32 papers in Artificial Intelligence. Recurrent topics in Andreas Malcher's work include semigroups and automata theory (48 papers), DNA and Biological Computing (37 papers) and Cellular Automata and Applications (18 papers). Andreas Malcher is often cited by papers focused on semigroups and automata theory (48 papers), DNA and Biological Computing (37 papers) and Cellular Automata and Applications (18 papers). Andreas Malcher collaborates with scholars based in Germany, Italy and France. Andreas Malcher's co-authors include Martin Kutrib, Detlef Wotschke, Carlo Mereghetti, Hing Leung, Jonathan Goldstine, Martin Kappes, Beatrice Palano, Chandra M. R. Kintala, Markus Holzer and Henning Bordihn and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Andreas Malcher

48 papers receiving 242 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Andreas Malcher Germany	8	240	168	167	11	9	58	264
Michel Latteux France	9	283 1.2×	199 1.2×	132 0.8×	11 1.0×	4 0.4×	54	307
Carlo Mereghetti Italy	12	335 1.4×	300 1.8×	155 0.9×	9 0.8×	7 0.8×	47	367
Beatrice Palano Italy	11	207 0.9×	190 1.1×	72 0.4×	12 1.1×	7 0.8×	40	235
Detlef Wotschke United States	8	221 0.9×	188 1.1×	119 0.7×	12 1.1×	6 0.7×	20	240
Rogério Reis Portugal	7	129 0.5×	109 0.6×	72 0.4×	8 0.7×	2 0.2×	55	167
Hing Leung United States	9	220 0.9×	186 1.1×	105 0.6×	9 0.8×	2 0.2×	19	227
Shinnosuke Seki Japan	8	100 0.4×	82 0.5×	102 0.6×	8 0.7×	17 1.9×	43	155
Martin Plátek Czechia	8	86 0.4×	124 0.7×	82 0.5×	7 0.6×	6 0.7×	40	163
Symeon Bozapalidis Greece	12	268 1.1×	217 1.3×	39 0.2×	6 0.5×	5 0.6×	31	291
Cezar Câmpeanu Canada	8	175 0.7×	172 1.0×	93 0.6×	8 0.7×	3 0.3×	28	211

Countries citing papers authored by Andreas Malcher

Since Specialization

Citations

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

Fields of papers citing papers by Andreas Malcher

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andreas Malcher

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Malcher. A scholar is included among the top collaborators of Andreas Malcher 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 Andreas Malcher. Andreas Malcher 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

Malcher, Andreas, et al.. (2023). Herausforderungen und Perspektiven bei der BIM‐Planung von Brücken – das Beispiel der Geh‐ und Radwegüberführung Riederwald. Bautechnik. 100(7). 396–405. 1 indexed citations

Axelsen, Holger Bock, et al.. (2020). Boosting Reversible Pushdown and Queue Machines by Preprocessing. International Journal of Foundations of Computer Science. 31(8). 1021–1049.

Kutrib, Martin, et al.. (2019). Transducing reversibly with finite state machines. Theoretical Computer Science. 787. 111–126. 1 indexed citations

Kutrib, Martin & Andreas Malcher. (2016). One-way reversible multi-head finite automata. Theoretical Computer Science. 682. 149–164. 7 indexed citations

Kutrib, Martin, et al.. (2016). Set Automata. International Journal of Foundations of Computer Science. 27(2). 187–214. 4 indexed citations

Kutrib, Martin, et al.. (2015). Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theoretical Computer Science. 578. 58–71. 9 indexed citations

Malcher, Andreas & Giovanni Pighizzini. (2013). Descriptional complexity of bounded context-free languages. Information and Computation. 227. 1–20. 2 indexed citations

Kutrib, Martin & Andreas Malcher. (2012). The Size Impact of Little Iterative Array Resources.. 7. 489–507. 1 indexed citations

Malcher, Andreas, Carlo Mereghetti, & Beatrice Palano. (2012). Descriptional complexity of two-way pushdown automata with restricted head reversals. Theoretical Computer Science. 449. 119–133. 11 indexed citations

10.

Kutrib, Martin & Andreas Malcher. (2011). Reversible pushdown automata. Journal of Computer and System Sciences. 78(6). 1814–1827. 15 indexed citations

11.

Holzer, Markus, Martin Kutrib, & Andreas Malcher. (2010). Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science. 412(1-2). 83–96. 17 indexed citations

12.

Kutrib, Martin, et al.. (2010). The Size of One-Way Cellular Automata. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AL,...(Proceedings). 1 indexed citations

13.

Kutrib, Martin, et al.. (2009). Regulated nondeterminism in pushdown automata. Theoretical Computer Science. 410(37). 3447–3460. 2 indexed citations

14.

Kutrib, Martin & Andreas Malcher. (2008). Fast reversible language recognition using cellular automata. Information and Computation. 206(9-10). 1142–1151. 7 indexed citations

15.

Malcher, Andreas, Carlo Mereghetti, & Beatrice Palano. (2008). Sublinearly Space Bounded Iterative Arrays.. Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt). 292–301. 1 indexed citations

16.

Kutrib, Martin & Andreas Malcher. (2007). Context-dependent nondeterminism for pushdown automata. Theoretical Computer Science. 376(1-2). 101–111. 1 indexed citations

17.

Malcher, Andreas. (2004). On two-way communication in cellular automata with a fixed number of cells. Theoretical Computer Science. 330(2). 325–338. 1 indexed citations

18.

Malcher, Andreas. (2004). On the Descriptional Complexity of Iterative Arrays. IEICE Transactions on Information and Systems. 87(3). 721–725. 8 indexed citations

19.

Goldstine, Jonathan, Martin Kappes, Chandra M. R. Kintala, et al.. (2002). Descriptional Complexity of Machines with Limited Resources.. JUCS - Journal of Universal Computer Science. 8. 193–234. 47 indexed citations

20.

Malcher, Andreas. (2002). On One-Way Cellular Automata with a Fixed Number of Cells.. Fundamenta Informaticae. 58(3). 160–173. 4 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