Journal of the ACM Bibliography

Selected papers that cite this one

• Arne Andersson. Faster deterministic sorting and searching in linear space. In 37th Annual Symposium on Foundations of Computer Science, pages 135-141, Burlington, Vermont, 14-16 October 1996. IEEE.

• Dan E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150-204, April 1992.

Selected references

• Greg N. Frederickson. Implicit data structures for the dictionary problem. Journal of the ACM, 30(1):80-94, January 1983.

• Dan E. Willard. Maintaining dense sequential files in a dynamic environment (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 114-121, San Francisco, California, 5-7 May 1982.

• Andrew C. Yao and F. Frances Yao. The complexity of searching an ordered random table (extended abstract). In 17th Annual Symposium on Foundations of Computer Science, pages 173-177, Houston, Texas, 25-27 October 1976. IEEE.

Shortcuts: