An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Window-accumulated subsequence matching problem is linear
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On Live-Dead Analysis for Global Data Flow Problems
Journal of the ACM (JACM)
An overview of computational complexity
Communications of the ACM
The Boolean Vector Machine [BVM]
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On feasible numbers (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Tree-size bounded alternation(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Multiple serial episodes matching
Information Processing Letters
An overview of computational complexity
ACM Turing award lectures
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Multiple serial episodes matching
Information Processing Letters
A characterization of the power of vector machines
Journal of Computer and System Sciences
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Lower bounds on the computational power of an optical model of computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Turing machine-inspired computer science results
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.02 |
Random access machines (RAMs) are usually defined to have registers that hold integers. While this captures in part the structure of a commercial computer, it overlooks an implementation-dependent feature of most binary oriented machines, namely their ability to operate bit by bit on the bit vectors used to represent integers. Typical operations are bit-wise Boolean operations (and, or, not, etc.) and shifts by an amount specified in some register. These operations are ideal for certain problems, such as dealing with sets represented as bit vectors, some parsing algorithms [4], propositional calculus theorem proving, and analysis of sorting networks. A RAM so implemented we shall call a vector machine.