THE SCOPE
Foundational procedures, correctness arguments, complexity analysis and implementation tradeoffs.
This starting dossier establishes a research remit and reference points for the section. It does not claim to be a comprehensive historical survey. Future articles will identify primary evidence, publication or artifact dates, competing accounts and the limits of verification.
A named algorithm has variants
A familiar label can describe a family of techniques with different invariants, data structures and runtime properties.
Proofs and empirical results differ
Complexity analysis describes mathematical behavior under assumptions; benchmarks report observations from specific hardware and inputs.
Historical priority needs care
An influential publication, an independently rediscovered method and an earlier unpublished implementation are distinct historical events.
OPEN QUESTIONS / NOT ASSUMPTIONS
Questions that guide the reporting.
- 01What precise algorithm and assumptions are under discussion?
- 02Is correctness demonstrated or merely asserted?
- 03Do comparative benchmarks disclose inputs, environment and implementation versions?
PRIMARY & TECHNICAL REFERENCES
Starting sources
The references below are paths into the evidence, not a claim that every historical question is settled. Each future article will provide its own direct citations and version-specific evidence.
- 01NIST — Dictionary of Algorithms and Data Structures xlinux.nist.gov
- 02ACM Digital Library dl.acm.org
VERSION RECORD / 1.0
This dossier is revisable.
2026-10-08 — Initial edition. Research scope, evidence lenses, questions and reference starting points published. No external submissions have been reviewed for this initial edition. Future substantive changes should be documented with supporting evidence.
Submit source evidence or a correction →