| 2005 |
|---|
| 21 | EE | Chris Okasaki:
Alternatives to two classic data structures.
SIGCSE 2005: 162-165 |
| 2004 |
|---|
| 20 | | Chris Okasaki,
Kathleen Fisher:
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, ICFP 2004, Snow Bird, UT, USA, September 19-21, 2004
ACM 2004 |
| 2003 |
|---|
| 19 | EE | Chris Okasaki:
Theoretical Pearls.
J. Funct. Program. 13(4): 815-822 (2003) |
| 2000 |
|---|
| 18 | EE | Chris Okasaki:
Breadth-first numbering: lessons from a small exercise in algorithm design.
ICFP 2000: 131-136 |
| 17 | EE | Chris Okasaki:
An Overview of Edison.
Electr. Notes Theor. Comput. Sci. 41(1): (2000) |
| 16 | EE | Haim Kaplan,
Chris Okasaki,
Robert Endre Tarjan:
Simple Confluently Persistent Catenable Lists.
SIAM J. Comput. 30(3): 965-977 (2000) |
| 1999 |
|---|
| 15 | EE | Chris Okasaki:
From Fast Exponentiation to Square Matrices: An Adventure in Types.
ICFP 1999: 28-35 |
| 14 | | Chris Okasaki:
Red-Black Trees in a Functional Setting.
J. Funct. Program. 9(4): 471-477 (1999) |
| 1998 |
|---|
| 13 | EE | Haim Kaplan,
Chris Okasaki,
Robert Endre Tarjan:
Simple Confluently Persistent Catenable Lists (Extended Abstract).
SWAT 1998: 119-130 |
| 12 | | Edoardo Biagioni,
Kenneth Cline,
Peter Lee,
Chris Okasaki,
Christopher A. Stone:
Safe-for-Space Threads in Standard ML.
Higher-Order and Symbolic Computation 11(2): 209-225 (1998) |
| 11 | | Chris Okasaki:
Functional Pearl: Even Higher-Order Functions for Parsing.
J. Funct. Program. 8(2): 195-199 (1998) |
| 1997 |
|---|
| 10 | | Chris Okasaki:
Catenable Double-Ended Queues.
ICFP 1997: 66-74 |
| 9 | | Chris Okasaki:
Three Algorithms on Braun Trees.
J. Funct. Program. 7(6): 661-666 (1997) |
| 1996 |
|---|
| 8 | | Chris Okasaki:
Functional Data Structures.
Advanced Functional Programming 1996: 131-158 |
| 7 | | Chris Okasaki:
The Role of Lazy Evaluation in Amortized Data Structures.
ICFP 1996: 62-72 |
| 6 | | Gerth Stølting Brodal,
Chris Okasaki:
Optimal Purely Functional Priority Queues.
J. Funct. Program. 6(6): 839-857 (1996) |
| 1995 |
|---|
| 5 | | Chris Okasaki:
Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking.
FOCS 1995: 646-654 |
| 4 | | Chris Okasaki:
Purely Functional Random-Access Lists.
FPCA 1995: 86-95 |
| 3 | | Chris Okasaki:
Simple and Efficient Purely Functional Queues and Deques.
J. Funct. Program. 5(4): 583-592 (1995) |
| 1994 |
|---|
| 2 | | Chris Okasaki,
Peter Lee,
David Tarditi:
Call-by-Need and Continuation-Passing Style.
Lisp and Symbolic Computation 7(1): 57-82 (1994) |
| 1992 |
|---|
| 1 | | R. F. Swonger,
C. M. Scott,
Chris Okasaki,
Mary Shaw,
David Garlan:
Experience with a Course on Architectures for Software Systems.
CSEE 1992: 23-43 |
