Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search (Q4987433): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3381416 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3012407355 / rank | |||
Normal rank | |||
Latest revision as of 18:11, 19 March 2024
scientific article; zbMATH DE number 7342459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search |
scientific article; zbMATH DE number 7342459 |
Statements
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search (English)
0 references
3 May 2021
0 references
Monge matrix
0 references
predecessor search
0 references
range queries
0 references
