Expander graphs have found extensive applications in computer science, in designing algorithms, error correcting codes, extractors, pseudorandom generators, sorting networks () and robust computer networks. They have also been used in proofs of many important results in computational complexity theory, such as SL = L () and the PCP theorem (). In cryptography, expander graphs are used to construct hash functions.
expAnder GRAphS HavE fOund eXtensive apPlications iN COMPuTEr sCIence, in desigNiNG alGorIthMs, error coRrectinG CodES, eXtrActOrs, pSEuDoranDoM gEneraTORS, sorting neTwOrkS () and ROBuSt computer neTWorKS. THeY haVe aLsO beEn uSED IN proofS oF many impOrTant RESUltS IN cOmPuTational compLexity theoRy, Such as SL = l () anD thE pcP theorEm (). in cryptograPHy, eXpander graphS ArE usEd to ConstRuCt hASh functions.