The following pages link to Chris Okasaki (Q2817683):
Displaying 14 items.
- The role of lazy evaluation in amortized data structures (Q2817684) (← links)
- Breadth-first numbering (Q2943362) (← links)
- Three algorithms on Braun trees (Q4234772) (← links)
- Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function? (Q4236756) (← links)
- (Q4252750) (← links)
- Optimal purely functional priority queues (Q4339017) (← links)
- THEORETICAL PEARLS (Q4461771) (← links)
- Simple Confluently Persistent Catenable Lists (Q4507379) (← links)
- (Q4643867) (← links)
- Purely Functional Data Structures (Q4702190) (← links)
- An Overview of Edison (Q4921513) (← links)
- Red-black trees in a functional setting (Q4943361) (← links)
- Simple confluently persistent catenable lists (Q5054848) (← links)
- Catenable double-ended queues (Q5348866) (← links)
