Jeffε's user avatar
Jeffε's user avatar
Jeffε's user avatar
Jeffε
  • Member for 13 years, 8 months
  • Last seen more than 1 year ago
14 votes

Reading Papers with Unclear Typesetting

14 votes

Polynomial-time algorithms with huge exponent/constant

13 votes

How do you decide when you have enough research results to write a paper and to which journal you submit the paper

13 votes
Accepted

Triangulating a Planar Polygon

13 votes
Accepted

Shortest paths perturbation

13 votes
Accepted

Multidimensional B+ tree

12 votes
Accepted

What is the complexity of rectangle packing when rotations are allowed?

12 votes

Polynomial speedups with algorithms based on semidefinite programming

12 votes

Sorting using a black box

12 votes

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

12 votes

Truly random number generator: Turing computable?

12 votes
Accepted

Where can I find a copy of Guy Jacobson's thesis "Succinct Static Data Structures"?

12 votes
Accepted

How easy is it to switch the area of research in CS (going from M.Tech to PhD)?

11 votes

Rigour leading to insight

11 votes

Proof of Levenshtein distance

10 votes
Accepted

How many steps does this recurrence take to get to 2 (or 1)?

10 votes

Notable examples of the square root idea in complexity analysis

10 votes

Where and how did computers help prove a theorem?

10 votes

Problems that can be used to show polynomial-time hardness results

10 votes

How to make a paper stronger?

10 votes

Quality of a conference

10 votes
Accepted

Is there any good and free Introduction to topological graph theory

9 votes

Field extensions in CS

9 votes
Accepted

Does a pair of disjoint homotopic cycles in the dual separate the graph?

9 votes
Accepted

What is the worst case of the randomized incremental delaunay triangulation algorithm?

9 votes
Accepted

Computational complexities in factoring

9 votes

Subset-sum-difference problem

9 votes

Advanced techniques for determining complexity lower bounds

8 votes
Accepted

Intersection of two unsorted sets or lists

8 votes
Accepted

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