Chris Okasaki

26 papers A* 1A 6C 2Journal 11Unranked 4
YearRankTypeTitle / Venue / Authors
2023 J jnl
A Rotation of Data Structures.
J. Comput. Sci. Coll.
Thomas Cook, Alexander S. Mentis, Chris Okasaki
2007 J jnl
Broken or not?: fixing undergraduate computing education in a multi-disciplinary world.
J. Comput. Sci. Coll.
Rajendra K. Raj, Jennifer S. Kay, Herbert J. Bernstein, Chris Okasaki, Jeffrey Forbes, Virginia Teller
2005 A conf
Alternatives to two classic data structures.
SIGCSE
Chris Okasaki
2004 — ch.
Functional Data Structures.
Handbook of Data Structures and Applications
Chris Okasaki
2004 A ed.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, ICFP 2004, Snow Bird, UT, USA, September 19-21, 2004
ICFP
Chris Okasaki, Kathleen Fisher
2003 J jnl
Theoretical Pearls.
J. Funct. Program.
Chris Okasaki
2002 C conf
Techniques for embedding postfix languages in Haskell.
Haskell
Chris Okasaki
2000 C conf
An Overview of Edison.
Haskell
Chris Okasaki
2000 A conf
Breadth-first numbering: lessons from a small exercise in algorithm design.
ICFP
Chris Okasaki
2000 J jnl
Simple Confluently Persistent Catenable Lists.
SIAM J. Comput.
Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
1999 A conf
From Fast Exponentiation to Square Matrices: An Adventure in Types.
ICFP
Chris Okasaki
1999 — book
Purely functional data structures.
Chris Okasaki
1999 J jnl
Red-Black Trees in a Functional Setting.
J. Funct. Program.
Chris Okasaki
1998 J jnl
Functional Pearl: Even Higher-Order Functions for Parsing.
J. Funct. Program.
Chris Okasaki
1998 J jnl
Safe-for-Space Threads in Standard ML.
High. Order Symb. Comput.
Edoardo Biagioni, Kenneth Cline, Peter Lee, Chris Okasaki, Christopher A. Stone
1998 — conf
Simple Confluently Persistent Catenable Lists (Extended Abstract).
SWAT
Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
1997 A conf
Catenable Double-Ended Queues.
ICFP
Chris Okasaki
1997 J jnl
Three Algorithms on Braun Trees.
J. Funct. Program.
Chris Okasaki
1996 — conf
Functional Data Structures.
Advanced Functional Programming
Chris Okasaki
1996 J jnl
Optimal Purely Functional Priority Queues.
J. Funct. Program.
Gerth Stølting Brodal, Chris Okasaki
1996 A conf
The Role of Lazy Evaluation in Amortized Data Structures.
ICFP
Chris Okasaki
1995 A* conf
Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking.
FOCS
Chris Okasaki
1995 — conf
Purely Functional Random-Access Lists.
FPCA
Chris Okasaki
1995 J jnl
Simple and Efficient Purely Functional Queues and Deques.
J. Funct. Program.
Chris Okasaki
1994 J jnl
Call-by-Need and Continuation-Passing Style.
LISP Symb. Comput.
Chris Okasaki, Peter Lee, David Tarditi
1992 — conf
Experience with a Course on Architectures for Software Systems.
CSEE
Roy F. Swonger, Curtis M. Scott, Chris Okasaki, Mary Shaw, David Garlan