Pages that link to "Item:Q761793"

The following pages link to Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793):

Displaying 10 items.

• The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
• An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot 2^{n/k})\) space algorithm for certain NP-complete problems (Q1101220) (← links)
• River routing in VLSI (Q1102106) (← links)
• Complexity of selection in \(X+Y\) (Q1124333) (← links)
• Optimal algorithms for generalized searching in sorted matrices (Q1389660) (← links)
• On finding connected balanced partitions of trees (Q2028065) (← links)
• Scheduling with gaps: new models and algorithms (Q2059088) (← links)
• Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
• Scheduling with Gaps: New Models and Algorithms (Q2947014) (← links)
• (Q5111741) (← links)