Pages that link to "Item:Q2921413"
From MaRDI portal
The following pages link to Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem (Q2921413):
Displaying 15 items.
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← 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)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Simple 2^f-Color Choice Dictionaries (Q5091061) (← links)