We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
—The Disruption Tolerant Networks (DTNs) are vulnerable to insider attacks, in which the legitimate nodes are compromised and the adversary modifies the delivery metrics of the ...
Yanzhi Ren, Mooi Choo Chuah, Jie Yang, Yingying Ch...
Traditionally, the routing problem is addressed at the network layer, an approach that has been extended to the wireless realm. In wireless multihop networks, however, strict laye...