Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,668,867 papers from all fields of science
Search
Sign In
Create Free Account
Random-access machine
Known as:
RAM model
, RAM machines
, Random Access Machine
Expand
In computer science, random-access machine (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Abstract machine
Andrey Ershov
Arthur Burks
Bit-reversal permutation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Algorithms for Bivariate Majority Depth
Dan Chen
,
Pat Morin
Canadian Conference on Computational Geometry
2011
Corpus ID: 7004372
The majority depth of a point with respect to a point set is the number of major sides it is in. An algorithm for majority depth…
Expand
2009
2009
On approximating the ideal random access machine by physical machines
G. Bilardi
,
K. Ekanadham
,
P. Pattnaik
JACM
2009
Corpus ID: 10784332
The capability of the Random Access Machine (RAM) to execute any instruction in constant time is not realizable, due to…
Expand
2008
2008
Chapter 7 The “Programming Language” of Dynamic Self-Assembly
A. M. Bouchard
,
C. Warrender
,
G. Osbourn
2008
Corpus ID: 60480918
2001
2001
A Generic NP-hardness Proof for a Variant of Graph Coloring
H. Bodlaender
Journal of universal computer science (Online)
2001
Corpus ID: 14631183
In this note, a direct proof is given of the NP-completeness of a variant of GRAPH COLORING, i.e., a generic proof is given…
Expand
1989
1989
Some problems and results in the theory of actually computable functions (preliminary abstract)
W. Maass
,
T. Slaman
1989
Corpus ID: 62374101
1987
1987
Improved Bounds for Covering General Polygons with Rectangles
C. Levcopoulos
Foundations of Software Technology and…
1987
Corpus ID: 52856365
During the fabrication of masks for integrated circuits, the polygons on the pattern generator must be covered by rectangles…
Expand
1985
1985
On Efficient Recognition of Transductions and Relations
O. Ibarra
,
M. Palis
,
J. Chang
Theoretical Computer Science
1985
Corpus ID: 39022431
1982
1982
On Some Decision Problems for RAM Programs
O. Ibarra
,
S. Moran
Journal of computer and system sciences (Print)
1982
Corpus ID: 205008094
1976
1976
On Families of Languages Defined by Time-Bounded Random Access Machines
I. H. Sudborough
,
A. Zalcberg
SIAM journal on computing (Print)
1976
Corpus ID: 3180801
There are essentially two results described in this paper. First, it is shown that for any random access machine (RAM) time…
Expand
1973
1973
Parsing Algorithms with Backtrack
Alexander Birman
,
Jeffrey D. Ullman
Information and Control
1973
Corpus ID: 265099790
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE