Citations per year, relative to M. R. Sleep M. R. Sleep (= 1×)
peers
Uwe Kastens
Countries citing papers authored by M. R. Sleep
Since
Specialization
Citations
This map shows the geographic impact of M. R. Sleep'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 M. R. Sleep with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. R. Sleep more than expected).
This network shows the impact of papers produced by M. R. Sleep. 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 M. R. Sleep. The network helps show where M. R. Sleep may publish in the future.
Co-authorship network of co-authors of M. R. Sleep
This figure shows the co-authorship network connecting the top 25 collaborators of M. R. Sleep.
A scholar is included among the top collaborators of M. R. Sleep 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 M. R. Sleep. M. R. Sleep is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sleep, M. R., et al.. (1993). Parallel execution of concurrent clean on ZAPP. 283–301.2 indexed citations
7.
Kennaway, Richard, et al.. (1993). Event structures and orthognal term graph rewriting. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–19.6 indexed citations
8.
Kennaway, Richard, et al.. (1993). The adequacy of term graph rewriting for simulating term rewriting. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 157–169.7 indexed citations
9.
Kennaway, Richard, et al.. (1993). An introduction to term graph rewriting. 1–13.2 indexed citations
10.
Kennaway, Richard, et al.. (1993). Event structures and orthogonal term graph rewriting. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 141–155.5 indexed citations
11.
Kennaway, Richard, et al.. (1993). Comparing curried and uncurried rewriting. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands.1 indexed citations
12.
Kennaway, Richard, et al.. (1990). An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–12.5 indexed citations
13.
Kennaway, Richard, Jan Willem Klop, & M. R. Sleep. (1990). Transfinite reductions in orthogonal term rewriting systems (extended abstract). Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–12.7 indexed citations
14.
Kennaway, Richard, Jan Willem Klop, & M. R. Sleep. (1990). Transfinite reductions in orthogonal term rewriting systems.6 indexed citations
Glauert, John, Richard Kennaway, & M. R. Sleep. (1987). DACTL: A computational model and compiler target language based on graph reduction. UEA Digital Repository (University of East Anglia). 5(3). 509–537.12 indexed citations
Sleep, M. R. & F. Warren Burton. (1981). Towards a Zero Assignment Parallel Processor.. International Conference on Distributed Computing Systems. 80–85.6 indexed citations
20.
Keller, Robert & M. R. Sleep. (1981). Applicative caching. UEA Digital Repository (University of East Anglia). 131–140.10 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.