Routing as well as the management of communicationnetworks that support hybrid types of communications requiring quality of service is a very hard problem. We present here a frame...
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
— Vehicle-to-vehicle (VTV) communications are of interest for applications within traffic safety and congestion avoidance, but the development of suitable communications systems...
Johan Karedal, Fredrik Tufvesson, Nicolai Czink, A...