Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AlgorithmAll nearest smaller valuesComputational geometryGraham scan

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Thresholding Quantizer Design for Mutual Information Maximization Under Output Constraint
We consider a channel with discrete input ${X}$, a continuous noise that corrupts the input ${X}$ to produce the continuous… 
2019
2019
Dynamic Programming for Quantization of q-ary Input Discrete Memoryless Channels
In this paper, we present a general framework of applying dynamic programming (DP) to the sequential deterministic quantization… 
2018
2018
Lower Bounds for RowMinima Searching
This paper shows that nding the row minima (maxima) in an n n totally monotone matrix in the worst case requires any algorithm to… 
2013
2013
Speed-up technique for quantizer design for outputs of binary-input discrete memoryless channels by SMAWK algorithm
2010
2010
Multiplication Algorithms for Monge Matrices
In this paper we study algorithms for the max-plus product of Monge matrices. These algorithms use the underlying regularities of… 
2010
2010
Multiplication Algorithms for Monge Matrices Luı́s
In this paper we study algorithms for the max-plus product of Monge matrices. These algorithms use the underlying regularities of… 
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
In this paper we discuss the problem of nding optimal preex-free codes for unequal letter costs, a variation of the classical… 
1996
1996
Lower Bounds for Row Minima Searching
1 I n t r o d u c t i o n Finding the row min ima (maxima) of monotone matrices was int roduced by Aggarwal, Klawe, Moran, Shor… 
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)