user avatar
user avatar
user avatar
John L.
  • Member for 3 years, 10 months
  • Last seen this week
  • Canada
33 votes

What is this data structure/concept where a plot of points defines a partition to a space

21 votes
Accepted

Is the Berkeley tutorial on Fibonacci trees using wrong figures?

21 votes
Accepted

Are there variations of the regular runtimes of the Big-O-Notation?

17 votes
Accepted

"Guess the number" Problem on Turing machines

17 votes

Dynamic Programming vs Memoization

16 votes
Accepted

Prove that every substring closed language L ⊆ {0, 1}* is regular

16 votes
Accepted

How can you convince your colour-blind friend that two balls have the same colour?

16 votes
Accepted

Can I use the following method to prove an algorithm is correct?

15 votes
Accepted

Prove or Disprove: an infinite intersection of regular languages is a context-free language

14 votes
Accepted

Longest common substring in linear time

14 votes

Do any two spanning trees of a simple graph always have some common edges?

14 votes
Accepted

Is a "local" version of 3-SAT NP-hard?

12 votes

Conjecture: a half of a pairing context-free language must be a regular language

11 votes

O(·) is not a function, so how can a function be equal to it?

11 votes
Accepted

Are all MST minimum spanning trees reachable by Kruskal and Prim?

10 votes
Accepted

Divide and Conquer to identify a knight from n people

10 votes
Accepted

Can the diagonal language be empty?

9 votes
Accepted

Does a binary code with length 6, size 32 and distance 2 exist?

9 votes
Accepted

Asymptotic of $\frac{(\sqrt{n}+n-1)!}{(\sqrt{n})!(n-1)!}$

9 votes
Accepted

What role is the set, S playing in Dijkstra's algorithm given in the book CLRS?

9 votes

How to solve T(n)=2T(√n)+log n with the master theorem?

9 votes
Accepted

Why do DFAs with a single final state have less power?

9 votes
Accepted

All superlinear runtime algorithms are asymptotically equivalent to convex function?

8 votes

How can you find all unbalanced parens in a string in linear time with constant memory?

8 votes
Accepted

Is this language a context-free language or not?

8 votes

The first Turing machine

8 votes

Is Alan Turing's proof of the incomputability of halting problem invalid?

8 votes
Accepted

Hoare partitioning scheme in Quicksort

8 votes
Accepted

Sorting a large list of test scores

7 votes
Accepted

Do I need to consider instance restrictions when showing a language is in P?

1
2 3 4 5
33