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...
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
Many organizations face every day the problem of effectively managing their contacts (customers, suppliers, partners, etc.), in terms of communication, clustering, networking, ana...
Irene Celino, Francesco Corcoglioniti, Emanuele De...