default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Okasaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1999
[b1]Chris Okasaki:
Purely functional data structures. Cambridge University Press 1999, ISBN 978-0-521-66350-2, pp. I-X, 1-220
Journal Articles
- 2003
- [j9]Chris Okasaki:
Theoretical Pearls. J. Funct. Program. 13(4): 815-822 (2003) - 2000
- [j8]Haim Kaplan, Chris Okasaki, Robert Endre Tarjan:
Simple Confluently Persistent Catenable Lists. SIAM J. Comput. 30(3): 965-977 (2000) - 1999
- [j7]Chris Okasaki:
Red-Black Trees in a Functional Setting. J. Funct. Program. 9(4): 471-477 (1999) - 1998
- [j6]Chris Okasaki:
Functional Pearl: Even Higher-Order Functions for Parsing. J. Funct. Program. 8(2): 195-199 (1998) - [j5]Edoardo Biagioni, Kenneth Cline, Peter Lee, Chris Okasaki, Christopher A. Stone
:
Safe-for-Space Threads in Standard ML. High. Order Symb. Comput. 11(2): 209-225 (1998) - 1997
- [j4]Chris Okasaki:
Three Algorithms on Braun Trees. J. Funct. Program. 7(6): 661-666 (1997) - 1996
- [j3]Gerth Stølting Brodal, Chris Okasaki:
Optimal Purely Functional Priority Queues. J. Funct. Program. 6(6): 839-857 (1996) - 1995
- [j2]Chris Okasaki:
Simple and Efficient Purely Functional Queues and Deques. J. Funct. Program. 5(4): 583-592 (1995) - 1994
- [j1]Chris Okasaki, Peter Lee, David Tarditi:
Call-by-Need and Continuation-Passing Style. LISP Symb. Comput. 7(1): 57-82 (1994)
Conference and Workshop Papers
- 2005
- [c12]Chris Okasaki:
Alternatives to two classic data structures. SIGCSE 2005: 162-165 - 2002
- [c11]Chris Okasaki:
Techniques for embedding postfix languages in Haskell. Haskell 2002: 105-113 - 2000
- [c10]Chris Okasaki:
Breadth-first numbering: lessons from a small exercise in algorithm design. ICFP 2000: 131-136 - [c9]Chris Okasaki:
An Overview of Edison. Haskell 2000: 60-73 - 1999
- [c8]Chris Okasaki:
From Fast Exponentiation to Square Matrices: An Adventure in Types. ICFP 1999: 28-35 - 1998
- [c7]Haim Kaplan, Chris Okasaki, Robert Endre Tarjan:
Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT 1998: 119-130 - 1997
- [c6]Chris Okasaki:
Catenable Double-Ended Queues. ICFP 1997: 66-74 - 1996
- [c5]Chris Okasaki:
Functional Data Structures. Advanced Functional Programming 1996: 131-158 - [c4]Chris Okasaki:
The Role of Lazy Evaluation in Amortized Data Structures. ICFP 1996: 62-72 - 1995
- [c3]Chris Okasaki:
Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking. FOCS 1995: 646-654 - [c2]Chris Okasaki:
Purely Functional Random-Access Lists. FPCA 1995: 86-95 - 1992
- [c1]Roy F. Swonger, Curtis M. Scott, Chris Okasaki, Mary Shaw, David Garlan:
Experience with a Course on Architectures for Software Systems. CSEE 1992: 23-43
Editorship
- 2004
- [e1]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, ISBN 1-58113-905-5 [contents]
Reference Works
- 2004
- [r1]Chris Okasaki:
Functional Data Structures. Handbook of Data Structures and Applications 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
