Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more
AJed's user avatar
AJed's user avatar
AJed's user avatar
AJed
  • Member for 12 years, 1 month
  • Last seen more than 2 years ago
15 votes
Accepted

Retrieving the shortest path of a dynamic graph

15 votes

Is Category Theory useful for learning functional programming?

11 votes

Start learning about Theory of Distributed Systems?

10 votes

How to show that L*=(L*)*?

9 votes

Is the "subset product" problem NP-complete?

9 votes

Where to find published research papers?

5 votes
Accepted

Computational complexity of the clique problem

5 votes
Accepted

How Does Populating Pastry's Routing Table Work?

5 votes
Accepted

Mutual exclusion for n processes

5 votes
Accepted

Extracting the set of chains from a partial order

4 votes

Practical application of Finite State Machines

4 votes
Accepted

Compute relational composition in $O(|E||V|)$

4 votes
Accepted

What factors must one consider choosing an NN structure?

4 votes

Time Complexity of Genetic Algorithms

3 votes

DFS - Proof of Correctness

3 votes
Accepted

Dijkstra's algorithm for undirected graphs with negative edges

3 votes
Accepted

Summation of $O(n)$ from $1\le k\le n$

3 votes

How to approach Dynamic graph related problems

3 votes
Accepted

What do these arrows in design pattern diagrams mean?

3 votes
Accepted

Distributed algorithms - $\alpha, \beta$ synchronizers

3 votes

Transitive reduction of DAG

3 votes

Minimum spanning tree with two minimum edge weights

3 votes
Accepted

I have trouble to understand pattern calculus, could someone explain it in simple terms?

2 votes

Discrepancy between heads and tails

2 votes

Slow MIS Distributed Algorithm

2 votes

Theoretical CS and Math - self-study recommendations

2 votes

Randomized Rounding of Solutions to Linear Programs

2 votes

Applying algorithms on large data

2 votes
Accepted

Names of Softwares used for modeling

2 votes

Algorithm for determining minimal set of covering prefixes