user avatar
user avatar
user avatar
Pratik Deoghare
  • Member for 11 years, 11 months
  • Last seen more than a month ago
43 votes

What papers should everyone read?

21 votes

Explain P = NP problem to 10 year old

21 votes

Concepts in theoretical CS that would be approachable ages 8-14

20 votes

Hard-looking algorithmic problems made easy by theorems

15 votes
Accepted

Is there a polynomial-time algorithm to solve graph isomorphism for Delaunay graphs of (finite) hexagonal tessellations?

13 votes

What papers should everyone read?

13 votes
Accepted

Reducing redundant edges from a dependency graph

11 votes
Accepted

What math courses should I take to prepare for a CS masters or PhD?

9 votes

Hard-looking algorithmic problems made easy by theorems

7 votes

Relationship between Turing Machine and Lambda calculus?

7 votes

What papers should everyone read?

6 votes

Selecting papers to read

5 votes

What is the difference between non-determinism and randomness?

4 votes

What papers should everyone read?

4 votes
Accepted

Software for Graph Analysis

4 votes
Accepted

Construction of graph embeddings with non-intersecting edges

4 votes

Great algorithms, machine learning and no linear algebra

4 votes

Quantum Bell-Type Inequalities

4 votes
Accepted

What is this notation style called?

3 votes

Circle graph visualisation

3 votes

Generation of unlabeled acyclic digraphs

2 votes

Research data organization

2 votes

Computing the Levenshtein distance quickly

2 votes

Genetic Algorithm to Draw a Graph? Position assignment problem

1 vote

Efficient encoding of integers with constant digit sum

1 vote

Application of calculus in computer science

1 vote

Paths and Probabilities for a Random Walk on a Graph

1 vote

Reducing complexity with parallelism

1 vote

Where do I turn for help with research/publishing?

1 vote

Finding twin vertices in graphs