1. N. Alon, O. Goldreich, J. Hastad, and R. Peralta., Simple constructions of almost K-wise independent random variables. Random structures and algorithms, 3(3):289–304, 1992. Addendum: 4 (1): 119–120, 1993.
2. E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe., Relating equivalence and reducibility to sparse sets., SIAM Journal on Computing, 21 (3): 551–539, 1992.
3. P. Berman. Relationship between density and deterministic complexity of NP-complete languages., In Proceedings of the 5th Conference on Automata, Languages and Programming, pages 63–71. Springer-Verlag Lecture Notes in Computer Science #62, 1978
4. L. Berman and J. Hartmanis., On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6 (2): 305–322, 1977.
5. R. Book and K. Ko. On sets truth-table reducible to sparse sets., SIAM Journal on Computing, 17 (5): 903–919, 1988.