Re:What are the lesser known but cool data structures?
by jamii on Sunday May 23, 2010 @07:45AM
(#1372145)
The general lesson is that randomized algorithms often remove the need for synchronization between concurrent processes. For example, choosing ids at random from a large space rather than coordinating to choose unique ids.
[ Parent
| on HN ]
There are no comments on this comment yet.