2 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DC2014★ 2 cited
Efficient Lock-free Binary Search Trees
Bapi Chatterjee, Nhan Nguyen, Philippas Tsigas
In this paper we present a novel algorithm for concurrent lock-free internal binary search trees (BST) and implement a Set abstract data type (ADT) based on that. We show that in t…
cs.SI2010★ 2 cited
Analyzing the Social Structure and Dynamics of E-mail and Spam in Massive Backbone Internet Traffic
Farnaz Moradi, Tomas Olovsson, Philippas Tsigas
E-mail is probably the most popular application on the Internet, with everyday business and personal communications dependent on it. Spam or unsolicited e-mail has been estimated t…