While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is aļ¬ected if the jobsā...
Abstract This paper gives poly-logarithmic-round, distributed Ī“-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
FPGAs are becoming more and more attractive for high precision scientiļ¬c computations. One of the main problems in efļ¬cient resource utilization is the quadratically growing r...
Having stealth and lightweight authentication methods is empowering network administrators to shelter critical services from adversaries. Spread-Spectrum TCP (SSTCP) [1] is one of...