User Joe

24 votes

Dijsktra's algorithm applied to travelling salesman problem

answered May 9, 2012 at 18:46

22 votes

Does there exist a priority queue with $O(1)$ extracts?

answered Apr 17, 2012 at 19:52

19 votes

Evaluating the average time complexity of a given bubblesort algorithm.

answered Mar 6, 2012 at 22:04

19 votes

Accepted

What is the difference between abstract and concrete data structures?

answered Nov 15, 2012 at 20:01

12 votes

Why can't DFS be used to find shortest paths in unweighted graphs?

answered Oct 8, 2012 at 23:14

11 votes

Showing that a problem in X is not X-Complete

answered Apr 3, 2012 at 21:28

11 votes

What are the characteristics of a $\Theta(n \log n)$ time complexity algorithm?

answered Feb 26, 2013 at 7:04

10 votes

Time spent on requirement and its effect on project success and development time

answered Mar 7, 2012 at 7:53

9 votes

What are the characteristics of a $\Theta(n \log n)$ time complexity algorithm?

answered Feb 26, 2013 at 19:08

7 votes

Accepted

Separate all leaves of a weighted tree with minimum weight cuts

answered Oct 30, 2012 at 20:22

7 votes

Accepted

Circle Intersection with Sweep Line Algorithm

answered Apr 23, 2012 at 19:20

6 votes

Algorithm to test whether a binary tree is a search tree and count complete branches

answered Mar 7, 2012 at 20:15

6 votes

Accepted

How to find the maximum independent set of a directed graph?

answered Mar 5, 2013 at 20:49

5 votes

Looking for a set implementation with small memory footprint

answered Jan 30, 2014 at 21:52

5 votes

Accepted

Deletion in min/max heaps

answered Nov 28, 2012 at 20:53

5 votes

Theoretical CS and Math - self-study recommendations

answered Dec 11, 2012 at 21:13

5 votes

Accepted

What is the height of an empty BST when using it in context for balancing?

answered Mar 14, 2012 at 3:04

5 votes

Most efficient know way to match orders

answered Apr 3, 2012 at 20:04

5 votes

Accepted

Finding paths with smallest maximum edge weight

answered Oct 8, 2012 at 4:39

4 votes

parallelizing $k$-means

answered Mar 5, 2014 at 7:58

4 votes

Accepted

Fast algorithm to find points on one side of hyperplane?

answered Apr 21, 2014 at 19:33

4 votes

Expected space consumption of skip lists

answered May 7, 2012 at 20:55

4 votes

Finding the height of all nodes in a forest

answered Oct 11, 2012 at 20:00

4 votes

Acquiring the necessary background for research

answered Jan 21, 2013 at 22:36

4 votes

Is transitivity required for a sorting algorithm

answered Dec 17, 2013 at 21:39

3 votes

How to verify number with Bob without Eve knowing?

answered Mar 14, 2012 at 20:32

2 votes

A Case Distinction on Dynamic Programming: Example Needed!

answered Mar 10, 2012 at 20:56

2 votes

What is the average height of a binary tree?

answered Jul 16, 2012 at 18:18

2 votes

Accepted

Can someone help me understand cache conscience radix sort? (excerpt from journal article attached)

answered Feb 7, 2013 at 6:59

2 votes

Where to find published research papers?

answered Dec 5, 2012 at 8:28

Stack Exchange Network

43 Answers

Dijsktra's algorithm applied to travelling salesman problem

Does there exist a priority queue with $O(1)$ extracts?

Evaluating the average time complexity of a given bubblesort algorithm.

What is the difference between abstract and concrete data structures?

Why can't DFS be used to find shortest paths in unweighted graphs?

Showing that a problem in X is not X-Complete

What are the characteristics of a $\Theta(n \log n)$ time complexity algorithm?

Time spent on requirement and its effect on project success and development time

What are the characteristics of a $\Theta(n \log n)$ time complexity algorithm?

Separate all leaves of a weighted tree with minimum weight cuts

Circle Intersection with Sweep Line Algorithm

Algorithm to test whether a binary tree is a search tree and count complete branches

How to find the maximum independent set of a directed graph?

Looking for a set implementation with small memory footprint

Deletion in min/max heaps

Theoretical CS and Math - self-study recommendations

What is the height of an empty BST when using it in context for balancing?

Most efficient know way to match orders

Finding paths with smallest maximum edge weight

parallelizing $k$-means

Fast algorithm to find points on one side of hyperplane?

Expected space consumption of skip lists

Finding the height of all nodes in a forest

Acquiring the necessary background for research

Is transitivity required for a sorting algorithm

How to verify number with Bob without Eve knowing?

A Case Distinction on Dynamic Programming: Example Needed!

What is the average height of a binary tree?

Can someone help me understand cache conscience radix sort? (excerpt from journal article attached)

Where to find published research papers?