L. M. Spracklin, Lawrence V. Saxton. Filtering Spam Using Kolmogorov Complexity Estimates. In 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Workshops Proceedings, Volume 1, May 21-23, 2007, Niagara Falls, Canada. pages 321-328, IEEE Computer Society, 2007. [doi]
@inproceedings{SpracklinS07, title = {Filtering Spam Using Kolmogorov Complexity Estimates}, author = {L. M. Spracklin and Lawrence V. Saxton}, year = {2007}, doi = {10.1109/AINAW.2007.184}, url = {http://doi.ieeecomputersociety.org/10.1109/AINAW.2007.184}, tags = {Kolmogorov complexity}, researchr = {https://researchr.org/publication/SpracklinS07}, cites = {0}, citedby = {0}, pages = {321-328}, booktitle = {21st International Conference on Advanced Information Networking and Applications (AINA 2007), Workshops Proceedings, Volume 1, May 21-23, 2007, Niagara Falls, Canada}, publisher = {IEEE Computer Society}, }