User Alexander Tiskin

15 votes

Applications of representation theory of the symmetric group

answered Sep 22, 2012 at 8:12

7 votes

efficient diff algorithm for trees and Levenshtein distance

answered Feb 16, 2012 at 21:27

7 votes

Accepted

What is a totally ordered sort of sets of a partial order called?

answered Aug 20, 2011 at 22:51

6 votes

Dijkstra parallelization

answered Dec 20, 2010 at 21:31

6 votes

Reducing complexity with parallelism

answered Dec 20, 2010 at 21:42

5 votes

Accepted

Parallel sorting: introduction and state of research

answered Aug 22, 2011 at 22:40

5 votes

Edit distance algorithms that depend on alphabet

answered Sep 13, 2012 at 20:15

4 votes

Memory requirement for fast matrix multiplication

answered Nov 23, 2016 at 11:29

3 votes

Small $\epsilon$-nets for points and half-planes without VC dimension

answered Sep 26, 2011 at 23:20

3 votes

How do you call a subsequence of consecutive elements ?

answered Mar 18, 2011 at 14:05

2 votes

Accepted

Using compression to improve edit distance computation

answered Dec 21, 2010 at 9:59

Stack Exchange Network

11 Answers

Applications of representation theory of the symmetric group

efficient diff algorithm for trees and Levenshtein distance

What is a totally ordered sort of sets of a partial order called?

Dijkstra parallelization

Reducing complexity with parallelism

Parallel sorting: introduction and state of research

Edit distance algorithms that depend on alphabet

Memory requirement for fast matrix multiplication

Small $\epsilon$-nets for points and half-planes without VC dimension

How do you call a subsequence of consecutive elements ?

Using compression to improve edit distance computation