user avatar
user avatar
user avatar
collapsar
  • Member for 9 years, 3 months
  • Last seen this week
  • Saarbrücken, Germany
16 votes

Why can I look at a graph and immediately find the closest point to another point, but it takes me O(n) time through programming?

11 votes

Algorithm to find diameter of a tree using BFS/DFS. Why does it work?

5 votes
Accepted

What does an input string of epsilon mean?

4 votes

Concatenation of regular languages

4 votes

Do all states in a DFA must be connected?

4 votes

Given a sorted array $A$, how can it be efficiently determined whether $\exists i . A[i] = i$?

3 votes
Accepted

If a thread containing main terminates, can another thread do anything?

3 votes
Accepted

Solving for the matrix $W$ in an equation involving $W \cdot W^{T}$

3 votes
Accepted

Prove that the syntax is equivalent

2 votes

Constructing Tree (forest) from Ancestor function

2 votes
Accepted

Context free grammar for this language

2 votes

What is so special about a majority and why is it the key for Paxos to work? (Paxos made simple)

2 votes
Accepted

Prove that $L^r$ is context free without alphabet

1 vote

Reconstruct directed graph from list of ancestors for each node

1 vote
Accepted

Deterministic processing on probabilistic input

1 vote
Accepted

What language should the following DFA recognise?

1 vote

Simplification of CFG

1 vote

How to find all "nearly roots"?

1 vote

Prove that the set of all total functions is countable

0 votes

Extending Suurballe's disjoint path algorithm