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

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

Latest revision as of 16:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Space-time trade-offs for stack-based algorithms
scientific article

    Statements

    Space-time trade-offs for stack-based algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    memory-constrained algorithms
    0 references
    space-time trade-off
    0 references
    stack algorithms
    0 references
    constant workspace
    0 references
    0 references
    0 references
    0 references

    Identifiers