The cell probe complexity of succinct data structures-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The cell probe complexity of succinct data structures

Published:2007-06 Issue:3 Volume:379 Page:405-417
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gál Anna,Miltersen Peter Bro

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference33 articles.

1. A lower bound for finding predecessors in Yao’s cell probe model;Ajtai;Combinatorica,1988

2. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs;Alon;IEEE Transactions on Information Theory,1992

3. Simple constructions of almost k-wise independent random variables;Alon;Random Structures and Algorithms,1992

4. Tighter bounds for nearest neighbor search and related problems in the cell probe model;Barkol;Journal of Computer and System Sciences,2002

5. Optimal bounds for the predecessor problem;Beame;Journal of Computer and System Sciences,2002

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

1. Locality Bounds for Sampling Hamming Slices;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. On partial information retrieval: the unconstrained 100 prisoner problem;Acta Informatica;2022-12-30

3. Sunflowers: from soil to oil;Bulletin of the American Mathematical Society;2022-09-12

4. SUNFLOWERS: FROM SOIL TO OIL;B AM MATH SOC;2022

5. Predecessor Search;ACM Computing Surveys;2020-10-15

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP