The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems

Elad Verbin, Wei Yu. The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 11-25, SIAM, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.