Theoretical Computer Science
Meta user
Network profile
10,468
reputation
2
25
57

vzn

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

272
answers
60
questions
~452k
people reached
  • U.S.
  • vzn1.wordpress.com
  • Member for 7 years, 10 months
  • 4,128 profile views
  • Last seen Nov 11 at 5:02

Communities (56)

Top Meta Posts
3
9

Top network posts

Top tags (199)

Score 44
Posts 85
Posts % 26
Score 42
Posts 36
Score 25
Posts 34
Score 22
Posts 61
Score 21
Posts 105
Score 17
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
17 computing the minimal NFA for a DFA Mar 23 '12
16 Why are perfect graphs called perfect? Nov 21 '12
14 What is the “nearest” problem to the Collatz conjecture that has been successfully resolved? Jun 2 '12
14 Beautiful results in TCS Feb 28 '12
12 L/P/PSpace vs P/NP Aug 7 '15
12 Hardest known natural problem in P? Feb 28 '14
12 What CS blogs should everyone read? Apr 21 '14
View all questions and answers →

Badges (84)

Gold

2

Rarest

Silver

25

Rarest

Bronze

57

Rarest

View all badges →