User Sayan Bandyapadhyay

5 votes

NP-completeness: Reduce to or reduce from?

answered May 13, 2014 at 18:21

4 votes

Accepted

Show that the running time of the build_heap function is $O(n)$

answered May 6, 2014 at 19:40

3 votes

Accepted

Cost of partitioning in quicksort

answered May 15, 2014 at 16:14

3 votes

Accepted

Shortest path in weighted(positive or negative) undirected graph

answered May 15, 2014 at 20:01

3 votes

Accepted

Red black tree partition to $\sqrt{n}$ trees

answered May 12, 2014 at 20:27

2 votes

Steiner tree four points example

answered May 21, 2014 at 19:39

2 votes

Tree data structure for fast merges

answered Apr 29, 2014 at 21:48

1 vote

What is the maximum achievable throughput in this communication using sliding window protocol?

answered May 10, 2014 at 23:31

1 vote

Understanding an algorithm for the gas station problem

answered May 20, 2014 at 1:05

1 vote

Accepted

Partition area using test function

answered May 20, 2014 at 17:38

1 vote

Accepted

Robot follows a path near an obstacle without colliding

answered Apr 29, 2014 at 21:37

0 votes

What is the difference between expected cost and average cost of an algorithm?

answered Apr 29, 2014 at 22:28

0 votes

Accepted

Find a maximal subgraph on a tree with conditions

answered May 6, 2014 at 18:43

-2 votes

Maximum amount of memory that can be allocated to a process

answered May 13, 2014 at 5:24

Stack Exchange Network

14 Answers

NP-completeness: Reduce to or reduce from?

Show that the running time of the build_heap function is $O(n)$

Cost of partitioning in quicksort

Shortest path in weighted(positive or negative) undirected graph

Red black tree partition to $\sqrt{n}$ trees

Steiner tree four points example

Tree data structure for fast merges

What is the maximum achievable throughput in this communication using sliding window protocol?

Understanding an algorithm for the gas station problem

Partition area using test function

Robot follows a path near an obstacle without colliding

What is the difference between expected cost and average cost of an algorithm?

Find a maximal subgraph on a tree with conditions

Maximum amount of memory that can be allocated to a process