williamkuszmaul

9 ms·

31.
by williamkuszmaul 5y ago
The website doesn't seem to mention that several of the papers on the filesystem won best-paper awards at major conferences. The paper, Optimizing Every Operation in a Write-Optimized File System, in particular, won best-paper award at
32.
by williamkuszmaul 5y ago
Very nice post! Small comment: Ideally, big-O notation is for upper bounds. If you are doing lower bounds, you should ideally use big-Omega notation. But Omegas are harder to format in plain text, so it may be better to abuse notation and u
33.
by williamkuszmaul 5y ago
This is a link to the paper that the article is about: https://arxiv.org/abs/2107.01250
34.
Theoretical breakthrough could boost data storage(news.mit.edu)
2 points by williamkuszmaul 5y ago|1 comments
35.
by williamkuszmaul 5y ago
I like this post. I think it has an important overarching lesson, which is that when you're explaining something that's complicated, it's critical that the structure of the exposition itself is straightforward, that way there
36.
Linear Probing Made Faster(arxiv.org)
3 points by williamkuszmaul 5y ago|1 comments
37.
Using Math to Save Money on Train Tracks (Best Paper, FUN 2020)(algorithmsoup.wordpress.com)
1 points by williamkuszmaul 5y ago|0 comments
38.
I'm Above Average and So Are You(algorithmsoup.wordpress.com)
4 points by williamkuszmaul 6y ago|0 comments
39.
by williamkuszmaul 6y ago
Another example is locality sensitive hashing (introduced in late 1990s), which can be used as a data structure to efficiently solve the nearest-neighbor problem.
40.
by williamkuszmaul 6y ago
I agree. Related to this, sketches (i.e., small data structures that can be used to recover information about large data sets) are also fundamentally new (and most of the techniques are from the 21-st century).
41.
by williamkuszmaul 6y ago
No, cache-oblivious B-trees are not a variant of B-trees (although I can see why you might think the name suggests that). I classify them as fundamentally new because they technique they introduce was fundamentally different than past data
42.
by williamkuszmaul 6y ago
For perspective, here are some examples of other data structures in the past 35 years that are fundamentally new. (I am only including data structures that differ significantly from their predecessors) B-epsilon trees: These allow asymptoti
43.
The mathematics of how universities are underreporting Covid(algorithmsoup.wordpress.com)
18 points by williamkuszmaul 6y ago|4 comments
44.
The Probabilistic Method: Using Probability to Prove the Unexpected(algorithmsoup.wordpress.com)
4 points by williamkuszmaul 6y ago|0 comments
45.
by williamkuszmaul 6y ago
Name: Algorithm Soup One-liner: A bit of math and a byte of computer science. https://algorithmsoup.wordpress.com/
46.
Things you didn't know about qsort(algorithmsoup.wordpress.com)
4 points by williamkuszmaul 6y ago|0 comments
47.
by williamkuszmaul 6y ago
Do you have a reference for Feynman's title being a play on Webster's comment? That would be neat to have.
48.
The World's Simplest Interesting Algorithm (2019)(algorithmsoup.wordpress.com)
32 points by williamkuszmaul 6y ago|16 comments
49.
Proving Optimality for the 100 Prisoners Problem(algorithmsoup.wordpress.com)
1 points by williamkuszmaul 8y ago|0 comments
50.
The Surprising Combinatorics of Boarding an Airplane(algorithmsoup.wordpress.com)
3 points by williamkuszmaul 8y ago|0 comments
51.
An Almost-Secret Algorithm Researchers Used to Break Thousands of RSA Keys(algorithmsoup.wordpress.com)
420 points by williamkuszmaul 8y ago|109 comments
52.
Fibonacci Forumulas for Fantastic Fun(algorithmsoup.wordpress.com)
1 points by williamkuszmaul 8y ago|0 comments
53.
The Two-Envelope Paradox Explained(algorithmsoup.wordpress.com)
2 points by williamkuszmaul 8y ago|0 comments
54.
by williamkuszmaul 8y ago
The website doesn't seem to mention that several of the papers on the filesystem won best-paper awards at major conferences. The paper, Optimizing Every Operation in a Write-Optimized File System, in particular, won best-paper award at
55.
Cantor's Original Proof Had No Diagonals(algorithmsoup.wordpress.com)
3 points by williamkuszmaul 8y ago|0 comments
56.
What Made Gödel’s Incompleteness Theorem Hard to Prove(algorithmsoup.wordpress.com)
126 points by williamkuszmaul 8y ago|99 comments
57.
Random Walks Are Fun, Weird, and Slick to Analyze(algorithmsoup.wordpress.com)
2 points by williamkuszmaul 8y ago|0 comments
58.
Surprising Studies Are Usually Wrong(algorithmsoup.wordpress.com)
2 points by williamkuszmaul 8y ago|1 comments
59.
The Soviet Russian Version of Cantor's Diagonalization Argument(algorithmsoup.wordpress.com)
2 points by williamkuszmaul 8y ago|0 comments