Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

83

SODA
2008
ACM

101views Algorithms» more SODA 2008»

Tight lower bounds for selection in randomly ordered streams

15 years 3 months ago

Tight lower bounds for selection in randomly ordered streams

Download people.csail.mit.edu

Amit Chakrabarti, T. S. Jayram, Mihai Patrascu

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams

» Comparisonbased timespace lower bounds for selection

» Lower Bounds for Quantile Estimation in RandomOrder and Multipass Streaming

» Randomized computations on large data sets tight lower bounds

» The shifting sands algorithm

» A tight lower bound for parity in noisy communication networks

» Tight Bounds for the Cover Time of Multiple Random Walks

» A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences

» Lower bounds for numberinhand multiparty communication complexity made easy

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Amit Chakrabarti, T. S. Jayram, Mihai Patrascu

Comments (0)