The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick
Member for 8 years, 10 months
145 profile views
Last seen May 5 '20 at 20:35
- Theoretical Computer Science 10.8k 10.8k 22 gold badges2828 silver badges5959 bronze badges
- Computer Science 10.6k 10.6k 11 gold badge2121 silver badges4747 bronze badges
- Mathematics 744 744 66 silver badges1414 bronze badges
- Cross Validated 659 659 55 silver badges1313 bronze badges
- MathOverflow 509 509 55 silver badges1818 bronze badges
- View network profile
Top network posts
- 28 Probabilistic (randomized) algorithms before "modern" computer science appeared
- 28 Impact of Grothendieck's program on TCS
- 25 Are machine learning techniques "approximation algorithms"?
- 22 Implications of proof of abc conjecture for cs theory
- 21 computing the minimal NFA for a DFA
- 21 Examples of unexpected mathematical images
- 17 Is there a TM that halts on all inputs but that property is not provable?
- View more network posts →
Top tags (0)
This user has not participated in any tags.