From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Transformation of Suffix Arrays into Suffix Trees on the MPI Environment., , и . RSFDGrC, том 4482 из Lecture Notes in Computer Science, стр. 248-255. Springer, (2007)A fast algorithm for the generalized k-keyword proximity problem given keyword offsets., , и . Inf. Process. Lett., 91 (3): 115-120 (2004)Linear Time Algorithm for the Generalised Longest Common Repeat Problem., и . SPIRE, том 3772 из Lecture Notes in Computer Science, стр. 191-201. Springer, (2005)A simple pattern matching algorithm for weighted sequences.. RACS, стр. 65-67. ACM, (2012)Finding overlaps within regular expressions with variable-length gaps., , и . RACS, стр. 16-21. ACM, (2013)Fast filtering for intrusion detection systems with the shift-or algorithm., , и . APCC, стр. 869-870. IEEE, (2012)Mining intrusion detection rules with longest increasing subsequences of q-grams., и . RACS, стр. 25-29. ACM, (2017)Measuring similarities among intrusion detection rules on the MapReduce environment., , , и . RACS, стр. 58-60. ACM, (2014)REduce: Removing Redundancy from Regular Expression Matching in Network Security., , , и . ICCCN, стр. 1-10. IEEE, (2015)A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem., и . ICANNGA (1), том 4431 из Lecture Notes in Computer Science, стр. 554-561. Springer, (2007)