Introduction to algorithms
A gentle introduction to Haskell
ACM SIGPLAN Notices - Haskell special issue
Balanced trees with removals: an exercise in rewriting and proof
Science of Computer Programming
Statically checkable pattern abstractions
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Data Structures and Problem Solving Using Java
Data Structures and Problem Solving Using Java
A Second Year Course on Data Structures Based on Functional Programming
FPLE '95 Proceedings of the First International Symposium on Functional Programming Languages in Education
A simple implementation technique for priority search queues
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Journal of Functional Programming
Alternatives to two classic data structures
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Iteration and coiteration schemes for higher-order and nested datatypes
Theoretical Computer Science - Foundations of software science and computation structures
Analysis of the use of declarative languages for enhanced embedded system software development
Proceedings of the 20th annual conference on Integrated circuits and systems design
Pattern minimization problems over recursive data types
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
The chilling descent: making the transition to a conventional curriculum
Proceedings of the 2008 international workshop on Functional and declarative programming in education
Smallcheck and lazy smallcheck: automatic exhaustive testing for small values
Proceedings of the first ACM SIGPLAN symposium on Haskell
Purely functional 1-2 brother trees
Journal of Functional Programming
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Statically-directed dynamic automated test generation
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Pattern matching for the masses using custom notations
Science of Computer Programming
Towards generic programming with sized types
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
An overview of the Leon verification system: verification by translation to recursive functions
Proceedings of the 4th Workshop on Scala
| Hi-index | 0.00 |
Everybody learns about balanced binary search trees in their introductory computer science classes, but even the stouthearted tremble at the thought of actually implementing such a beast. The details surrounding rebalancing are usually just too messy. To show that this need not be the case, we present an algorithm for insertion into red-black trees (Guibas and Sedgewick, 1978) that any competent programmer should be able to implement in fifteen minutes or less.