Skip to main content
Share Your Experience: Take the 2024 Developer Survey
D.W.'s user avatar
D.W.'s user avatar
D.W.'s user avatar
D.W.
Moderator
  • Member for 12 years, 2 months
  • Last seen this week

27 Earned bounties for 1,500 reputation

3 votes
Accepted
+50

How fast can we make generalized k-SAT?

1 vote
Accepted
+50

Complexity of multiplication when computing product of $m$ integers

2 votes
+25

Find the shortest path from a set of source points to the nearest source/destination point

0 votes
Accepted
+100

SAT formula for connected graphs on the grid

1 vote
Accepted
+50

Counting the number of satisfied models - given mathematical constraints

2 votes
Accepted
+50

Difference between regular grammar and CFG in generating computation histories and $\Sigma^*$

3 votes
Accepted
+50

Vertex cover of bipartite graph

5 votes
Accepted
+100

Proving a value is the result of the execution of an algorithm

2 votes
+50

Find common min in logarithmic time

1 vote
Accepted
+50

Longest path among subset of given points

5 votes
+50

Balanced Binary Search Tree Two-Sum with Constraints

7 votes
+50

Have I invented a new data structure?

4 votes
Accepted
+50

Prefix encoding of algebraic data types

3 votes
+50

Proof of Randomized Self-Adjusting Binary Search Tree

1 vote
Accepted
+100

"strongly relational m-consistency when the domains contain at most m elements implies satisfiability" plain wrong?

4 votes
Accepted
+50

Recover NLFSR description from given output

5 votes
Accepted
+50

Counting Total Number of Non-Equivalent Configurations in a 2-D Grid

2 votes
Accepted
+50

How to classify simple priority queue algorithm

2 votes
Accepted
+50

Eliminating ambiguity when referring to complexity in cases of multiple parameters and/or multiple results

5 votes
Accepted
+50

Time Complexity of Sort-Merge Join

8 votes
Accepted
+100

Is this probability distribution data structure already discovered?

4 votes
+50

Test cases for graph embeddability problem

4 votes
Accepted
+50

How to impose Euclidean distance constraint in a constraint satisfaction problem without quadratic constraints?

5 votes
Accepted
+50

How do you determine the number of errors in the Welch-Berlekamp algorithm?

3 votes
Accepted
+50

Contraint with three variables into three binary constraints

5 votes
Accepted
+50

Minimal size of contracting a DAG into a new DAG

6 votes
+25

Time complexity of a backtrack algorithm