Impact
~4k
people reached
- 0 posts edited
- 0 helpful flags
- 15 votes cast
Sep
2 |
awarded | Nice Question |
Jul
2 |
awarded | Curious |
Mar
7 |
awarded | Popular Question |
Jan
28 |
comment |
Completion time of a process on a tree
actually the tree cannot consist D disjoint paths of length D from the root since it is constant degree tree (assuming D is larger). I wonder if that improves the running time further. |
Jan
27 |
accepted | Completion time of a process on a tree |
Jan
26 |
revised |
Completion time of a process on a tree
added 11 characters in body |
Jan
26 |
comment |
Completion time of a process on a tree
sounds perfect! let me just ruminate on this for a bit more, and I'll accept the answer. Thanks! |
Jan
24 |
asked | Completion time of a process on a tree |
Dec
26 |
awarded | Popular Question |
Sep
16 |
comment |
Minimum spanning tree of a random graph
Thanks for the pointers! They seem to be only slightly different models (randomly placed points etc), but I will definitely take a look. |
Sep
14 |
asked | Minimum spanning tree of a random graph |
Jan
27 |
accepted | Lower bound on sum of independent random variables |
Jan
27 |
asked | Lower bound on sum of independent random variables |
Nov
30 |
asked | Comparing two Markov chains |
Apr
12 |
awarded | Critic |
Mar
8 |
awarded | Enthusiast |
Mar
2 |
revised |
Partitioning a matrix with bounded row sums
deleted 64 characters in body |
Mar
2 |
comment |
Partitioning a matrix with bounded row sums
You’re right...I must have been not thinking. |
Mar
1 |
revised |
Partitioning a matrix with bounded row sums
new version |
Feb
18 |
comment |
Coin flipping and a recurrence relation
That’s great to know, Mike. |