Chris Okasaki

According to our database, Chris Okasaki authored at least 23 papers between 1992 and 2005.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2005

Alternatives to two classic data structures.

Chris Okasaki

Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

2004

Functional Data Structures.

Chris Okasaki

Proceedings of the Handbook of Data Structures and Applications., 2004

2003

Theoretical Pearls.

Chris Okasaki

J. Funct. Program., 2003

2002

Techniques for embedding postfix languages in Haskell.

Chris Okasaki

Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, 2002

2000

Simple Confluently Persistent Catenable Lists.

Haim Kaplan, Chris Okasaki, Robert Endre Tarjan

SIAM J. Comput., 2000

An Overview of Edison.

Chris Okasaki

Proceedings of the 2000 ACM SIGPLAN Workshop on Haskell, 2000

Breadth-first numbering: lessons from a small exercise in algorithm design.

Chris Okasaki

Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

1999

Red-Black Trees in a Functional Setting.

Chris Okasaki

J. Funct. Program., 1999

From Fast Exponentiation to Square Matrices: An Adventure in Types.

Chris Okasaki

Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

Purely functional data structures.

Chris Okasaki

Cambridge University Press, ISBN: 978-0-521-66350-2, 1999

1998

Safe-for-Space Threads in Standard ML.

Edoardo Biagioni, Kenneth Cline, Peter Lee, Chris Okasaki, Christopher A. Stone

High. Order Symb. Comput., 1998

Functional Pearl: Even Higher-Order Functions for Parsing.

Chris Okasaki

J. Funct. Program., 1998

Simple Confluently Persistent Catenable Lists (Extended Abstract).

Haim Kaplan, Chris Okasaki, Robert Endre Tarjan

Proceedings of the Algorithm Theory, 1998

1997

Three Algorithms on Braun Trees.

Chris Okasaki

J. Funct. Program., 1997

Catenable Double-Ended Queues.

Chris Okasaki

Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

1996

Optimal Purely Functional Priority Queues.

Gerth Stølting Brodal, Chris Okasaki

J. Funct. Program., 1996

The Role of Lazy Evaluation in Amortized Data Structures.

Chris Okasaki

Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

Functional Data Structures.

Chris Okasaki

Proceedings of the Advanced Functional Programming, 1996

1995

Simple and Efficient Purely Functional Queues and Deques.

Chris Okasaki

J. Funct. Program., 1995

Purely Functional Random-Access Lists.

Chris Okasaki

Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking.

Chris Okasaki

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Call-by-Need and Continuation-Passing Style.

Chris Okasaki, Peter Lee, David Tarditi

LISP Symb. Comput., 1994

1992

Experience with a Course on Architectures for Software Systems.

Roy F. Swonger, Curtis M. Scott, Chris Okasaki, Mary Shaw, David Garlan

Proceedings of the Software Engineering Education, SEI Conference, 1992, Proceedings, 1992