Adapting parallel algorithms to the W-Stream model, with applications to graph problems
- 25 October 2010
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (44-46) , 3994-4004
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Trading off space for passes in graph streaming problemsACM Transactions on Algorithms, 2009
- On the Streaming Model Augmented with a Sorting Primitive2004
- On Graph Problems in a Semi-streaming ModelLecture Notes in Computer Science, 2004
- Models and issues in data stream systems2002
- Fast, small-space algorithms for approximate histogram maintenance2002
- An Approximate L1 -Difference Algorithm for Massive Data StreamsSIAM Journal on Computing, 2002
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- A simple randomized parallel algorithm for list-rankingInformation Processing Letters, 1990
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAMIEEE Transactions on Computers, 1987
- Approximate and exact parallel scheduling with applications to list, tree and graph problems1986