Pages that link to "Item:Q2437755"
From MaRDI portal
The following pages link to Approximating the maximum consecutive subsums of a sequence (Q2437755):
Displaying 7 items.
- Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence (Q396653) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- An extremal problem in subsequence sum (Q2113719) (← links)
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488) (← links)
- Finding the maximum subsequence sum on interconnection networks (Q5421615) (← links)
- The Largest Sum-Free Subsequence from a Sequence of n Numbers (Q5661979) (← links)
- Bubble-flip -- a new generation algorithm for prefix normal words (Q5970219) (← links)
