DHT performance

Brian Gough bjg@network-theory.co.uk
Tue May 12 08:44:00 GMT 2009


At Sat, 9 May 2009 20:34:08 -0400,
Gideon Simpson wrote:
> 
> Am I right that the DHT algorithm is not *fast* in the sense that it's  
> O(N^2)?

I believe that's true, yes.  As I understand it, the advantage is that
the overall constant in the runtime is small due to everything being
precomputed.



More information about the Gsl-discuss mailing list