Maximum Segment Sum, Monadically¶
Gibbons, J. (2011). Maximum Segment Sum, Monadically. Electronic Proceedings in Theoretical Computer Science, 1-2.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Bird–Meertens Formalism
- It does not, by itself, prove that the last expression runs faster: the cost of operations and the chosen evaluation scheme need separate analysis.
This sourceAuthor-hosted full paper inspected; it is a later monadic treatment.
- It does not, by itself, prove that the last expression runs faster: the cost of operations and the chosen evaluation scheme need separate analysis.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:30dd3983fea4 · see in the full table