Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao. Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. Electronic Colloquium on Computational Complexity (ECCC), 24:40, 2017. [doi]
@article{RamamoorthyR17,
title = {Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers},
author = {Sivaramakrishnan Natarajan Ramamoorthy and Anup Rao},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/040},
researchr = {https://researchr.org/publication/RamamoorthyR17},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {24},
pages = {40},
}