Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
Abstract. We argue for the benefits of relations over functions for modelling programs, and even more so for modelling specifications. To support this argument, we present an ext...
The paper presents (i) two similarity based methods for retrieval of pictures using indices on spatial relationships; (ii) efficient algorithms for the deduction and reduction of ...
A. Prasad Sistla, Clement T. Yu, Chengwen Liu, Kin...