We present a lane-based clustering algorithm designed to provide stability in cluster lifetime
for vehicular ad-hoc networks (VANETs) in urban scenarios. Stable clustering methods …

An Analytical Approach to Programs as Data Objects Page 1 Olivier Danvy Doctoral thesis An
Analytical Approach to Programs as Data Objects Department of Computer Science Page 2 An …

We present the first derivation of the search phase of the Boyer–Moore string-matching
algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on …

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by partial
evaluation of a quadratic-time string matcher with respect to a pattern string. Although it has …

This research article introduces a new string-matching algorithm that utilizes the multi-
character inverted lists structure, implemented using a perfect hashing method. The new …

This book presents the principles and techniques of program specialization—a general
method to make programs faster (and possibly smaller) when some inputs can be known in …

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by
specializing a quadratic-time string matcher with respect to a pattern string. Although it has …

We consider a naive, quadratic string matcher testing whether a pattern occurs in a text; we
equip it with a cache mediating its access to the text; and we abstract the traversal policy of …

We enhance the narrowing-driven partial evaluation scheme for lazy functional logic
programs with the computation of symbolic costs. The enhanced scheme allows us to …

This research article presents two algorithms of string pattern matching. These algorithms
employ a new data structure called inverted lists structure which is inherited from the …