Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...