Tight Lower Bounds for Selection in Randomly Ordered Streams

被引：0
|
作者：
Chakrabarti, Amit [1 ]
Jayram, T. S. [1 ]
Patrascu, Mihai [1 ]
机构：
[1] IBM Almaden Res Ctr, San Jose, CA 95120 USA
来源：
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2008年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that any algorithm computing the median of a stream presented in random order, using polylog(n) space, requires an optimal Omega(log log n) passes, resolving an open question from the seminal paper on streaming by Munro and Paterson, from FOCS 1978.
引用
收藏
页码：720 / +
页数：3
相关论文
共 50 条
  • [31] TIGHT LOWER BOUNDS TO EIGENVALUES OF THE SCHRODINGER-EQUATION
    HILL, RN
    [J]. JOURNAL OF MATHEMATICAL PHYSICS, 1980, 21 (08) : 2182 - 2192
  • [32] Factorial Lower Bounds for (Almost) Random Order Streams
    Chiplunkar, Ashish
    Kallaugher, John
    Kapralov, Michael
    Price, Eric
    [J]. 2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 486 - 497
  • [33] Randomly colouring graphs with lower bounds on girth and maximum degree
    Dyer, M
    Frieze, A
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 579 - 587
  • [34] Randomly coloring graphs with lower bounds on girth and maximum degree
    Dyer, M
    Frieze, A
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2003, 23 (02) : 167 - 179
  • [35] Upper and Lower Bounds for Selection on the Mesh
    A. Condon
    L. Narayanan
    [J]. Algorithmica, 1998, 20 : 1 - 30
  • [36] Upper and lower bounds for selection on the mesh
    Condon, A
    Narayanan, L
    [J]. ALGORITHMICA, 1998, 20 (01) : 1 - 30
  • [37] Optimal quantum adversary lower bounds for ordered search
    Childs, Andrew M.
    Lee, Troy
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 869 - +
  • [38] Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
    Duraj, Lech
    Kuennemann, Marvin
    Polak, Adam
    [J]. ALGORITHMICA, 2019, 81 (10) : 3968 - 3992
  • [39] Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
    Cao, Yixin
    Sandeep, R. B.
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 875 - 880
  • [40] Tight upper and lower bounds for the reciprocal sum of Proth primes
    Bertalan Borsos
    Attila Kovács
    Norbert Tihanyi
    [J]. The Ramanujan Journal, 2022, 59 : 181 - 198
12345