AWhat changed
The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model.
Scientific scope
The paper constructed static sparse-set representations with constant worst-case membership query time and linear space, then refined word storage to n plus a sublinear remainder under its stated model. The result concerns a static key set and the specified word-RAM/hash-family assumptions. Randomized construction can produce linear-space storage with worst-case constant lookup, but construction and lookup guarantees are different. It does not provide unrestricted dynamic updates, adversarial chosen-key security or free computation on arbitrarily long keys. Implementation constants and practical throughput have not been replayed.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Michael L. Fredman · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- János Komlós · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Endre Szemerédi · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — exact original scientific paper
- Fredman, Komlós and Szemerédi: static sparse tables with constant worst-case lookup — publisher deposit
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction