Should Tables Be Sorted?-Reference-Cited by-同舟云学术

Should Tables Be Sorted?

Published:1981-07 Issue:3 Volume:28 Page:615-628
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Yao Andrew Chi-Chih¹

Affiliation:

1. Department of Computer Science, Stanford University, Stanford, California

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference21 articles.

1. AHO A V. HOPCROFT J.E AND ULLMAN J D The Design and Analysls of Computer Algorithms Addison-Wesley Reading Mass. 1974 AHO A V. HOPCROFT J.E AND ULLMAN J D The Design and Analysls of Computer Algorithms Addison-Wesley Reading Mass. 1974

2. BENTLEY J DETIG D GUmAS L AND SAXE J. An optimal data structure for mmmaal-storage dynamic member searching Unpubhshed manuscript. BENTLEY J DETIG D GUmAS L AND SAXE J. An optimal data structure for mmmaal-storage dynamic member searching Unpubhshed manuscript.

3. BERGE C Graphs and Hypergraphs North-Holland Amsterdam 1973 BERGE C Graphs and Hypergraphs North-Holland Amsterdam 1973

4. Multidimensional Searching Problems

5. Efficient Storage and Retrieval by Content and Address of Static Files

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

1. Super-Logarithmic Lower Bounds for Dynamic Graph Problems;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Oblivious RAM Lower Bound;Encyclopedia of Cryptography, Security and Privacy;2023-07-28

3. Oblivious RAM Lower Bound;Encyclopedia of Cryptography, Security and Privacy;2023

4. Limits of Breach-Resistant and Snapshot-Oblivious RAMs;Advances in Cryptology – CRYPTO 2023;2023

5. An Invitation to Dynamic Graph Problems: Lower Bounds — III;Resonance;2022-10-19