Member for 8 years, 6 months
Graduate student at Saarland University. Interested in computational complexity and combinatorial optimization.
Top network posts
- 23 Why "alle Tale" and not "alle Täler"?
- 22 Theoretical foundations of Divide and Conquer
- 13 Heap - Give an $O(n \lg k)$ time algorithm to merge $k$ sorted lists into one sorted list
- 11 How fast can we decide whether a given DFA is minimal?
- 8 Why is one often requiring space constructibility in Savitch's theorem?
- 8 Finding maximal factorization of regular languages
- 8 Multiplication in $O(n\cdot \log n)$
- View more network posts →
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
Keeping a low profile.
This user hasn't posted yet.