Simulation beats richness: new data-structure lower bounds-Reference-Cited by-同舟云学术

Simulation beats richness: new data-structure lower bounds

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Chattopadhyay Arkadev¹,Koucký Michal²,Loff Bruno³,Mukhopadhyay Sagnik⁴

Affiliation:

1. TIFR, India

2. Charles University in Prague, Czechia

3. INESC TEC, Portugal / University of Porto, Portugal

4. KTH, Sweden

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3188745.3188874

Reference75 articles.

1. A lower bound for finding predecessors in Yao's cell probe model

2. Almost k-wise independence versus k-wise independence

3. Anurag Anshu Naresh B Goud Rahul Jain Srijita Kundu and Priyanka Mukhopadhyay. 2017. Anurag Anshu Naresh B Goud Rahul Jain Srijita Kundu and Priyanka Mukhopadhyay. 2017.

4. V. Z. Arlazarov E. A. Dinic M. A. Kronrod and I. A. Faradzev. 1970. On economical construction of the transitive closure of a directed graph. Soviet Mathematics Doklady (1970) 11(5):1209–1210. V. Z. Arlazarov E. A. Dinic M. A. Kronrod and I. A. Faradzev. 1970. On economical construction of the transitive closure of a directed graph. Soviet Mathematics Doklady (1970) 11(5):1209–1210.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Streaming Lower Bounds and Asymmetric Set-Disjointness;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Nearly Optimal Communication and Query Complexity of Bipartite Matching;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. Hardness Self-Amplification from Feasible Hard-Core Sets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Worst-case to average-case reductions via additive combinatorics;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Query-to-Communication Lifting Using Low-Discrepancy Gadgets;SIAM Journal on Computing;2021-01