Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
— Structured peer-to-peer systems have emerged as infrastructures for resource sharing in large-scale, distributed, and dynamic environments. One challenge in these systems is to...
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...