Searching for authors named "Chris Okasaki" – sorted by Relevance.
-
Catenable Double-Ended Queues
- Catenable Double-Ended Queues Chris Okasaki School of Computer Science Carnegie Mellon
- Cited by 9 (0 self) – Add To MetaCart
-
Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design
- ) Chris Okasaki Department of Computer Science Columbia University cdo@(email omitted); ABSTRACT Every
- Cited by 19 (0 self) – Add To MetaCart
-
Views for Standard ML
- Views for Standard ML Chris Okasaki Columbia University cdo@(email omitted); Abstract
- Cited by 17 (0 self) – Add To MetaCart
-
Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking
- Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking Chris
- Cited by 3 (1 self) – Add To MetaCart
-
Functional Pearls - Three Algorithms on Braun Trees
- Three Algorithms on Braun Trees CHRIS OKASAKI y School of Computer Science, Carnegie Mellon
- Cited by 2 (0 self) – Add To MetaCart
-
Purely Functional Random-Access Lists
- Purely Functional Random-Access Lists Chris Okasaki School of Computer Science, Carnegie Mellon
- Cited by 14 (2 self) – Add To MetaCart
-
An Overview of Edison
- An Overview of Edison Chris Okasaki Department of Computer Science Columbia University cdo
- Cited by 10 (0 self) – Add To MetaCart
-
The Role of Lazy Evaluation in Amortized Data Structures
- The Role of Lazy Evaluation in Amortized Data Structures Chris Okasaki School of Computer
- Cited by 13 (2 self) – Add To MetaCart
-
Simple and efficient purely functional queues and deques
- Simple and Efficient Purely Functional Queues and Deques CHRIS OKASAKI School of Computer Science
- Cited by 24 (6 self) – Add To MetaCart
-
Functional Data Structures
- Functional Data Structures Chris Okasaki ? School of Computer Science, Carnegie Mellon University
- Cited by 156 (5 self) – Add To MetaCart

