Nonblocking k-Compare-Single-Swap Victor LuchangcoMark MoirNir Shavit OriginalPaper 02 December 2008 Pages: 39 - 66
Paging with Request Sets Leah EpsteinRob van SteeTami Tamir OriginalPaper 03 July 2007 Pages: 67 - 81
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis Heribert Vollmer OriginalPaper 03 July 2007 Pages: 82 - 90
Applying Modular Decomposition to Parameterized Cluster Editing Problems Fábio ProttiMaise Dantas da SilvaJayme Luiz Szwarcfiter OriginalPaper 06 July 2007 Pages: 91 - 104
On Embedding of a Hypercube in a Completely Overlapping Network Sanpawat KantabutraJakarin Chawachat OriginalPaper 26 July 2007 Pages: 105 - 116
Isomorphic Implication Michael BaulandEdith Hemaspaandra OriginalPaper 14 September 2007 Pages: 117 - 139