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 条
  • [1] Tight Lower Bounds for Differentially Private Selection
    Steinke, Thomas
    Ullman, Jonathan
    [J]. 2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 552 - 563
  • [2] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 255 - 262
  • [3] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. JOURNAL OF ALGORITHMS, 1990, 11 (02) : 242 - 251
  • [4] Tight Bounds for Distributed Selection
    Kuhn, Fabian
    Locher, Thomas
    Wattenhofer, Roger
    [J]. SPAA'07: PROCEEDINGS OF THE NINETEENTH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2007, : 145 - +
  • [5] Tight Bounds for Vertex Connectivity in Dynamic Streams
    Assadit, Sepehr
    Shah, Vihan
    [J]. 2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 213 - 227
  • [6] Tight Double Exponential Lower Bounds
    Bliznets, Ivan
    Hecher, Markus
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024, 2024, 14637 : 124 - 136
  • [7] Tight Lower Bounds for the Complexity of Multicoloring
    Bonamy, Marthe
    Kowalik, Lukasz
    Pilipczuk, Michal
    Socala, Arkadiusz
    Wrochna, Marcin
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (03)
  • [8] Bisections above Tight Lower Bounds
    Mnich, Matthias
    Zenklusen, Rico
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 184 - 193
  • [9] Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures
    Jorgensen, Allan Gronlund
    Larsen, Kasper Green
    [J]. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 805 - 813
  • [10] Tight Lower Bounds for Halfspace Range Searching
    Sunil Arya
    David M. Mount
    Jian Xia
    [J]. Discrete & Computational Geometry, 2012, 47 : 711 - 730
12345