John Hoffman
Reputation
1,008
Top tag
Next privilege 2,000 Rep.
10 16
Impact
~27k people reached

# 152 Actions

 Jan25 awarded Yearling Sep29 awarded Favorite Question Sep25 awarded Popular Question Aug7 awarded Notable Question Jul22 awarded Popular Question Jul2 awarded Curious May14 awarded Notable Question Mar5 awarded Tumbleweed Feb26 revised What's an efficient algorithm for walking to a minimum spanning tree? edited tags Feb26 asked What's an efficient algorithm for walking to a minimum spanning tree? Feb24 revised Can I maintain the set of vertices that connect to a starting vertex from a stream of edges in a directed graph? added 17 characters in body Feb24 comment Can I maintain the set of vertices that connect to a starting vertex from a stream of edges in a directed graph? Yeah, the graph's directed … thanks for the inspiration though! Feb24 asked Can I maintain the set of vertices that connect to a starting vertex from a stream of edges in a directed graph? Feb23 comment How does substituting $\log{n}$ in help me solve this recurrence? Thanks, what do you mean by use the transformation that $S(n) = T(a^n)$? I know the master theorem, just not sure how it applies here. Feb23 revised How does substituting $\log{n}$ in help me solve this recurrence? added 34 characters in body Feb23 asked How does substituting $\log{n}$ in help me solve this recurrence? Jan25 awarded Yearling Nov7 awarded Good Question Sep25 awarded Popular Question May15 accepted What's the intuition behind this equality involving combinatorics?