| Purely functional data structures C Okasaki Cambridge University Press, 1999 | 1038 | 1999 |
| Purely functional data structures C Okasaki Carnegie Mellon University, 1996 | 1038 | 1996 |
| Red-black trees in a functional setting C Okasaki Journal of functional programming 9 (4), 471-477, 1999 | 120 | 1999 |
| Simple and efficient purely functional queues and deques C Okasaki Journal of functional programming 5 (4), 583-592, 1995 | 102 | 1995 |
| Fast mergeable integer maps C Okasaki, A Gill Workshop on ML, 77-86, 1998 | 97 | 1998 |
| Optimal purely functional priority queues GS Brodal, C Okasaki Journal of Functional Programming 6 (6), 839-857, 1996 | 74 | 1996 |
| From fast exponentiation to square matrices: an adventure in types C Okasaki ACM SIGPLAN Notices 34 (9), 28-35, 1999 | 65 | 1999 |
| Experience with a course on architectures for software systems D Garlan, M Shaw, C Okasaki, CM Scott, RF Swonger Software Engineering Education: SEI Conference 1992 San Diego, California …, 1992 | 64 | 1992 |
| Views for standard ML C Okasaki SIGPLAN Workshop on ML, 14-23, 1998 | 60 | 1998 |
| Call-by-need and continuation-passing style C Okasaki, P Lee, D Tarditi Lisp and Symbolic Computation 7 (1), 57-81, 1994 | 59 | 1994 |
| Breadth-first numbering: lessons from a small exercise in algorithm design C Okasaki ACM SIGPLAN Notices 35 (9), 131-136, 2000 | 48 | 2000 |
| Purely functional random-access lists C Okasaki Proceedings of the seventh international conference on Functional …, 1995 | 46 | 1995 |
| Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking C Okasaki Proceedings of IEEE 36th Annual Foundations of Computer Science, 646-654, 1995 | 40 | 1995 |
| Functional Data Structures C Okasaki Handbook of Data Structures and Applications, 639-651, 2018 | 37* | 2018 |
| Functional data structures C Okasaki International School on Advanced Functional Programming, 131-158, 1996 | 37 | 1996 |
| Simple confluently persistent catenable lists H Kaplan, C Okasaki, RE Tarjan Scandinavian Workshop on Algorithm Theory, 119-130, 1998 | 36 | 1998 |
| An overview of Edison C Okasaki Electronic Notes in Theoretical Computer Science 41 (1), 60-73, 2001 | 33 | 2001 |
| Catenable double-ended queues C Okasaki Proceedings of the second ACM SIGPLAN international conference on Functional …, 1997 | 33 | 1997 |
| Simple confluently persistent catenable lists H Kaplan, C Okasaki, RE Tarjan SIAM Journal on Computing 30 (3), 965-977, 2000 | 31 | 2000 |
| The role of lazy evaluation in amortized data structures C Okasaki ACM SIGPLAN Notices 31 (6), 62-72, 1996 | 30 | 1996 |
