We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
— Data collected in a sensor network is transported hop-by-hop to a sink for further analysis. The quality of the analysis depends on the amount of data reaching the sink. Hence,...
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
The problem of information flow in multithreaded programs remains an important open challenge. Existing approaches to specifying and enforcing information-flow security often su...