Pages that link to "Item:Q2957891"
From MaRDI portal
The following pages link to Space-Time Trade-offs for Stack-Based Algorithms (Q2957891):
Displaying 12 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- An applicative random-access stack (Q1062446) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- (Q4217672) (← links)
- Priority Queues and Sorting for Read-Only Data (Q4922111) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- Experimental study of compressed stack algorithms in limited memory environments (Q5140731) (← links)