Space-time trade-offs for stack-based algorithms
From MaRDI portal
Publication:494797
Recommendations
- Space-time trade-offs for stack-based algorithms
- Time-space tradeoffs for set operations
- Efficient computation of optimal space-time performance curves for memory hierarchies
- Time-space tradeoffs for branching programs
- Time-space trade-offs for branching programs
- scientific article; zbMATH DE number 2149351
- Space Complexity of Stack Automata Models
- Space complexity of stack automata models
- Allocate-on-use space complexity of shared-memory algorithms
- Static-memory-hard functions, and modeling the cost of space vs. time
Cites work
- scientific article; zbMATH DE number 589497 (Why is no real title available?)
- scientific article; zbMATH DE number 1958105 (Why is no real title available?)
- Comparison-based time-space lower bounds for selection
- Computational Complexity
- Computing a visibility polygon using few variables
- Constant-work-space algorithms for geometric problems
- Constant-work-space algorithms for shortest paths in trees and simple polygons
- Corrections to Lee's visibility polygon algorithm
- Data Mining with optimized two-dimensional association rules
- Implementation and evaluation of decision trees with range and region splitting
- Improved upper bounds for time-space tradeoffs for selection with limited storage
- Linear time algorithm for approximating a curve by a single-peaked curve
- Memory-constrained algorithms for simple polygons
- Multi-pass geometric algorithms
- On finding the convex hull of a simple polygon
- On the identification of the convex hull of a finite set of points in the plane
- On the solution of linear recurrence equations
- Optimal shortest path queries in a simple polygon
- Parallel RAMs with owned global memory and deterministic context-free language recognition
- Selection and sorting with limited storage
- Selection from read-only memory and sorting with minimum data movement
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Space-time trade-offs for stack-based algorithms
- The recognition of deterministic CFLs in small time and space
- Triangulating a simple polygon
- Triangulating a simple polygon in linear time
- Upper bounds for time-space trade-offs in sorting and selection
- Visibility Algorithms in the Plane
Cited in
(18)- A framework for in-place graph algorithms
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- An applicative random-access stack
- Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
- Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
- Improved space efficient algorithms for BFS, DFS and applications
- scientific article; zbMATH DE number 1222169 (Why is no real title available?)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
- Space efficient linear time algorithms for BFS, DFS and applications
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Time-space trade-offs for triangulations and Voronoi diagrams
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms
- Space-time trade-offs for stack-based algorithms
- Optimal In-place Algorithms for Basic Graph Problems
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
- Frameworks for designing in-place graph algorithms
- Experimental study of compressed stack algorithms in limited memory environments
This page was built for publication: Space-time trade-offs for stack-based algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494797)
