It may be surprising that variations of the maximum segment sum (MSS) problem, a textbook
example for the squiggolists, are still active topics for algorithm designers. In this paper we …

It is well-known that a naive algorithm can often be turned into an efficient program by
applying appropriate semantics-preserving transformations. This technique has been used …

Program analysis is the heart of modern compilers. Most control flow analyses are reduced
to the problem of finding a fixed point in a certain transition system, and such fixed point is …

We present a new derivation of efficient algorithms for a class of optimization problems
called maximum marking problems. We extend the class of weight functions used in the …

Abstract Although Breadth-First Search (BFS) has several advantages over Depth-First
Search (DFS) its prohibitive space requirements have meant that algorithm designers often …

This paper introduces accumulation into list homomorphisms for systematic development of
both efficient and correct parallel programs. New parallelizable recursive pattern called H …

Data mining, which is a technology for obtaining useful knowledge from large database, has
been gradually recognized as an important subject. Algorithms for data mining have to be …

Nested reductions are important computation patterns, in which we take a sum of individual
sums on a data set using two binary operators. For example, naive parallel programs for …

Given a string of parentheses, the task is to find the longest consecutive segment that is
balanced, in linear time. We find this problem interesting because it involves a combination …

Given a string of parentheses, the task is to find the longest consecutive segment that is
balanced, in linear time. We find this problem interesting because it involves a combination …