The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick
Member for 7 years, 2 months
11 profile views
Last seen Feb 22 '14 at 19:35
- Theoretical Computer Science 10.8k 10.8k 22 gold badges2828 silver badges5959 bronze badges
- Computer Science 10.7k 10.7k 11 gold badge2222 silver badges4848 bronze badges
- Mathematics 764 764 66 silver badges1515 bronze badges
- Cross Validated 709 709 55 silver badges1414 bronze badges
- MathOverflow 519 519 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
- 25 Are machine learning techniques "approximation algorithms"?
- 22 Implications of proof of abc conjecture for cs theory
- 21 Examples of unexpected mathematical images
- 21 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.
Sep 24 '14