A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Abstract Research in information security, risk management and investment has grown in importance over the last few years. However, without reliable estimates on attack probabiliti...
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...