Optimal algorithms for generalized searching in sorted matrices (Q1389660): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of selection in \(X+Y\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching in \(X+Y\) and other multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates of Location Based on Rank Tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Selection in <i>X</i> + <i>Y</i> and Other Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the <i>K</i>th Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection in \(X+Y\) and matrices with sorted rows and columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parallel selection and searching in partial orders: Sorted matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel selection in sorted matrices / rank
 
Normal rank

Latest revision as of 13:04, 28 May 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for generalized searching in sorted matrices
scientific article

    Statements

    Optimal algorithms for generalized searching in sorted matrices (English)
    0 references
    0 references
    30 June 1998
    0 references
    0 references
    CRCW PRAM
    0 references
    matrix search problem
    0 references
    optimal algorithm
    0 references
    processors
    0 references
    sorted matrix
    0 references
    time complexity
    0 references
    work-optimal
    0 references