Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...
Because large scienti c codes are rarely static objects, developers are often faced with the tedious task of accounting for discrepancies between new and old versions. In this pap...
David Abramson, Ian T. Foster, John Michalakes, Ro...
This paper presents new solutions to the following three problems in image morphing: feature specification, warp generation, and transition control. To reduce the burden of featu...
This paper describes how a program called dup can be used to locate instances of duplication or nearduplication in a software system. D u p reports both textually identical sectio...
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...