A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A simple randomized parallel algorithm for list-ranking
Information Processing Letters
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Communication complexity
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Approximate L1-Difference Algorithm for Massive Data Streams
SIAM Journal on Computing
Efficient algorithms for new computational models
Efficient algorithms for new computational models
On the Streaming Model Augmented with a Sorting Primitive
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tribeca: a system for managing large databases of network traffic
ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
| Hi-index | 0.00 |
In this paper we show how parallel algorithms can be turned into efficient streaming algorithms for several classical combinatorial problems in the W-Stream model. In this model, at each pass one input stream is read and one output stream is written; streams are pipelined in such a way that the output stream produced at pass i is given as input stream at pass i + 1. Our techniques give new insights on developing streaming algorithms and yield optimal algorithms (up to polylog factors) for several classical problems in this model including sorting, connectivity, minimum spanning tree, biconnected components, and maximal independent set.