Dana Moshkovitz
  • Member for 11 years, 3 months
  • Last seen more than 6 years ago
13 answers
55 votes
4k views
38 bookmarks
Information Theory used to prove neat combinatorial statements?
7 answers
41 votes
5k views
15 bookmarks
When does randomization speed up algorithms and it "shouldn't"?
12 answers
41 votes
2k views
14 bookmarks
Gröbner bases in TCS?
3 answers
39 votes
2k views
12 bookmarks
Why are mod_m gates interesting?
1 answers
29 votes
1k views
10 bookmarks
Finding a biased coin using a few coin tosses
1 answers
25 votes
756 views
7 bookmarks
Regularity Lemma for Sparse Graphs
2 answers
25 votes
1k views
5 bookmarks
Why Ramanujan graphs are named after Ramanujan?
3 answers
22 votes
831 views
11 bookmarks
From Extractors to Pseudorandom Generators?
1 answers
22 votes
340 views
4 bookmarks
Belief propagation for approximate real 3LIN?
1 answers
17 votes
810 views
1 bookmarks
Who introduced the complexity class AC?
0 answers
16 votes
368 views
2 bookmarks
Looking for an operator on polynomials
2 answers
15 votes
1k views
3 bookmarks
Which randomized algorithms have exponentially small error probability?
2 answers
11 votes
648 views
3 bookmarks
Fun with inverse Ackermann
0 answers
8 votes
308 views
1 bookmarks
Are there sparsifiers that approximate vertices rather than edges?
1 answers
6 votes
239 views
1 bookmarks
Split find-min data structure that finds several small elements?
0 answers
4 votes
97 views
Thresholds for overlapping sets