Abstract
AbstractWe present purely functional implementations of queues and double-ended queues (deques) requiring only O(1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behaviour of certain functions on lazy lists.
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. New Real-Time Simulations of Multihead Tape Units
2. Functional Pearls A symmetric set of efficient list operations
3. The Science of Programming
4. Hood R. (1982) The efficient implementation of very-high-level programming language constructs. PhD thesis, Department of Computer Science, Cornell University.
5. Sarnak N. (1986) Persistent Data Structures. PhD thesis, Department of Computer Sciences, New York University.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complex Python features in the wild;Proceedings of the 19th International Conference on Mining Software Repositories;2022-05-23
2. Sliding-Window Aggregation Algorithms;Encyclopedia of Big Data Technologies;2022
3. Scalability and precision by combining expressive type systems and deductive verification;Proceedings of the ACM on Programming Languages;2021-10-20
4. Promises are made to be broken: migrating R to strict semantics;Proceedings of the ACM on Programming Languages;2021-10-20
5. Regular numeral systems for data structures;Acta Informatica;2021-07-25