I'm a third year PhD candidate in CS Theory. My primary research interest is in graph algorithms and combinatorics, particularly spanner-like problems.
10 What Turing-Complete models of computation carry a notion of time complexity that “agrees” with that of Turing Machines? sep 3 '13
2 Is there any track for proving $D=NP$, besides showing that $D$ has polynomial-bounded universal quantifiers? sep 30 '13
1 How many edges can you put in a graph such that every edge belongs to a minimal $k$-cycle? feb 11 '14