Threshold data structures and coding theory
From MaRDI portal
Publication:1978695
Recommendations
- A compact data structure for representing a dynamic multiset
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model
- Membership in Constant Time and Almost-Minimum Space
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Cites work
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- scientific article; zbMATH DE number 53945 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1253982 (Why is no real title available?)
- scientific article; zbMATH DE number 1273636 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 3215708 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- A New Solution to Coherence Problems in Multicache Systems
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
- Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)
- On the solution of algebraic equations over finite fields
- Shift-register synthesis and BCH decoding
- Superimposed codes in the Hamming space
This page was built for publication: Threshold data structures and coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978695)