1. Bloom, B.: Space-time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
2. Pinsker, M.S.: On the complexity of a concentrator. In: 7th International Teletrafc Conference, pp. 318/1–318/4 (1973)
3. Bassalygo, L.A., Pinsker, M.S.: The complexity of an optimal non-blocking commutation scheme without reorganization. Probl. Inf. Transm. 9, 64–66 (1974)
4. Dyachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Probl. Inf. Transm. 18(3), 7–13 (1982)
5. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach. 31(3), 538–544 (1984)