Generalized Selection and Ranking: Sorted Matrices
Copyright policy )Generalized Selection and Ranking: Sorted Matrices
For a set of n elements drawn from a universe with a total order, the problem of selecting the element of rank k (where \(1\leq k\leq n)\) has cost proportional to n. This paper is concerned with selecting in a set presented in the form of a collection of sorted matrices. An \(n\times m\) matrix X is called a sorted matrix if the values in each row and each column are in nondecreasing order. For selection in a single sorted matrix of dimensions \(n\times m\), where \(1
algorithm, Analysis of algorithms and problem complexity, succinct descriptions, selection, data structures, lower bounds, ranking, sorted matrices, Searching and sorting, cartesian sums
algorithm, Analysis of algorithms and problem complexity, succinct descriptions, selection, data structures, lower bounds, ranking, sorted matrices, Searching and sorting, cartesian sums
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).109 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!