Space-time trade-offs for stack-based algorithms (Q494797): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-014-9893-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2125293312
@@ Property / OpenAlex ID: W2125293312 / rank @@
+Normal rank
@@ Property / cites work @@
+Corrections to Lee's visibility polygon algorithm
@@ Property / cites work: Corrections to Lee's visibility polygon algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the solution of linear recurrence equations
@@ Property / cites work: On the solution of linear recurrence equations / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and evaluation of decision trees with range and region splitting
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Memory-constrained algorithms for simple polygons
@@ Property / cites work: Memory-constrained algorithms for simple polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Q2968076
@@ Property / cites work: Q2968076 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
+Normal rank
@@ Property / cites work @@
+Space-Time Trade-offs for Stack-Based Algorithms
@@ Property / cites work: Space-Time Trade-offs for Stack-Based Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a visibility polygon using few variables
+Normal rank
@@ Property / cites work @@
+Q4418993
@@ Property / cites work: Q4418993 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
+Normal rank
@@ Property / cites work @@
+Comparison-based time-space lower bounds for selection
+Normal rank
@@ Property / cites work @@
+Multi-pass geometric algorithms
@@ Property / cites work: Multi-pass geometric algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithm for approximating a curve by a single-peaked curve
+Normal rank
@@ Property / cites work @@
+The recognition of deterministic CFLs in small time and space
+Normal rank
@@ Property / cites work @@
+Parallel RAMs with owned global memory and deterministic context-free language recognition
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+Data Mining with optimized two-dimensional association rules
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon
@@ Property / cites work: Triangulating a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility Algorithms in the Plane
@@ Property / cites work: Visibility Algorithms in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal shortest path queries in a simple polygon
@@ Property / cites work: Optimal shortest path queries in a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+On the identification of the convex hull of a finite set of points in the plane
+Normal rank
@@ Property / cites work @@
+On finding the convex hull of a simple polygon
@@ Property / cites work: On finding the convex hull of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+Selection from read-only memory and sorting with minimum data movement
+Normal rank
@@ Property / cites work @@
+Q4295776
@@ Property / cites work: Q4295776 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for time-space tradeoffs for selection with limited storage
+Normal rank