Skip to main content

Joel Liu's Library tagged algorithms →  View Popular

28 Jun 08

Useless Factor: A couple GC algorithms in more detail

  • The idea is based on the Mark-Copy (MC) algorithm. The heap is divided up into a number of equally sized windows, say 40. One of these is the nursery, and the others act as tenured space. (I don't know why, but the papers about this seem to use a two-generation rather than three-generation model. I think it could easily be updated to use three generations, but I'll stick with this for now.) Each window has a logical number, with the nursery having the highest number.
02 Jun 08

Hacker News | Popularity Algorithms

How should I select the front page stories? Are there any standard references for this type of algorithms?

news.ycombinator.com/item - Preview

algorithms

17 Jan 08

Why Does RSA Work? : So Jake Says:

  • The algorithm is divided
    into three
    stages: precalculation, encryption, and decryption. Precalculation is


    performed a
    single time for each person with a public/private key pair, and

    encryption/decryption

    is performed for each message.
07 Jan 08

A practical scalable distributed B-tree

  • We propose a new algorithm for a practical, fault- tolerant, and scalable B-tree distributed over a set of servers. Our algorithm supports practical features not present in prior work: transactions that allow atomic execution of multiple operations over multiple B-trees, online migration of
  • We implemented our approach and show that its performance and scalability are comparable to previous schemes, yet it offers many additional practical features. We believe that our approach is quite general and can be used to implement other distributed data structures easily.
23 Dec 07

Damn Cool Algorithms, Part 3: Anagram Trees - Nick's blog

I hesitate to call this algorithm "damn cool", since it's something I invented*
it myself, but I think it is rather cool, and it fits the theme of my
algorithms posts, so here it is anyway.

blog.notdot.net/...hms,-Part-3-Anagram-Trees.html - Preview

algorithms

  • However, with a little more effort, and the above observation that we can
    generate a histogram that uniquely represents a given set of letters, we can
    generate a tree structure that makes looking up subset anagrams much more
    efficient. To build the tree, we follow this simple procedure:
1 - 20 of 21 Next ›
Showing 20▼ items per page

Selected Tags

Related Tags

Highlighter, Sticky notes, Tagging, Groups and Network: integrated suite dramatically boosting research productivity. Learn more »

Join Diigo