A scheme is presented which transforms systolic programs with a two-dimensionalstructure to one dimension. The elementary steps of the transformation are justified by theorems in ...
In this paper, we describe a parallelization scheme for Collins’ cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. ...
: We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctnes...
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are...
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...