Stack Exchange

Raphael

Kaiserslautern, Germany

lmazy.verrech.net

Age: 25

I am a (fresh) PhD student at the Algorithms & Complexity group at University of Kaiserslautern, Germany. I research design and analysis of parallel algorithms and data structures.

In my free time I read books, enjoy (and sometimes make) music, code, work out and roam the webs.

You can find sources for all self-created images I post on Stack Exchange here.

top accounts reputation activity favorites subscriptions
Top Questions
Top Answers
36
How does one know which notation of time complexity analysis to use?
cs.stackexchange.com

30
Dealing with intractability: NP-complete problems
cs.stackexchange.com

20
Perplexed by Rice's theorem
cs.stackexchange.com

19
Are there non-constructive algorithm existence proofs?
cstheory.stackexchange.com

18
What kind of mathematical background is needed for complexity theory?
cstheory.stackexchange.com

17
The time complexity of finding the diameter of a graph
cs.stackexchange.com

16
Not all Red-Black trees are balanced?
cs.stackexchange.com

16
How does a computer work?
cs.stackexchange.com

16
Explaining the relevance of asymptotic complexity of algorithms to practice of designing algorithms
cs.stackexchange.com

16
What tools do you use to write papers?
cstheory.stackexchange.com

16
Why naturals instead of integers?
cstheory.stackexchange.com

15
Does there exist a priority queue with $O(1)$ extracts?
cs.stackexchange.com

15
Are there any counterintuitive results in theoretical computer science?
cstheory.stackexchange.com

14
Why is quicksort better than other sorting algorithms in practice?
cs.stackexchange.com

14
How to prove correctness of a shuffle algorithm?
cs.stackexchange.com

14
Are runtime bounds in P decidable? (answer: no)
cstheory.stackexchange.com

14
For a language to be programmable, is it mandatory that it be based on a context free grammar
cstheory.stackexchange.com

12
Strategies for becoming unstuck in understanding TCS
cs.stackexchange.com

12
Show that $\{xy \mid |x| = |y|, x\neq y\}$ is context-free
cs.stackexchange.com

12
Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?
cs.stackexchange.com

12
Does every large enough string have repeats?
cs.stackexchange.com

12
What are regular expressions good for?
cstheory.stackexchange.com

12
Resources/Books for Discrete Mathematics
math.stackexchange.com

11
Determining capabilities of a min-heap (or other exotic) state machines
cs.stackexchange.com

11
Graph searching: Breadth-first vs. depth-first
cs.stackexchange.com

11
AVL trees are not weight-balanced?
cs.stackexchange.com

11
Clustering of Songs (The Joe Walsh Problem)
cs.stackexchange.com

11
How many shortest distances change when adding an edge to a graph?
cs.stackexchange.com

11
How does the computer determine whether a number is smaller or greater than another?
cs.stackexchange.com

11
Is the Chomsky-hierarchy outdated?
cstheory.stackexchange.com

1 2 3 4 5