Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
—This paper describes a decentralised car traffic control simulation with re-routing and propagation of messages among traffic nodes (roads intersections and traffic lights). The...
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...