user avatar
user avatar
user avatar
David Eisenstat
  • Member for 9 years, 2 months
  • Last seen more than a month ago
24 votes
Accepted

Enumerate all non-isomorphic graphs of a certain size

9 votes

Sort an array of $n$ elements when only $\log n$ are not in place

6 votes
Accepted

Proving NP hardness of maximum sum of means of a partition into k sets

5 votes
Accepted

Smallest cost in weighted directed graph with combinations

4 votes

Lower bound on the number of comparisons needed for finding the two largest elements

4 votes
Accepted

Prize collecting steiner tree

4 votes
Accepted

Finding the path of a negative weight cycle using Bellman-Ford

3 votes

Minimizing the maximum Manhattan distance

3 votes
Accepted

Word tiling, where you must use each tile exactly once

2 votes

Why isn't the time complexity of constructing a Fenwick tree tighter than $O(n\lg n)$?

2 votes

integer = c lg n (inputs of size n, Cormen 3rd, page 23)?

2 votes
Accepted

Longest "bounded" subsequence

2 votes

Union grouping in bipartite graphs?

1 vote

Largest N squares that fit in a rectangle

1 vote

Elements in a less than a value in a subarray

1 vote

Are those definitions of universal hash family equivalent?

1 vote

Citation for finding node disjoint paths using maximum flow

0 votes

Calculating a jackpot winner based on probabilities

0 votes

About the properties of the coresets in k-median clustering