Input/Output Streaming Complexity of Reversal and Sorting

@inproceedings{Franois2014InputOutputSC,
  title={Input/Output Streaming Complexity of Reversal and Sorting},
  author={Nathana{\"e}l François and F. Magniez},
  booktitle={APPROX-RANDOM},
  year={2014}
}
  • Nathanaël François, F. Magniez
  • Published in APPROX-RANDOM 2014
  • Computer Science, Mathematics
  • We consider unidirectional data streams with restricted access, such as read-only and write-only streams. For read-write streams, we also introduce a new complexity measure called expansion, the ratio between the space used on the stream and the input size. We give tight bounds for the complexity of reversing a stream of length $n$ in several of the possible models. In the read-only and write-only model, we show that $p$-pass algorithms need memory space ${\Theta}(n/p)$. But if either the… CONTINUE READING
    1 Citations
    Sliding window order statistics in sublinear space

    References

    SHOWING 1-10 OF 33 REFERENCES
    On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
    • P. Beame, Trinh Huynh
    • Computer Science
    • 2008 49th Annual IEEE Symposium on Foundations of Computer Science
    • 2008
    • 22
    • Highly Influential
    • PDF
    Lower bounds for randomized read/write stream algorithms
    • 34
    • PDF
    The input/output complexity of sorting and related problems
    • 1,285
    • Highly Influential
    • PDF
    Tight Lower Bounds for Query Processing on Streaming and External Memory Data
    • 35
    • PDF
    On the Value of Multiple Read/Write Streams for Data Compression
    • 7
    • PDF
    Recognizing well-parenthesized expressions in the streaming model
    • 49
    • PDF
    Lower bounds for processing data with few random accesses to external memory
    • 18
    • Highly Influential
    • PDF
    Reversal complexity revisited
    • 17
    • PDF
    Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
    • 29
    • PDF
    Selection and sorting with limited storage
    • J. Munro, M. Paterson
    • Computer Science
    • 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
    • 1978
    • 231
    • PDF