A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements ofâ€¦ (More)

This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general min imum-cos t flow problem. Upper bounds on the numbers of steps inâ€¦ (More)

We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the firstâ€¦ (More)

This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing. The model is related to Ianov's program schema, butâ€¦ (More)

The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.