Daniel Lemire's blog
lemire.me
Add New Subscription
Post
(required) *
Required; the Post you're subscribing to.
Comment
— All Comments/Replies —
Jun 27th, 2019 7:32 pm — "seebs" writes: In our roaring implementation, we have a[...]
Jun 27th, 2019 8:10 pm — "powturbo" writes: For two sorted arrays we can use the SVS[...]
Jun 28th, 2019 12:35 pm — "Lio" writes: Maybe this is a typo: “The log of the [...]
Jun 28th, 2019 6:10 pm — "Christopher Chang" writes: Ignoring memory hierarchy considerations[...]
Jun 28th, 2019 6:18 pm — "Christopher Chang" writes: More precisely, the approach I just desc[...]
Jun 28th, 2019 6:39 pm — "KWillets" writes: Hwang and Lin have a similar bound in th[...]
Jun 28th, 2019 6:49 pm — "Daniel Lemire" writes: Interesting reference. Though I have not[...]
Jun 28th, 2019 10:05 pm — "Daniel Lemire" writes: Thanks. I have now sketched something li[...]
Jun 28th, 2019 10:05 pm — "Daniel Lemire" writes: Right. And it is a bit like what Christo[...]
Jun 28th, 2019 10:06 pm — "Daniel Lemire" writes: And N. Kurz also privately alluded to th[...]
Jun 28th, 2019 11:05 pm — "KWillets" writes: It’s in Knuth ;)
Jun 29th, 2019 3:12 pm — "Daniel Lemire" writes: Of course, it would be in Knuth.
Jun 29th, 2019 6:29 pm — "Jörn Engel" writes: Ignoring memory hierarchy won’t work i[...]
Jul 1st, 2019 2:47 pm — "Daniel Lemire" writes: Ignoring memory hierarchy won’t work i[...]
Jul 1st, 2019 5:51 pm — "Jörn Engel" writes: There is another optimization we can cop[...]
Jul 6th, 2019 5:36 am — "Jim Apple" writes: I think you can do this in the same time[...]
Jul 6th, 2019 3:11 pm — "Daniel Lemire" writes: Thanks. This algorithm is described in t[...]
Jul 7th, 2019 6:26 am — "Jim Apple" writes: As far as caching goes, if the large arr[...]
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.
