We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communicat...
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matchin...
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
Dan Dumitriu, Edward W. Knightly, Aleksandar Kuzma...