Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Assessing the effects of gamification in the classroom: A longitudinal study on intrinsic motivation, social comparison, satisfaction, effort, and academic performance
This map shows the geographic impact of Michael Hanus'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 Michael Hanus with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Hanus more than expected).
This network shows the impact of papers produced by Michael Hanus. 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 Michael Hanus. The network helps show where Michael Hanus may publish in the future.
Co-authorship network of co-authors of Michael Hanus
This figure shows the co-authorship network connecting the top 25 collaborators of Michael Hanus.
A scholar is included among the top collaborators of Michael Hanus 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 Michael Hanus. Michael Hanus is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Albert, Elvira, Michael Hanus, Frank Huch, Javier Oliver, & Germán Vidal. (2002). Operational Semantics for Lazy Functional Logic Programs.1 indexed citations
8.
Hanus, Michael. (2000). Server Side Web Scripting in Curry.. 366–381.2 indexed citations
9.
Hanus, Michael & Frank Steiner. (1998). Controlling search in functional logic programs. RWTH Publications (RWTH Aachen). 347–348.1 indexed citations
10.
Hanus, Michael. (1997). Multi-paradigm declarative programming (tutorial). International Conference on Logic Programming. 43–45.1 indexed citations
11.
Hanus, Michael. (1997). A Unified Computation Model for Declarative Programming.. 9–24.4 indexed citations
12.
Hanus, Michael. (1994). Lazy Unification with Simplification. Max Planck Institute for Plasma Physics. 272–286.5 indexed citations
13.
Hanus, Michael, et al.. (1993). A Debugging Model for Functional Logic Programs. OpenGrey (Institut de l'Information Scientifique et Technique). 28–43.6 indexed citations
Hanus, Michael. (1993). Analysis of nonlinear constraints in CLP( R ). MPG.PuRe (Max Planck Society). 83–99.12 indexed citations
16.
Hanus, Michael. (1992). Improving Control of Logic Programs by Using Functional Logic Languages. Max Planck Institute for Plasma Physics. 1–23.17 indexed citations
17.
Hanus, Michael. (1992). On the Completeness of Residuation. Max Planck Institute for Plasma Physics. 192–206.9 indexed citations
18.
Hanus, Michael. (1992). An abstract interpretation algorithm for residuating logic programs. MPG.PuRe (Max Planck Society). 304–312.1 indexed citations
19.
Hanus, Michael. (1989). Polymorphic High-Order Programming in Prolog.. International Conference on Lightning Protection. 382–397.1 indexed citations
20.
Hanus, Michael. (1988). Horn Clause Specifications with Polymorphic Types.. Annals of Telecommunications.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.