On the extremal combinatorics of the hamming space

Locality in Distributed Graph Algorithms

Nathan Linial · SIAM Journal on Computing · 1992 · 885 citations

Computing, Computer Science, Algorithms +12

On sets of integers containing k elements in arithmetic progression

Endre Szemerédi · Acta Arithmetica · 1975 · 800 citations · Full text

Natural Sciences, Computer Science, Mathematics +10

Nonrandom binary superimposed codes

William H. Kautz, Robert R. Singleton · IEEE Transactions on Information Theory · 1964 · 708 citations

Engineering, Computer Science, Electrical Engineering +14

Simple Constructions of Almost k‐wise Independent Random Variables

Noga Alon, Oded Goldreich, Johan Håstad et al. · Random Structures and Algorithms · 1992 · 569 citations

Natural Sciences, Computer Science, Mathematics +8

Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound

M. A. Tsfasman, S. G. Vlădutx, Th. Zink · Mathematische Nachrichten · 1982 · 545 citations

Natural Sciences, Computer Science, Mathematics +12