Pages that link to "Item:Q5449525"
From MaRDI portal
The following pages link to Necklaces, Convolutions, and X + Y (Q5449525):
Displayed 14 items.
- Combining initial segments of lists (Q391737) (← links)
- Indexing permutations for binary strings (Q407548) (← links)
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis (Q618886) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- A linear-time algorithm for Hamming distance with shifts (Q2272216) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Extreme Witnesses and Their Applications (Q3467863) (← links)
- Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)