Skip to search formSkip to main contentSkip to account menu

Random-access machine

Known as: RAM model, RAM machines, Random Access Machine 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
Abstract machineAndrey ErshovArthur BurksBit-reversal permutation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM
We show that the k-SUM problem can be solved by a linear decision tree of depth O(n^2 log^2 n),improving the recent bound O(n^3… 
2017
2017
Semi-supervised Learning for Affective Common-Sense Reasoning
BackgroundBig social data analysis is the area of research focusing on collecting, examining, and processing large multi-modal… 
2009
2009
On approximating the ideal random access machine by physical machines
The capability of the Random Access Machine (RAM) to execute any instruction in constant time is not realizable, due to… 
2008
2008
Chapter 7 The “Programming Language” of Dynamic Self-Assembly
Review
2004
Review
2004
Serial Disk-based Analysis of Large Stochastic Models
The paper presents a survey of out-of-core methods available for the analysis of large Markov chains on single workstations… 
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… 
1987
1987
Improved Bounds for Covering General Polygons with Rectangles
During the fabrication of masks for integrated circuits, the polygons on the pattern generator must be covered by rectangles… 
1985
1985
On Efficient Recognition of Transductions and Relations
1976
1976
On Families of Languages Defined by Time-Bounded Random Access Machines
There are essentially two results described in this paper. First, it is shown that for any random access machine (RAM) time… 
1973
1973
Parsing Algorithms with Backtrack
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)