StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

David Eisenstat

Rating
1664.20 (376th) 		Reputation
39,048 (2,876th)
Page: 1 ... 10 11 12 13 14 ... 32
Title Δ
how are multiple chunks of 8-bit words converted to a single number? -2.87
Algorithm- Find the number of subsets whose sum is in the given range 0.00
How do I plot Euclidean distance between tags on X-Y Plane -0.56
Max 3 color algorithm 0.00
Is there a better than O(N^2) Algorithm to take a set of colors and... 0.00
Efficient algorithm for finding all edges that induce a cycle +0.31
I don't understand how this algorithm will tell me if a graph i... 0.00
Does this algorithm generate a uniform distribution on the unit dis... -0.91
Combinatorial optimization with interdependent variables +0.90
Evaluate whether an expression is tautology or not 0.00
Calculating the number of graphs created and the number of vertices... +1.12
Efficient way to iterate over Gray code change positions -0.72
Math Based Algorithm 0.00
is there any O(logn) solution for [1+2a+3a^2+4a^3+....+ba^(b-1)] MO... 0.00
Finding the continued fraction of 2^(1/3) to very high precision -0.63
Binomial coefficients using dynamic programming and one dimensional... 0.00
What is the difference between divide and conquer, and branch and r... 0.00
How can one store a mutable set of items `(t, p)` so that queries f... +1.14
Trying to compare a recursive and an iterative algorithm +1.12
Shortest path in a grid collecting coins 0.00
How can we find maximum spanning tree in complete graph +0.31
Is a graph still considered cylic if its only in one direction? 0.00
Assigning jobs to workers 0.00
Karatsuba algorithm working for small numbers but not for big ones,... 0.00
Number of arrangements with no consecutive letter the same +0.11
Does 'Divide and conquer' yield O(log N) for unsorted array? 0.00
Finding the Maximum Cut of undirected graph using Stoer-Wagner algo... 0.00
Is there an efficient way to approximate (a / b)^n where a, b, and... -1.03
Finding optimal path (if exists) +0.29
A dance with an aglorithm's complexity +0.32
Select K distinct numbers from set {1, 2,…, n} such that 0.00
Find the maximum vertex-disjoint path cover 0.00
Complexity Issue With Minimum Priority Queue +1.57
Reduce time taken to find N line intersection 0.00
Balance workload or data of different nodes 0.00
Algorithm to find the intersection of two or more songs +0.30
Find the smallest integer whose sum of squares of digits add to the... +0.67
Finding max flow from minimum s-t cut 0.00
Next lexical "permutation" algorithm 0.00
How to minimise sum of 4 different people's scores, each in dis... 0.00
Distributed topological sort algorithm 0.00
Generating Diffie-hellman parameters (generator) +0.73
Subset Sum with a list of 2675 numbers -0.93
What is the fastest algorithm for intersection of two sorted lists? +1.02
efficient way of performing a discrete voronoi tessellation 0.00
How to get the next lexicographically bigger string in a sorted lis... +1.26
Finding a set of edges to remove such that that the degree of each... 0.00
Data structure with O(1) insertion and O(log(n)) search complexity? -0.50
Algorithm for finding all of the shared substrings of any length be... -0.13
Minimum covering radius in n dimensions 0.00