Register Machines
Register Machines is a theoretical computational model in the class of abstract machines, distinguished by its use of a finite number of discrete registers, each capable of storing a single natural number, to perform computations through a finite set of arithmetic and control operations.
89
Publications
4.6K
Citations
173
Authors
94
Institutions
Publications per year
2017–2026
11
Parents
89
The Generation of Optimal Code for Arithmetic Expressions
Ravi Sethi, Jeffrey D. Ullman · Journal of the ACM · 1970 · 295 citations · Full text
Robert I. Soare · Bulletin of Symbolic Logic · 1996 · 271 citations · Full text
Optimal Code Generation for Expression Trees
Alfred V. Aho, S. C. Johnson · Journal of the ACM · 1976 · 242 citations · Full text
Complete Register Allocation Problems
Ravi Sethi · SIAM Journal on Computing · 1975 · 201 citations
1–5 of 89
173
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 173
94
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
7 publications
267 citations

TU Wien
Vienna, Austria
4 h-index
4 publications
93 citations

Universidad de Sevilla
Seville, Spain
3 h-index
5 publications
64 citations
Institute of Mathematics and Computer Science
Chisinau, Moldova
3 h-index
3 publications
33 citations
Princeton University
Princeton, United States
3 h-index
4 publications
628 citations

Pennsylvania State University
State College, United States
3 h-index
4 publications
463 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
100 citations

Trinity College Dublin
Dublin, Ireland
2 h-index
9 publications
304 citations
1–8 of 94
JACM · 6 publications · 690 citations
6
h-index
3 publications · 100 citations
3
h-index
2 publications · 24 citations
2
h-index
2 publications · 173 citations
2
h-index
2 publications · 287 citations
2
h-index
1–5