Name
Abstract | ||
|---|---|---|
We compare Random Access Machines with k or k +1 index registers and modifiable or non-modifiable programs and show for a simple problem of data transfer that the more prowerful versions are more efficient. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0890-5401(92)90078-T | Information and Computation |
Keywords | Field | DocType |
non-modifiable program,index register | Discrete mathematics,Kolmogorov complexity,Data transmission,Computer data storage,Computer science,Index register,Algorithm,Theoretical computer science,Turing machine,Cost analysis,Random access | Journal |
Volume | Issue | ISSN |
101 | 1 | Information and Computation |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kurt Mehlhorn | 1 | 5314 | 853.36 |
| Wolfgang J. Paul | 2 | 947 | 313.21 |
| Christian Uhrig | 3 | 739 | 99.73 |