Chris Okasaki

发表

Optimal purely functional priority queues

Gerth Stølting Brodal, Chris Okasaki, G. Brodal, 1996, Journal of Functional Programming.

Purely functional data structures

Chris Okasaki, Chris Okasaki, 1998 .

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

Chris Okasaki, Chris Okasaki, 2000, ICFP '00.

An Overview of Edison

Chris Okasaki, Chris Okasaki, 2001, Haskell.

Haskell Source Code

Chris Okasaki, 1998 .

Alternatives to two classic data structures

Chris Okasaki, Chris Okasaki, 2005, SIGCSE '05.

Simple Confluently Persistent Catenable Lists (Extended Abstract)

Haim Kaplan, Robert E. Tarjan, Chris Okasaki, 1998, SWAT.

Theoretical Pearls

Chris Okasaki, 2003, J. Funct. Program..

From fast exponentiation to square matrices: an adventure in types

Chris Okasaki, Chris Okasaki, 1999, ICFP '99.

Safe-for-Space Threads in Standard ML

Peter Lee, Edoardo Biagioni, Chris Okasaki, 1998, High. Order Symb. Comput..

Catenable double-ended queues

Chris Okasaki, Chris Okasaki, 1997, ICFP '97.

Three Algorithms on Braun Trees

Chris Okasaki, 1997, J. Funct. Program..

Functional Data Structures

Chris Okasaki, Chris Okasaki, 1996, Handbook of Data Structures and Applications.

The role of lazy evaluation in amortized data structures

Chris Okasaki, Chris Okasaki, 1996, ICFP '96.

Special issue on Algorithmic aspects of functional programming languages

Chris Okasaki, 2001 .

Computability and Complexity: From a Programming Perspective by Neil D. Jones, MIT Press, 1997.

Chris Okasaki, 1999 .

Alternatives to two classic data structures

Chris Okasaki, 2005 .

Functional Data Structures

Chris Okasaki, Chris Okasaki, 1996, Handbook of Data Structures and Applications.

FUNCTIONAL PEARLS Three Algorithms on Braun Trees

Chris Okasaki, 1997 .

Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, ICFP 2004, Snow Bird, UT, USA, September 19-21, 2004

Chris Okasaki, Kathleen Fisher, 2004, ICFP.

Techniques for embedding postfix languages in Haskell

Chris Okasaki, 2002, Haskell '02.

Fun with binary heap trees

Chris Okasaki, 2003 .

Functional Pearl: Even Higher-Order Functions for Parsing

Chris Okasaki, 1998, J. Funct. Program..

Red-black trees in a functional setting

Chris Okasaki, Chris Okasaki, 1999, Journal of Functional Programming.

Call-by-need and continuation-passing style

Peter Lee, Chris Okasaki, David Tarditi, 1994, LISP Symb. Comput..

Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function?

Chris Okasaki, Chris Okasaki, 1998, Journal of Functional Programming.

Purely functional random-access lists

Chris Okasaki, Chris Okasaki, 1995, FPCA '95.

Broken or not?: fixing undergraduate computing education in a multi-disciplinary world

Chris Okasaki, Herbert J. Bernstein, Rajendra K. Raj, 2007 .

Fast Mergeable Integer Maps

Chris Okasaki, Andy Gill, 1998 .

Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking

Chris Okasaki, Chris Okasaki, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Simple and efficient purely functional queues and deques

Chris Okasaki, Chris Okasaki, 1995, Journal of Functional Programming.

Experience with a Course on Architectures for Software Systems

Mary Shaw, David Garlan, Chris Okasaki, 1992, CSEE.

Views for Standard ML

Chris Okasaki, 2011 .

Simple Confluently Persistent Catenable Lists

Haim Kaplan, Robert E. Tarjan, Chris Okasaki, 2000, SIAM J. Comput..

Purely Functional Data Structures: Lazy Evaluation

Chris Okasaki, 1998 .