Live briefing
Everything about Word RAM
Model of computation in computer science
In theoretical computer science, the word RAM model is a model of computation in which a random-access machine does arithmetic and bitwise operations on a word of w bits. Michael Fredman and Dan Willard created it in 1990 to simulate programming languages like C. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Word RAMA 5-minute orientation
- Skim a recent paper: cACP-DeepGram: Classification of anticancer peptides via deep neural network and skip-gram-based word embedding modelInfluential work since 2022
- Pick up a classic book: Divinas palabrasThe most-reprinted book on the subject
- Read the landmark paper: Dynamic programming algorithm optimization for spoken word recognitionCited 5,639 times
- Go sideways: Predecessor problemA closely related topic
- Go sideways: Integer sortingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Dynamic programming algorithm optimization for spoken word recognition
Comparison of parametric representations for monosyllabic word recognition in continuously spoken sentences
A divided word-line structure in the static RAM and its application to a 64K full CMOS RAM
A low power 46 ns 256 kbit CMOS static RAM with dynamic double word line
Dynamic Programming on the Word RAM
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
Optical RAM Row With 20 Gb/s Optical Word Read/Write
A 45-ns 256K CMOS static RAM with a tri-level word line
🆕 Influential since 2022
cACP-DeepGram: Classification of anticancer peptides via deep neural network and skip-gram-based word embedding model
An Automated Word Embedding with Parameter Tuned Model for Web Crawling
Predecessor on the Ultra-Wide Word RAM
Partial sums on the ultra-wide word RAM
Analysing and Carving MS Word and PDF Files from RAM Images on Windows
📚 Books worth reading
Divinas palabrasRamón del Valle-Inclán · 1920- 📕NārāyaṇīyaNārāyaṇabhaṭṭapāda. · 1962
History of the SikhsSardha Ram · 1888- 📕The student's practical dictionary[Urdu-English, English-Urdu]Ram Narain Lal · 1907
- 📕History of the Sikhs; or, Translation of the Sikkhan de Raj Di Vikhia, As Laid down for the Examination in Panjabi. Together with a Short Gurmukhi Grammar, and an Appendix Containing Some Useful Technical Words, in Roman Character. Translated and Edited BSardha Ram, Henry 1843-1892? Court · 2018
Timothy Leary: Outside Looking InRobert Forte, Robert Forte · 1999
Sharing WordsRam-n Flecha · 2000- 📕Words of WisdomRam Dass · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Predecessor problem In computer science, the predecessor problem involves maintaining a set of items to, given an element, efficiently query which element precedes or succeeds…
- Integer sorting In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer…
- Transdichotomous model In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of…
- Fusion tree In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where…
- Dan Willard Dan Edward Willard (September 19, 1948 – January 21, 2023) was an American computer scientist and logician, and a professor of computer science at the…
- AF-heap In computer science, the AF-heap is a type of priority queue for integer data, an extension of the fusion tree using an atomic heap proposed by M. L. Fredman…
- Cell-probe model In computer science, the cell-probe model is a model of computation similar to the random-access machine, except that all operations are free except memory…
- Time complexity In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm…