Space-efficient algorithms for longest increasing subsequence (Q1987516): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2913517735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space trade-off for triangulations of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Queues and Sorting for Read-Only Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search Using $$O(n)$$ Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Time-Space Trade-offs for Computing Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating longest increasing subsequences and patience sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of patience sorting piles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-pass geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of a longest increasing subsequence and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient Basic Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotonicity of a data stream / 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: On computing the length of longest increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding longest increasing and common subsequences in streaming data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Surprising Mathematics of Longest Increasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Longest Increasing Sequence in Polylogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Randomized Algorithms for K-SUM / rank
 
Normal rank

Latest revision as of 09:57, 22 July 2024

scientific article
Language Label Description Also known as
English
Space-efficient algorithms for longest increasing subsequence
scientific article

    Statements

    Space-efficient algorithms for longest increasing subsequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    longest increasing subsequence
    0 references
    patience sorting
    0 references
    space-efficient algorithm
    0 references
    0 references
    0 references
    0 references
    0 references