Pages that link to "Item:Q1101238"

The following pages link to Upper bounds for time-space trade-offs in sorting and selection (Q1101238):

Displaying 30 items.

• Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
• Computing a visibility polygon using few variables (Q396475) (← links)
• Space-time trade-offs for stack-based algorithms (Q494797) (← links)
• Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
• Selection from read-only memory with limited workspace (Q744087) (← links)
• Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
• Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
• A time-space tradeoff for sorting on non-oblivious machines (Q1152950) (← links)
• Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) (← links)
• Constant work-space algorithms for facility location problems (Q2192101) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
• Finding median in read-only memory on integer input (Q2342680) (← links)
• Memory-constrained algorithms for simple polygons (Q2391542) (← links)
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
• A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
• Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
• Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
• A Survey on Priority Queues (Q2848973) (← links)
• Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
• Priority Queues and Sorting for Read-Only Data (Q4922111) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
• Improved upper bounds for time-space tradeoffs for selection with limited storage (Q5054849) (← links)
• Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
• (Q5136282) (← links)