Stack Exchange

Louis

http://math.fu-berlin.de/~theran/

top accounts reputation activity subscriptions
Top Questions
Top Answers
18
How can we assume that basic operations on numbers take constant time?
cs.stackexchange.com

15
How to prove that a language is not regular?
cs.stackexchange.com

12
Randomized Selection
cs.stackexchange.com

9
Proof that $\sum\limits_{i=1}^k \log(i)$ belongs to $O(k)$
math.stackexchange.com

8
HALF CLIQUE - NP Complete Problem
cs.stackexchange.com

8
Quicksort vs. insertion sort on linked list: performance
cs.stackexchange.com

8
Complexity of an optimisation problem in 3D
cs.stackexchange.com

7
Bijective proof? Examples?
math.stackexchange.com

7
Probability of 3 people in a room of 30 having the same birthday
math.stackexchange.com

7
P-Completeness and Parallel Computation
cs.stackexchange.com

7
Chernoff bounds and Monte Carlo algorithms
cs.stackexchange.com

7
Can PRNGs be used to magically compress stuff?
cs.stackexchange.com

6
Degree of vertices in planar graph
math.stackexchange.com

6
For what kind of data are hash table operations O(1)?
cs.stackexchange.com

6
Rectangle Coverage by Sweep Line
cs.stackexchange.com

6
How do O and Ω relate to worst and best case?
cs.stackexchange.com

6
Convex Hull algorithm - why it can't be computed using only comparisons
cs.stackexchange.com

6
Turing-unrecognizable language - what TM does?
cs.stackexchange.com

6
Physical (demanding) activities in Berlin
travel.stackexchange.com

5
Diameter of a graph when removing a non-cut edge
math.stackexchange.com

5
How to prove that $\log_2(n!) = \Theta(n\log_2[n])$?
math.stackexchange.com

5
Loop invariant for an algorithm
cs.stackexchange.com

5
Proving a specific language is regular
cs.stackexchange.com

5
Complexity of finding the largest $m$ numbers in an array of size $n$
cs.stackexchange.com

5
Edges in and out of cycles and their relation to connectivity of the graph
cs.stackexchange.com

5
Why is the set of NFA that accept all words in co-NPSPACE?
cs.stackexchange.com

5
Can't understand why the DP Subset Sum algorithm is not polynomial
cs.stackexchange.com

5
Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?
cs.stackexchange.com

5
Amplifying the correctness of $\mathsf{RP}$ algorithms using expander graphs
cs.stackexchange.com

5
Chernoff bound when we only have upper bound of expectation
cs.stackexchange.com

1 2