Efficient algorithms for local ranking (Q436589): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: TIME SERIES FROM THE ORDINAL VIEWPOINT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3651735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5452284 / rank | |||
Normal rank |
Latest revision as of 11:36, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for local ranking |
scientific article |
Statements
Efficient algorithms for local ranking (English)
0 references
25 July 2012
0 references
data structures
0 references
ordinal ranking
0 references
segment trees
0 references
fractional cascading
0 references
string matching
0 references