We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Increasingly, new applications are being built by composing existing software components rather than by coding a system from scratch. Using this approach, applications can be buil...
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
Improvements in semiconductor integration density and the resulting problem of having to manage designs of increasing complexity is an old one, but still current. The new challeng...
An essential characteristic of large scale software development is parallel development by teams of developers. How this parallel development is structured and supported has a pro...
Dewayne E. Perry, Harvey P. Siy, Lawrence G. Votta