Theoretical Computer Science
Profile Activity
Meta user
Network profile
10,782
reputation
2
28
60

vzn

The algorithm designer who does not run experiments risks becoming lost in abstraction. —Sedgewick

272
answers
60
questions
~495k
people reached
  • U.S.
  • vzn1.wordpress.com
  • Member for 9 years, 6 months
  • 4,370 profile views
  • Last seen Feb 11 at 17:14

Communities (57)

Top Meta Posts
3
9

Top network posts

Top tags (199)

Score 49
Posts 85
Posts % 26
Score 42
Posts 36
Score 25
Posts 61
Score 25
Posts 34
Score 22
Posts 105
Score 19
Posts 50
View all tags →

Top posts (332)

All Questions Answers
Votes Newest
28 Probabilistic (randomized) algorithms before “modern” computer science appeared Sep 11 '12
27 Impact of Grothendieck's program on TCS Nov 14 '14
22 Implications of proof of abc conjecture for cs theory Sep 11 '12
21 computing the minimal NFA for a DFA Mar 23 '12
16 What is the “nearest” problem to the Collatz conjecture that has been successfully resolved? Jun 2 '12
16 Why are perfect graphs called perfect? Nov 21 '12
15 Beautiful results in TCS Feb 28 '12
13 Hardest known natural problem in P? Feb 28 '14
12 What CS blogs should everyone read? Apr 21 '14
12 Statements that imply $\mathbf{P}\neq \mathbf{NP}$ Oct 13 '14
View all questions and answers →

Badges (90)

Gold

2

Rarest

Silver

28

Rarest

Bronze

60

Rarest

View all badges →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.