Engineer
Invented new data structure that is 3x - 5x more memory efficient than competing logarithmic-time data structures, such a AVL Trees, B-Trees, and Skip
... [More] Lists. Is usually just as fast, can be ~10% slower, and in some cases (vs Skip Lists) is quite a bit faster. [Less]
Analyzed
34 minutes
ago.
based on code collected
about 5 hours
ago.
This site uses cookies to give you the best possible experience.
By using the site, you consent to our use of cookies.
For more information, please see our
Privacy Policy