Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,747,410 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Algorithm
All nearest smaller values
Computational geometry
Graham scan
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Lower Bounds for RowMinima Searching
P. Bradford
,
K. Reinert
2018
Corpus ID: 49205648
This paper shows that nding the row minima (maxima) in an n n totally monotone matrix in the worst case requires any algorithm to…
Expand
2013
2013
Speed-up technique for quantizer design for outputs of binary-input discrete memoryless channels by SMAWK algorithm
Iwata Ken-ichi
,
Ozawa Shin-ya
2013
Corpus ID: 125171070
2010
2010
Multiplication Algorithms for Monge Matrices Luı́s
M. Russo
2010
Corpus ID: 88504259
In this paper we study algorithms for the max-plus product of Monge matrices. These algorithms use the underlying regularities of…
Expand
2000
2000
Optimal Preex-free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property Proposed Running Head: Preex Codes for Unequal Letter Costs
M. Golin
,
L. Larmore
,
W. Rytter
2000
Corpus ID: 13946621
In this paper we discuss the problem of nding optimal preex-free codes for unequal letter costs, a variation of the classical…
Expand
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