SMAWK algorithm
The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.
- Comment
- enThe SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.
- Has abstract
- enThe SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.
- Hypernym
- Algorithm
- Is primary topic of
- SMAWK algorithm
- Label
- enSMAWK algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- All nearest smaller values
- Category:Combinatorial algorithms
- Category:Matrix theory
- Computational geometry
- DNA
- Graham scan
- Maria Klawe
- Matrix (mathematics)
- Monge array
- Nucleic acid secondary structure
- Peter Shor
- Prefix code
- Protein
- Prune and search
- Recursion (computer science)
- RNA
- Sequence alignment
- Shlomo Moran
- Stack (data structure)
- Thresholding (image processing)
- Word wrap
- SameAs
- fYyJ
- m.0wfzg8j
- Q17103377
- SMAWK algorithm
- Subject
- Category:Combinatorial algorithms
- Category:Matrix theory
- WasDerivedFrom
- SMAWK algorithm?oldid=1033199110&ns=0
- WikiPageLength
- 5919
- Wikipage page ID
- 40077712
- Wikipage revision ID
- 1033199110
- WikiPageUsesTemplate
- Template:Reflist