Daniel Lemire's blog
lemire.me
Add New Subscription
Post
(required) *
Required; the Post you're subscribing to.
Comment
— All Comments/Replies —
Aug 18th, 2009 1:07 pm — "Daniel Lemire" writes: Thus accessing an entry in a hash table [...]
Aug 18th, 2009 1:17 pm — "Rachel Blum" writes: You’re playing semantic games. If you [...]
Aug 18th, 2009 1:37 pm — "Daniel Lemire" writes: @Rachel Thank you for your comments. Yes[...]
Aug 18th, 2009 1:47 pm — "Daniel Lemire" writes: @Sammy When using larger hash tables, yo[...]
Aug 18th, 2009 3:21 pm — "Rachel Blum" writes: That is *still* constant time… 4*O(1)=[...]
Aug 18th, 2009 3:46 pm — "Daniel Lemire" writes: @Rachel And yes, larger hash tables are [...]
Aug 18th, 2009 4:30 pm — "Rachel Blum" writes: As I said – it *is* a true statement w[...]
Aug 18th, 2009 4:52 pm — "Daniel Lemire" writes: @Rachel But for most hash table implemen[...]
Aug 18th, 2009 5:07 pm — "Daniel Lemire" writes: @Preston Regarding Pearson hashing, I sp[...]
Aug 18th, 2009 5:48 pm — "Colin Percival" writes: You lost a logarithm: “Multiplications[...]
Aug 18th, 2009 6:25 pm — "Rachel Blum" writes: @Daniel – even w/ an upper bound on th[...]
Aug 18th, 2009 6:37 pm — "Sammy Larbi" writes: When doing complexity analysis you are s[...]
Aug 18th, 2009 6:46 pm — "Daniel Lemire" writes: @Rachel I am happy with O(log k). But wh[...]
Aug 18th, 2009 9:44 pm — "Preston L. Bannister" writes: Perhaps I am not tracking your argument,[...]
Aug 18th, 2009 11:05 pm — "D. Eppstein" writes: Yes, multiplication isn’t really const[...]
May 1st, 2011 1:13 pm — "Daniel Lemire" writes: @sleepnova You are correct. My blog post[...]
May 1st, 2011 6:06 pm — "sleepnova" writes: @Rachel Don’t you think number of keys[...]
Email
(required) *
First Name
(required) *
Last Name
Deliver
(required) *
instantly
hourly
daily
weekly
Any value that is not
instantly
results in a digest instead of instant notifications.
