scientific article; zbMATH DE number 1953284

zbMATH Open1026.68508MaRDI QIDQ4414737FDOQ4414737

Authors: Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær 

Publication date: 27 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2566/25660332.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1786226
• On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
• Disjunctive partial deduction of a right-to-left string-matching algorithm
• Fastest Pattern Matching in Strings
• On the Expected Sublinearity of the Boyer–Moore Algorithm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (6)

• On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
• Program transformation system based on generalized partial computation
• Disjunctive partial deduction of a right-to-left string-matching algorithm
• An investigation of Jones optimality and BTI-universal specializers
• Title not available (Why is that?)
• Solving Not-Substring Constraint withFlat Abstraction

Uses Software

• WSDFU

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414737)