User FrankW

30 votes

Accepted

Using base 80 for compressing files

answered Sep 10, 2014 at 13:00

29 votes

How to simulate a die given a fair coin

answered Aug 18, 2014 at 8:28

16 votes

Accepted

Is regex golf NP-Complete?

answered Jan 22, 2014 at 0:39

13 votes

Accepted

QuickSort Dijkstra 3-Way Partitioning: why the extra swapping?

answered Mar 8, 2014 at 12:15

13 votes

Word Frequency with Ordering in O(n) Complexity

answered Jun 5, 2014 at 9:33

11 votes

Accepted

Are regex crosswords NP-hard?

answered Sep 19, 2014 at 22:22

9 votes

Accepted

Bin packing problem or not?

answered Mar 1, 2014 at 12:08

9 votes

Accepted

Optimal Algorithm for checking if a number is a multiple of three

answered May 6, 2014 at 9:57

8 votes

Accepted

Why addition algorithm is not pseudo- polynomial?

answered May 8, 2014 at 13:54

8 votes

Accepted

Origins of misconception about using equality signs with Landau notation

answered Sep 14, 2014 at 8:34

8 votes

Accepted

Convert DFA to Regular Expression

answered Jul 18, 2014 at 12:33

7 votes

Accepted

Why can't we solve the dinner party problem by finding a maximum matching?

answered May 14, 2014 at 6:07

7 votes

Accepted

Number of Different AVL Tree

answered May 24, 2014 at 9:56

7 votes

Accepted

Solving the recurrence T(n) = 3T(n-2) with iterative method

answered May 1, 2014 at 8:46

7 votes

Accepted

Data Structure For Closest Pair Problem

answered Jan 26, 2014 at 15:42

6 votes

Accepted

$L \in RE/R$ such that $L^R \cup L \in R$

answered Jan 24, 2014 at 23:58

6 votes

Accepted

Defining a context-free grammar for $\{w \in \{0, 1\}^* : \#_0(w) = \#_1(w)\}$

answered Mar 17, 2014 at 23:19

6 votes

Accepted

Check whether it is possible to turn one BST into another using only right-rotations

answered Aug 21, 2014 at 9:20

6 votes

What is the notation for bounding running time in worst case with concrete example resulting in that worst case running time

answered Aug 21, 2014 at 9:36

6 votes

Remove minimum number of vertices to disconnect the graph

answered Sep 4, 2014 at 11:10

6 votes

Accepted

What is my error in reasoning about the complexity class $n^{o(1)}$

answered Sep 6, 2014 at 18:16

5 votes

Accepted

Kleene closure of the empty set

answered Sep 14, 2014 at 6:55

5 votes

minimum vertex set removal for edge-free graph

answered Sep 16, 2014 at 13:47

5 votes

Accepted

P, NP and polynomial time reduction?

answered Mar 18, 2014 at 20:33

5 votes

Accepted

Complexity of keeping track of $K$ smallest integers in a stream

answered Feb 3, 2014 at 19:56

5 votes

Accepted

Possible to connect arbitrary number of dots without intersections?

answered Apr 11, 2014 at 13:06

5 votes

Accepted

Small-step semantics: for-loops

answered Apr 21, 2014 at 10:32

4 votes

$T(n)=2T(n/2)+n\log n$ and the Master theorem

answered Apr 13, 2014 at 12:15

4 votes

Accepted

Reduction from Partition problem to 3-Partition problem

answered Apr 5, 2014 at 11:29

4 votes

Satisfiabilty 2-sat

answered May 3, 2014 at 8:58

Stack Exchange Network

140 Answers

Using base 80 for compressing files

How to simulate a die given a fair coin

Is regex golf NP-Complete?

QuickSort Dijkstra 3-Way Partitioning: why the extra swapping?

Word Frequency with Ordering in O(n) Complexity

Are regex crosswords NP-hard?

Bin packing problem or not?

Optimal Algorithm for checking if a number is a multiple of three

Why addition algorithm is not pseudo- polynomial?

Origins of misconception about using equality signs with Landau notation

Convert DFA to Regular Expression

Why can't we solve the dinner party problem by finding a maximum matching?

Number of Different AVL Tree

Solving the recurrence T(n) = 3T(n-2) with iterative method

Data Structure For Closest Pair Problem

$L \in RE/R$ such that $L^R \cup L \in R$

Defining a context-free grammar for $\{w \in \{0, 1\}^* : \#_0(w) = \#_1(w)\}$

Check whether it is possible to turn one BST into another using only right-rotations

What is the notation for bounding running time in worst case with concrete example resulting in that worst case running time

Remove minimum number of vertices to disconnect the graph

What is my error in reasoning about the complexity class $n^{o(1)}$

Kleene closure of the empty set

minimum vertex set removal for edge-free graph

P, NP and polynomial time reduction?

Complexity of keeping track of $K$ smallest integers in a stream

Possible to connect arbitrary number of dots without intersections?

Small-step semantics: for-loops

$T(n)=2T(n/2)+n\log n$ and the Master theorem

Reduction from Partition problem to 3-Partition problem

Satisfiabilty 2-sat