The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick
Member for 6 years, 6 months
0 profile views
Last seen Nov 7 '14 at 16:55
- Theoretical Computer Science 10.6k 10.6k 22 gold badges2626 silver badges5959 bronze badges
- Computer Science 10.5k 10.5k 11 gold badge2020 silver badges4545 bronze badges
- Mathematics 734 734 66 silver badges1414 bronze badges
- Cross Validated 649 649 44 silver badges1313 bronze badges
- MathOverflow 489 489 55 silver badges1818 bronze badges
- View network profile
Top network posts
- 28 Impact of Grothendieck's program on TCS
- 28 Probabilistic (randomized) algorithms before "modern" computer science appeared
- 24 Are machine learning techniques "approximation algorithms"?
- 22 Implications of proof of abc conjecture for cs theory
- 21 Examples of unexpected mathematical images
- 19 computing the minimal NFA for a DFA
- 17 Is there a TM that halts on all inputs but that property is not provable?
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.
Nov 7 '14