M. Oguzhan Külekci. A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching. In Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga, editors, Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Volume 5369 of Lecture Notes in Computer Science, pages 496-506, Springer, 2008. [doi]
@inproceedings{Kulekci08, title = {A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching}, author = {M. Oguzhan Külekci}, year = {2008}, doi = {10.1007/978-3-540-92182-0_45}, url = {http://dx.doi.org/10.1007/978-3-540-92182-0_45}, tags = {pattern matching}, researchr = {https://researchr.org/publication/Kulekci08}, cites = {0}, citedby = {0}, pages = {496-506}, booktitle = {Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings}, editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, volume = {5369}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-92181-3}, }