|
[1]
|
Keyword Research, Competitive Analysis, Website Ranking, Alexa. http://www.alexa.com
|
|
[2]
|
Usage Statistics of Compression for Websites. https://w3techs.com/technologies/details/ce-compression/all/all
|
|
[3]
|
The GZIP Home Page. http://www.gzip.org
|
|
[4]
|
Ziv, J. and Lempel, A. (1977) A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory, 23, 337-343. [Google Scholar] [CrossRef]
|
|
[5]
|
Huffman, D. (1952) A Method for the Construction of Minimum-Redundancy Codes. Proceedings of IRE, 40, 1098-1101. [Google Scholar] [CrossRef]
|
|
[6]
|
Knuth, D.E., Morris, J.H. and Pratt, V.R. (1977) Fast Pattern Matching in Strings. SIAM Journal on Computing, 6, 323-350. [Google Scholar] [CrossRef]
|
|
[7]
|
Aho, A. and Corasick, M. (1975) Efficient String Matching: An Aid to Biblio-Graphic Search. Communications of the ACM, 18, 333-340. [Google Scholar] [CrossRef]
|
|
[8]
|
Karp, R.M. and Rabin, M.O. (1987) Efficient Randomized Pattern-Matching Algorithms. IBM Journal of Research and Development, 31, 249-260. [Google Scholar] [CrossRef]
|
|
[9]
|
Wang, Q., Lu, Y.H., Liu, Y., Liu, Y.B., Tan, J.L. and Sun, B. (2017) Dynamical Adaptive Karp-Rabin Pattern Matching Algorithm. CEA, 53, 39-44.
|
|
[10]
|
Wu, S. and Manber, U. (1994) A Fast Algorithm for Pattern Searching.
|
|
[11]
|
Boyer, R. and Moore, J. (1977) A Fast String Searching Algorithm. Com-munications of the ACM, 20, 762-772. [Google Scholar] [CrossRef]
|
|
[12]
|
Cantone, D., Faro, S. and Giaquinta, E. (2012) Adapting Boy-er-Moore-Like Algorithms for Searching Huffman Encoded Texts. International Journal of Foundations of Computer Science, 23, 343-356. [Google Scholar] [CrossRef]
|
|
[13]
|
Bremler-Barr, A., David, S.T., Hay, D., et al. (2012) Decom-pression-Free Inspection: DPI for Shared Dictionary Compression over HTTP. 2012 Proceedings IEEE, Orlando, 25-30 March 2012, 1987-1995. [Google Scholar] [CrossRef]
|
|
[14]
|
Navarro, G. and Tarhio, J. (2000) Boyer Moore, String Matching over Ziv-Lempel Compressed Text. In: Annual Symposium on Combinatorial Pattern Matching, Springer, Berlin Heidelberg, 166-180. [Google Scholar] [CrossRef]
|
|
[15]
|
Gawrychowski, P. (2013) Optimal Pattern Matching in LZW Compressed Strings. ACM Transactions on Algorithms (TALG), 9, 25. [Google Scholar] [CrossRef]
|
|
[16]
|
Bremler-Barr, A. and Koral, Y. (2009) Accelerating Pattern Match-ing on Compressed HTTP Traffic. 2009 Proceeding IEEE INFOCOM, Rio de Janeiro, 19-25 April 2009, 397-405. [Google Scholar] [CrossRef]
|
|
[17]
|
Bremler-Barr, A., Koral, Y. and Zigdon, V. (2011) Shift-Based Pattern Matching for Compressed Web Traffic. IEEE 12th International Conference on High Performance Switching and Routing, Cartagena, 4-6 July 2011, 222-229. [Google Scholar] [CrossRef]
|
|
[18]
|
Bremler-Barr, A. and Koral, Y. (2012) Accelerating Multipattern Matching on Compressed HTTP Traffic. IEEE/ACM Transactions on Networking, 20, 970-983. [Google Scholar] [CrossRef]
|
|
[19]
|
Hassan, M. (2016) Fast Pattern Matching Algorithm on Com-pressed Network Traffic. China Communications, 13, 141-150. [Google Scholar] [CrossRef]
|
|
[20]
|
Snort-Network Intrusion Detection, Prevention System. https://www.snort.org
|
|
[21]
|
ModSecurity: Open Source Web Application Firewall. https://modsecurity.org
|