Space-Time Trade-offs for Stack-Based Algorithms

DOI10.4230/LIPIcs.STACS.2013.281zbMath1354.68290arXiv1208.3663OpenAlexW2141285107MaRDI QIDQ2957891

Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane, Matias Korman, Luis Barba

Publication date: 30 January 2017

Full work available at URL: https://arxiv.org/abs/1208.3663

zbMATH Keywords

constant workspacespace-time trade-offstack algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ Memory-constrained algorithms for simple polygons ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ Computing a visibility polygon using few variables ⋮ Prune-and-search with limited workspace ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. ⋮ Space-time trade-offs for stack-based algorithms ⋮ Priority Queues and Sorting for Read-Only Data