Hans Kleine Büning

1.6k total citations
59 papers, 612 citations indexed

About

Hans Kleine Büning is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Hans Kleine Büning has authored 59 papers receiving a total of 612 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 40 papers in Artificial Intelligence and 12 papers in Computer Networks and Communications. Recurrent topics in Hans Kleine Büning's work include Formal Methods in Verification (20 papers), Logic, Reasoning, and Knowledge (19 papers) and Logic, programming, and type systems (14 papers). Hans Kleine Büning is often cited by papers focused on Formal Methods in Verification (20 papers), Logic, Reasoning, and Knowledge (19 papers) and Logic, programming, and type systems (14 papers). Hans Kleine Büning collaborates with scholars based in Germany, China and United States. Hans Kleine Büning's co-authors include Marek Karpiński, Alexander Maier, Asmir Vodenčarević, Oliver Niggemann, Chuan-Kang Ting, Maik Anderka, K. Subramani, Uwe Kastens, Michael Baumann and Oliver Krämer and has published in prestigious journals such as Artificial Intelligence, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Hans Kleine Büning

53 papers receiving 557 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Hans Kleine Büning Germany 12 384 363 147 89 55 59 612
Davide Bresolin Italy 13 328 0.9× 344 0.9× 181 1.2× 101 1.1× 61 1.1× 58 593
Hans van Maaren Netherlands 11 294 0.8× 274 0.8× 174 1.2× 79 0.9× 13 0.2× 33 520
Franck Cassez France 13 447 1.2× 162 0.4× 171 1.2× 97 1.1× 57 1.0× 51 596
Philippe Darondeau France 14 522 1.4× 250 0.7× 267 1.8× 37 0.4× 29 0.5× 41 638
Enrico Giunchiglia Italy 19 325 0.8× 972 2.7× 253 1.7× 109 1.2× 19 0.3× 71 1.1k
Daniel R. Tauritz United States 12 143 0.4× 299 0.8× 105 0.7× 56 0.6× 52 0.9× 79 488
Gianfranco Lamperti Italy 11 368 1.0× 181 0.5× 97 0.7× 53 0.6× 136 2.5× 50 553
François Laroussinie France 11 482 1.3× 326 0.9× 115 0.8× 260 2.9× 23 0.4× 27 701
Ansgar Fehnker Australia 10 291 0.8× 109 0.3× 68 0.5× 137 1.5× 56 1.0× 35 434
Béatrice Bérard France 11 521 1.4× 256 0.7× 172 1.2× 246 2.8× 29 0.5× 31 760

Countries citing papers authored by Hans Kleine Büning

Since Specialization
Citations

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

Fields of papers citing papers by Hans Kleine Büning

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hans Kleine Büning. 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 Hans Kleine Büning. The network helps show where Hans Kleine Büning may publish in the future.

Co-authorship network of co-authors of Hans Kleine Büning

This figure shows the co-authorship network connecting the top 25 collaborators of Hans Kleine Büning. A scholar is included among the top collaborators of Hans Kleine Büning 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 Hans Kleine Büning. Hans Kleine Büning 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.
Niggemann, Oliver, Benno Stein, Asmir Vodenčarević, Alexander Maier, & Hans Kleine Büning. (2021). Learning Behavior Models for Hybrid Timed Systems. Proceedings of the AAAI Conference on Artificial Intelligence. 26(1). 1083–1090. 11 indexed citations
2.
Büning, Hans Kleine, et al.. (2019). New Results on Cutting Plane Proofs for Horn Constraint Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
3.
Büning, Hans Kleine, et al.. (2018). Finding read-once resolution refutations in systems of 2CNF clauses. Theoretical Computer Science. 729. 42–56. 7 indexed citations
4.
Büning, Hans Kleine, et al.. (2015). Learning Boolean specifications. Artificial Intelligence. 229. 246–257. 1 indexed citations
5.
Büning, Hans Kleine, et al.. (2012). Encoding Nested Boolean Functions as Quantified Boolean Formulas. 8(1-2). 101–116. 1 indexed citations
6.
Büning, Hans Kleine, et al.. (2011). Coordination in Large Multiagent Reinforcement Learning Problems. 236–239. 1 indexed citations
7.
Büning, Hans Kleine, et al.. (2008). Computational complexity of quantified Boolean formulas with fixed maximal deficiency. Theoretical Computer Science. 407(1-3). 448–457. 1 indexed citations
8.
Büning, Hans Kleine, et al.. (2007). The Complexity of Some Subclasses of Minimal Unsatisfiable Formulas. 3(1-2). 1–17. 10 indexed citations
9.
Büning, Hans Kleine, et al.. (2007). Models and quantifier elimination for quantified Horn formulas. Discrete Applied Mathematics. 156(10). 1606–1622. 4 indexed citations
10.
Büning, Hans Kleine, et al.. (2007). An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas. 3(3-4). 115–123. 1 indexed citations
11.
Büning, Hans Kleine, et al.. (2005). Towards Online Partitioning of Agent Sets based on Local Information.. 674–679. 4 indexed citations
12.
Büning, Hans Kleine. (2000). On subclasses of minimal unsatisfiable formulas. Discrete Applied Mathematics. 107(1-3). 83–98. 32 indexed citations
13.
Büning, Hans Kleine, et al.. (1999). Propositional Logic: Deduction and Algorithms. Cambridge University Press eBooks. 101 indexed citations
14.
Büning, Hans Kleine, et al.. (1999). Resolution remains hard under equivalence. Discrete Applied Mathematics. 96-97. 139–148. 2 indexed citations
15.
Büning, Hans Kleine, et al.. (1995). Resolution for Quantified Boolean Formulas. Information and Computation. 117(1). 12–18. 144 indexed citations
16.
Büning, Hans Kleine, et al.. (1989). Optimizing propositional calculus formulas with regard to questions of deducibility. Information and Computation. 80(1). 18–43. 4 indexed citations
17.
Büning, Hans Kleine, et al.. (1989). Projections of vector addition system reachability sets are semilinear. Theoretical Computer Science. 64(3). 343–350. 4 indexed citations
18.
Büning, Hans Kleine. (1983). The early bird problem is unsolvable in a one-dimensional cellular space with 4 states.. Acta Cybernetica. 6. 23–31. 1 indexed citations
19.
Börger, Egon & Hans Kleine Büning. (1980). The reachability problem for Petri nets and decision problems for Skolem arithmetic. Theoretical Computer Science. 11(2). 123–143.
20.
Büning, Hans Kleine & Thomas Ottmann. (1977). Kleine universelle mehrdimensionale Turingmaschinen.. Journal of automata, languages and combinatorics. 13. 179–201. 5 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

Rankless by CCL
2026