Monotonicity — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as quadrangle inequality — the same set of essays touches all of them, so they are one junction rather than several.
The argmin that cannot go backwards
The same triangular table, the same ninety-one cells, the same tree at the end of it — and 364 transitions one way against 156 the other. At 256 keys the ratio is 38. What removes the factor is not a property of the recurrence but a property of the numbers it is given, and the recurrence does not mention them.
The bound a block can and cannot have
Knuth's condition turns an interval table's cubic fill into a quadratic one by bounding each cell's best split between its two neighbours'. A blocked fill cannot use it a cell at a time, and the two cells that bound a block lie outside the block — one to its left, one below it. The schedule has finished both for ten per cent of the blocks, the bound then removes eleven per cent of the splits, and it removes half a per cent of the cache misses, because the splits it skips are the ones already in the cache.
Named alongside it
The objects these essays reach for when they reach for this one.
Dynamic programmingInterval dpPruningQuadrangle inequalitySubproblemCache obliviousComplexity classCost modelDesign parameterLocalityMeasured countMemory layout