Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
Vijay Lakamraju, Zahava Koren, Israel Koren, C. Ma...
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
Rong Lin, Koji Nakano, Stephan Olariu, Maria Crist...
This paper shows how parallelism has been integrated into SCOOP, a C++ class library for solving optimisation problems. After a description of the modeling and the optimisation par...
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...