We provide a general tool to improve the real time performance of a broad class of Union-Find algorithms. This is done by minimizing the random access memory that is used and thus to avoid the well-known von~Neumann bottleneck of synchronizing CPU and memory. A main application to image segmentation algorithms is demonstrated where the real time performance is drastically improved
In the classical union-find problem we maintain a partition of a universe of n elements into disjoin...
The bandwidth mismatch between processor and main memory is one major limiting problem. Although str...
AbstractWe explore techniques for designing nonblocking algorithms that do not require advance knowl...
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has be...
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has be...
AbstractWe consider Union-Find as an appropriate data structure to obtain two linear time algorithms...
AbstractWe solve the Union-Find Problem (UF) efficiently for the case the input is restricted to sev...
International audienceWe consider Union-Find as an appropriate data structure to obtain two linear t...
We are interested in designing efficient data structures for a shared memory multiprocessor. In this...
Abstract The Union-Find algorithm is used for maintaining a number of nonoverlapping sets from a fin...
Abstract—The Union-Find algorithm is used for maintaining a number of non-overlapping sets from a fi...
AbstractThis paper presents a linear-time algorithm for the special case of the disjoint set union p...
AbstractThe Union–Find data structure for maintaining disjoint sets is one of the best known and wid...
In this article we present an I/O-efficient algorithm for the batched (off-line) version of the unio...
AbstractThis paper describes a machine model intended to be useful in deriving realistic complexity ...
In the classical union-find problem we maintain a partition of a universe of n elements into disjoin...
The bandwidth mismatch between processor and main memory is one major limiting problem. Although str...
AbstractWe explore techniques for designing nonblocking algorithms that do not require advance knowl...
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has be...
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has be...
AbstractWe consider Union-Find as an appropriate data structure to obtain two linear time algorithms...
AbstractWe solve the Union-Find Problem (UF) efficiently for the case the input is restricted to sev...
International audienceWe consider Union-Find as an appropriate data structure to obtain two linear t...
We are interested in designing efficient data structures for a shared memory multiprocessor. In this...
Abstract The Union-Find algorithm is used for maintaining a number of nonoverlapping sets from a fin...
Abstract—The Union-Find algorithm is used for maintaining a number of non-overlapping sets from a fi...
AbstractThis paper presents a linear-time algorithm for the special case of the disjoint set union p...
AbstractThe Union–Find data structure for maintaining disjoint sets is one of the best known and wid...
In this article we present an I/O-efficient algorithm for the batched (off-line) version of the unio...
AbstractThis paper describes a machine model intended to be useful in deriving realistic complexity ...
In the classical union-find problem we maintain a partition of a universe of n elements into disjoin...
The bandwidth mismatch between processor and main memory is one major limiting problem. Although str...
AbstractWe explore techniques for designing nonblocking algorithms that do not require advance knowl...
DOI
Add to ORKG