Sciweavers

120 search results - page 3 / 24
» Parallel Algorithm for Concurrent Computation of Connected C...
Sort
View
IPCO
2010
184views Optimization» more  IPCO 2010»
13 years 8 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
EUROPAR
2005
Springer
14 years 16 days ago
Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
Vijay K. Garg, Anurag Agarwal
PPOPP
2010
ACM
14 years 4 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
PODC
2010
ACM
13 years 11 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
SPAA
2004
ACM
14 years 12 days ago
A scalable lock-free stack algorithm
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
Danny Hendler, Nir Shavit, Lena Yerushalmi