Version 1 (modified by cameron, 3 years ago) (diff)


Parallel Deletion

Given a stream of data elements and a corresponding deletion mask bit stream, the deletion problem is to compute a compressed bit stream consisting of only the nondeleted elements.

For example, consider the following bit stream and deletion mask:


The compressed bit stream resulting from deletion of positions marked by 1 bits is the following: