( en | de | ru )

 

Disambiguation of "Cleophas, Loek G."

Author of the publication

copydeleteadd this publication to your clipboard
Performance of C++ bit-vector implementations.

, , , and . SAICSIT, page 242-250. ACM, (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

Loek Geeraedts

Cleophas Pelzer

Catherine Cleophas

Lutz Cleophas

Soebiakto Loekman

 

Other publications of authors with the same name

Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms., and . CIAA, volume 5642 of Lecture Notes in Computer Science, page 245-248. Springer, (2009)A Boyer-Moore-Horspool algorithm derivation., and . South Afr. Comput. J., (2008)Weak factor automata: the failure of failure factor oracles?, , and . South Afr. Comput. J., (2014)Constructing Factor Oracles., , and . Stringology, page 37-50. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2003)Weak Factor Automata: Comparing (Failure) Oracles and Storacles., , and . Stringology, page 176-190. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)Efficient representation of DNA data for pattern recognition using failure factor oracles., , and . SAICSIT, page 369-377. ACM, (2013)Taxonomy-based software construction of SPARE Time: a case study., and . IEE Proc. Softw., 152 (1): 29-37 (2005)SPARE Parts: a C++ toolkit for string pattern recognition., and . Softw. Pract. Exp., 34 (7): 697-710 (2004)On Compile Time Knuth-Morris-Pratt Precomputation., , and . Stringology, page 15-29. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2011)FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views., , and . CIAA, volume 3317 of Lecture Notes in Computer Science, page 125-133. Springer, (2004)