Sciweavers

41 search results - page 1 / 9
» Lower bounds for randomized read write stream algorithms
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 4 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 4 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
13 years 6 months ago
Tight lower bounds for selection in randomly ordered streams
Amit Chakrabarti, T. S. Jayram, Mihai Patrascu