10

I recently read Okasaki and Brodal's paper "Optimal Purely Functional Priority Queues," which describes a fast priority queue based on data-structural bootstrapping, in which a simple and inefficient data structure is used to construct a robust and efficient structure. This seems like a really beautiful theoretical idea, but so far the only example I know of is the one from this paper.

Does anyone have any other examples of data-structural bootstrapping that would be a good starting point for further reading on the subject?

GEOCHET
  • 21,119
  • 15
  • 74
  • 98
templatetypedef
  • 362,284
  • 104
  • 897
  • 1,065
  • 2
    +1 for a great question. The paper, while interesting, is rather long. It might be a good idea to show an example of data-structural bootstrapping. – David Weiser Mar 23 '11 at 15:01

1 Answers1

5

Chris Okasaki's thesis has a whole chapter on data-structural bootstrapping, including some other examples and references to papers with even more.

jbapple
  • 3,297
  • 1
  • 24
  • 38
  • If you're interested in his thesis you might consider buying his book, of the same name, which is based on the thesis. – Joel Burget Mar 24 '11 at 03:31