User Jeffε

6 votes

Accepted

Is sorting pairwise distances as hard as sorting arbitrary points?

answered Jun 29, 2019 at 16:52

6 votes

Reference request: Shortest homotopic curve via vertex releases

answered May 7, 2019 at 13:29

3 votes

TCS conferences for undergraduate students?

answered Jun 23, 2014 at 12:27

8 votes

Accepted

Intersection of two unsorted sets or lists

answered Jun 3, 2014 at 22:54

17 votes

Accepted

Provable gaps between decision tree complexity and "true" complexity

answered Apr 12, 2014 at 1:27

6 votes

Accepted

Fast extraction of pairs overlapping an interval

answered Dec 14, 2013 at 18:45

7 votes

What is the fastest algorithm for Weighted Planar Max Cut

answered Dec 13, 2013 at 4:29

4 votes

Accepted

What's wrong with my linear programming formulation of longest path?

answered Oct 23, 2013 at 12:05

12 votes

Can we compute $n$ from the bits of $3^n$ in $O(n)$ time?

answered Sep 13, 2013 at 22:42

17 votes

Accepted

Select two numbers that sum to $p$, using sub-linear query time

answered Aug 18, 2013 at 3:13

9 votes

Advanced techniques for determining complexity lower bounds

answered Jul 23, 2013 at 6:08

8 votes

Accepted

Can we perform an n-d range search over an arbitrary box without resorting to simplex methods?

answered Jul 8, 2013 at 18:24

9 votes

Subset-sum-difference problem

answered Jun 12, 2013 at 18:27

5 votes

combinatorical embedding

answered May 23, 2013 at 21:18

5 votes

Minimum shortest path cover of $n$ vertices in $R^m$

answered May 20, 2013 at 15:57

2 votes

Minimum-Cost Flow Problem with Constraint on the Total Incoming/Outgoing Flow for the Vertices

answered May 17, 2013 at 18:43

13 votes

Accepted

Shortest paths perturbation

answered May 10, 2013 at 14:35

4 votes

directed or bidirected in relation to mssp (Multiple source shortest path)

answered May 9, 2013 at 2:03

3 votes

Accepted

A generalization of the geometric closest pair problem to balls

answered May 7, 2013 at 14:29

5 votes

Number of Maximum Overlap in n-Dimensions

answered Apr 23, 2013 at 17:48

4 votes

The Drawing Challenge - a problem I made up and can't solve!

answered Apr 7, 2013 at 20:45

6 votes

Accepted

Max flow with conditional edges

answered Mar 28, 2013 at 23:27

14 votes

Accepted

Algorithms as fractals

answered Mar 22, 2013 at 18:11

12 votes

Sorting using a black box

answered Mar 18, 2013 at 16:41

23 votes

P vs NP: Instructive example of when Brute Force search can be avoided

answered Mar 8, 2013 at 20:20

21 votes

Can one return to a TCS research job after an excursion to a non-research industry job?

answered Mar 5, 2013 at 7:13

28 votes

Is it sometimes better to not publish at all?

answered Feb 23, 2013 at 17:39

7 votes

Is it possible to test if a computable number is rational or integer?

answered Feb 19, 2013 at 6:19

13 votes

Accepted

Multidimensional B+ tree

answered Feb 11, 2013 at 17:01

23 votes

Applications of Game theory in computer science?

answered Jan 23, 2013 at 3:57

Stack Exchange Network

141 Answers

Is sorting pairwise distances as hard as sorting arbitrary points?

Reference request: Shortest homotopic curve via vertex releases

TCS conferences for undergraduate students?

Intersection of two unsorted sets or lists

Provable gaps between decision tree complexity and "true" complexity

Fast extraction of pairs overlapping an interval

What is the fastest algorithm for Weighted Planar Max Cut

What's wrong with my linear programming formulation of longest path?

Can we compute $n$ from the bits of $3^n$ in $O(n)$ time?

Select two numbers that sum to $p$, using sub-linear query time

Advanced techniques for determining complexity lower bounds

Can we perform an n-d range search over an arbitrary box without resorting to simplex methods?

Subset-sum-difference problem

combinatorical embedding

Minimum shortest path cover of $n$ vertices in $R^m$

Minimum-Cost Flow Problem with Constraint on the Total Incoming/Outgoing Flow for the Vertices

Shortest paths perturbation

directed or bidirected in relation to mssp (Multiple source shortest path)

A generalization of the geometric closest pair problem to balls

Number of Maximum Overlap in n-Dimensions

The Drawing Challenge - a problem I made up and can't solve!

Max flow with conditional edges

Algorithms as fractals

Sorting using a black box

P vs NP: Instructive example of when Brute Force search can be avoided

Can one return to a TCS research job after an excursion to a non-research industry job?

Is it sometimes better to not publish at all?

Is it possible to test if a computable number is rational or integer?

Multidimensional B+ tree

Applications of Game theory in computer science?