We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
—Nowadays, users are increasingly concerned about individual privacy in cyberspace and Internet. In this paper, we propose the concept of private handshakes with optional account...
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Traditional key pre-distribution schemes in sensor and ad hoc networks rely on the existence of a trusted third party to generate and distribute a key pool. The assumption of a sin...
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...