User David Eisenstat

David Eisenstat

Member for 9 years, 2 months
Last seen more than a month ago

GitHub
davideisenstat.com
Brooklyn, NY, USA

19 Answers

Score Activity Newest

24 votes

Accepted

Enumerate all non-isomorphic graphs of a certain size

answered Sep 3, 2014 at 3:11

9 votes

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

sorting

answered Jan 6, 2017 at 17:47

6 votes

Accepted

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

complexity-theory np-hard set-cover

answered Oct 7, 2014 at 15:52

5 votes

Accepted

Smallest cost in weighted directed graph with combinations

graphs np-hard knapsack-problems

answered Jan 27, 2017 at 21:21

4 votes

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

complexity-theory lower-bounds

answered Mar 26, 2017 at 1:08

4 votes

Accepted

Prize collecting steiner tree

algorithm-analysis optimization approximation trees

answered Apr 4, 2013 at 12:32

4 votes

Accepted

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

algorithms graphs shortest-path

answered May 21, 2013 at 22:53

3 votes

Minimizing the maximum Manhattan distance

computational-geometry

answered Feb 13, 2019 at 16:30

3 votes

Accepted

Word tiling, where you must use each tile exactly once

complexity-theory np-complete strings permutations

answered Oct 13, 2014 at 18:07

2 votes

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

algorithm-analysis data-structures binary-trees amortized-analysis

answered Mar 18, 2015 at 18:53

2 votes

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

algorithms encoding-scheme

answered Feb 12, 2017 at 14:18

2 votes

Accepted

Longest "bounded" subsequence

algorithms subsequences

answered Oct 5, 2014 at 13:33

2 votes

Union grouping in bipartite graphs?

graphs data-structures bipartite-matching

answered Oct 8, 2014 at 18:25

1 vote

Largest N squares that fit in a rectangle

optimization computational-geometry packing square-grid

answered Oct 8, 2014 at 19:30

1 vote

Elements in a less than a value in a subarray

algorithms data-structures binary-trees search-trees

answered Oct 8, 2014 at 18:13

1 vote

Are those definitions of universal hash family equivalent?

algorithms algorithm-analysis hash hash-tables

answered May 22, 2013 at 0:16

1 vote

Citation for finding node disjoint paths using maximum flow

network-flow

answered Oct 29, 2020 at 12:35

0 votes

Calculating a jackpot winner based on probabilities

algorithms probabilistic-algorithms

answered Oct 29, 2020 at 13:22

0 votes

About the properties of the coresets in k-median clustering

algorithms randomized-algorithms

answered Nov 5, 2020 at 12:51

Stack Exchange Network

current community

your communities

more stack exchange communities

19 Answers

Enumerate all non-isomorphic graphs of a certain size

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

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

Smallest cost in weighted directed graph with combinations

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

Prize collecting steiner tree

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

Minimizing the maximum Manhattan distance

Word tiling, where you must use each tile exactly once

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

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

Longest "bounded" subsequence

Union grouping in bipartite graphs?

Largest N squares that fit in a rectangle

Elements in a less than a value in a subarray

Are those definitions of universal hash family equivalent?

Citation for finding node disjoint paths using maximum flow

Calculating a jackpot winner based on probabilities

About the properties of the coresets in k-median clustering