Pattern overlap in bit-parallel implementation of regular expression repetition quantifiers

ISSN： 1747-8405

Source： International Journal of Security and Networks, Vol.8, Iss.4, 2013-12, pp. : 231-238

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver

By San Segundo Pablo Rodríguez-Losada Diego Matía Fernando Galán Ramón

Applied Intelligence, Vol. 32, Iss. 3, 2010-06 ,pp. : 311-329

Springer Publishing Company

Access to resources Recommend Favorite

An optimal parallel algorithm to convert a regular expression into its Glushkov automaton

By Ziadi D. Champarnaud J.-M.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 69-87

Elsevier

Access to resources Recommend Favorite

A Boyer-Moore-style algorithm for regular expression pattern matching

By Watson B.W. Watson R.E.

Science of Computer Programming, Vol. 48, Iss. 2, 2003-08 ,pp. : 99-117

Elsevier

Access to resources Recommend Favorite

Towards the parallel repetition conjecture

By Verbitsky O.

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 277-282

Elsevier

Access to resources Recommend Favorite

On the Utility of Communication-Computation Overlap in Data-Parallel Programs

By Quinn M.J. Hatcher P.J.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 197-204

Academic Press

Access to resources Recommend Favorite