Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
maccard
on Aug 30, 2014
|
parent
|
context
|
favorite
| on:
Invertible Bloom Lookup Tables (2011)
> This paper is needlessly hard to read (4 pages in before there's even an explanation!)
Not particularly bad going by the standard of some of the papers I've read.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Not particularly bad going by the standard of some of the papers I've read.