User Realz Slaw

21 votes

1 answer

2k views

What classes of data structures can be made persistent?

asked Nov 22, 2013 at 18:13

15 votes

4 answers

2k views

Comparing rational numbers

asked Oct 23, 2012 at 17:48

15 votes

2 answers

3k views

Shortest non intersecting path for a graph embedded in a euclidean plane (2D)

asked Oct 20, 2013 at 23:27

12 votes

2 answers

2k views

Is there a generalization of Huffman Coding to Arithmetic coding?

asked Nov 8, 2015 at 21:56

9 votes

1 answer

8k views

Finding the k-shortest path between two nodes

asked Dec 11, 2013 at 0:25

9 votes

3 answers

6k views

Maintaining an efficient ordering where you can insert elements "in between" any two other elements in the ordering?

asked Sep 30, 2013 at 17:58

8 votes

0 answers

640 views

Chained operations on sequences with two operators

asked Nov 20, 2012 at 18:58

6 votes

1 answer

490 views

Division by a constant

asked Oct 9, 2013 at 15:46

6 votes

2 answers

238 views

Can we construct problems that can be solved in $\Theta(n^c)$ time, and tested in $O(n)$ time

asked Nov 21, 2013 at 14:40

6 votes

4 answers

317 views

Efficiently generating a uniformly random list of unique integers in a range

asked Jan 31, 2016 at 21:16

6 votes

1 answer

461 views

Reconstructing a screen of permuted pixels

asked Apr 12, 2016 at 23:42

5 votes

1 answer

618 views

Level-order traversal of a balanced tree, with no parent pointers in $\mathcal o(n)$ space

asked Nov 9, 2015 at 17:30

5 votes

1 answer

603 views

Can Euclidean TSP be exactly solved in time better than (sym)metric TSP?

asked Nov 20, 2013 at 22:46

5 votes

1 answer

820 views

What is the minimum square partition of an almost-square rectangle?

asked Nov 8, 2013 at 15:42

5 votes

1 answer

807 views

An incrementally-condensed transitive-reduction of a DAG, with efficient reachability queries

asked Oct 3, 2013 at 21:12

5 votes

1 answer

470 views

Is MIN or MAX-True-2-XOR-SAT NP-hard?

asked Nov 3, 2013 at 23:08

5 votes

1 answer

399 views

Finding containing sets in a set of sets

asked Jan 2, 2013 at 15:28

5 votes

0 answers

551 views

Best complexity of parity/comparison in the Residue Number System

asked Oct 23, 2013 at 21:28

4 votes

0 answers

317 views

Reduction from knapsack problem to Integer relation that equals one

asked Sep 11, 2012 at 2:29

4 votes

2 answers

140 views

Uniformly random efficient sampling of shortest s-t paths, with optimal random bits

asked Nov 17, 2013 at 1:51

3 votes

1 answer

78 views

2SUM with a weight

asked Nov 11, 2013 at 5:49

3 votes

1 answer

254 views

How to prove that the minimum square partition of a 3X2 rectangle has 3 squares

asked Nov 8, 2013 at 1:05

3 votes

2 answers

1k views

Carry-free multiplication operation

asked Oct 30, 2013 at 16:33

3 votes

1 answer

594 views

Shift-and-or multiplication operation

asked Oct 30, 2013 at 17:35

3 votes

2 answers

3k views

Priority queue with unique elements and sublinear time merge?

asked Nov 1, 2013 at 3:30

3 votes

0 answers

272 views

Generalization of XOR Linked Lists

asked Mar 18, 2016 at 16:08

2 votes

0 answers

27 views

Maximum Weight Planarization of Size $n$ [duplicate]

asked Mar 31, 2016 at 21:27

1 vote

0 answers

98 views

Looking for name of siblings-first-depth-second traversal order

asked Nov 10, 2015 at 17:29

1 vote

1 answer

229 views

Efficiently locating the maximum value in interval over large amounts of data points

asked Feb 1, 2016 at 4:20

1 vote

1 answer

4k views

Calculating traversal position of a node in a full binary tree, given its path

asked Dec 12, 2012 at 0:34

Stack Exchange Network

30 Questions

What classes of data structures can be made persistent?

Comparing rational numbers

Shortest non intersecting path for a graph embedded in a euclidean plane (2D)

Is there a generalization of Huffman Coding to Arithmetic coding?

Finding the k-shortest path between two nodes

Maintaining an efficient ordering where you can insert elements "in between" any two other elements in the ordering?

Chained operations on sequences with two operators

Division by a constant

Can we construct problems that can be solved in $\Theta(n^c)$ time, and tested in $O(n)$ time

Efficiently generating a uniformly random list of unique integers in a range

Reconstructing a screen of permuted pixels

Level-order traversal of a balanced tree, with no parent pointers in $\mathcal o(n)$ space

Can Euclidean TSP be exactly solved in time better than (sym)metric TSP?

What is the minimum square partition of an almost-square rectangle?

An incrementally-condensed transitive-reduction of a DAG, with efficient reachability queries

Is MIN or MAX-True-2-XOR-SAT NP-hard?

Finding containing sets in a set of sets

Best complexity of parity/comparison in the Residue Number System

Reduction from knapsack problem to Integer relation that equals one

Uniformly random efficient sampling of shortest s-t paths, with optimal random bits

2SUM with a weight

How to prove that the minimum square partition of a 3X2 rectangle has 3 squares

Carry-free multiplication operation

Shift-and-or multiplication operation

Priority queue with unique elements and sublinear time merge?

Generalization of XOR Linked Lists

Maximum Weight Planarization of Size $n$ [duplicate]

Looking for name of siblings-first-depth-second traversal order

Efficiently locating the maximum value in interval over large amounts of data points

Calculating traversal position of a node in a full binary tree, given its path