Experimental study of compressed stack algorithms in limited memory environments

DOI10.4230/LIPICS.SEA.2018.19MaRDI QIDQ5140731zbMATH OpenFDO

Authors Jean-François Baffier, Yago Diez, Matias Korman

Publication date 16 December 2020

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

zbMATH Keywords

convex hullimplementationstack algorithmstime-space trade-off

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Space-time trade-offs for stack-based algorithms
• Space-time trade-offs for stack-based algorithms
• scientific article; zbMATH DE number 2087558
• CRAM: compressed random access memory
• A general framework for dynamic succinct and compressed data structures

Cites work

• Computational geometry. Algorithms and applications.
• Computing a visibility polygon using few variables
• Constant-work-space algorithms for geometric problems
• Introduction to algorithms.
• Memory-constrained algorithms for simple polygons
• On finding the convex hull of a simple polygon
• Space-time trade-offs for stack-based algorithms
• Time-space trade-offs for triangulating a simple polygon
• Time-space trade-offs for triangulations and Voronoi diagrams
• Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs

Cited in

(3)

• Space-time trade-offs for stack-based algorithms
• Memory-Link Compression Schemes: A Value Locality Perspective
• scientific article; zbMATH DE number 2087558 (Why is no real title available?)

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Experimental study of compressed stack algorithms in limited memory environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140731)