user avatar
user avatar
user avatar
Aaron Sterling
  • Member for 11 years, 10 months
  • Last seen more than 9 years ago
91 votes
Accepted

List of TCS conferences and workshops

44 votes

What papers should everyone read?

41 votes

What videos should everybody watch?

41 votes

Advice on good research practices

33 votes

Major unsolved problems in theoretical computer science?

31 votes
Accepted

DNA-algorithms and NP-completeness

26 votes
Accepted

Why have we not been able to develop a unified complexity theory of distributed computing?

25 votes

Correspondence between complexity classes and logic

24 votes

Hardness jumps in computational complexity?

23 votes

What videos should everybody watch?

21 votes

Many-one reductions vs. Turing reductions to define NPC

19 votes

Applications of TCS to classical mathematics?

19 votes
Accepted

History of recursion

19 votes

Surprising Results in Complexity (Not on the Complexity Blog List)

19 votes

What videos should everybody watch?

19 votes

Explain P = NP problem to 10 year old

18 votes
Accepted

Which algorithms are used most often in practice?

14 votes
Accepted

Ternary (and beyond) computation and quantum computing?

14 votes

Forbidden minors for bounded treewidth graphs

13 votes

Writing universal recursive function

12 votes

Truly random number generator: Turing computable?

11 votes

What videos should everybody watch?

10 votes

How hard is unshuffling a string?

9 votes

space-bounded TMs and oracles

9 votes
Accepted

Automata Theory / Formal Language Thesis Topic

9 votes
Accepted

Can we infer the next player in chess from the current board configuration?

9 votes
Accepted

A square with entries whose adjacencies never repeat

9 votes

Great algorithms, machine learning and no linear algebra

9 votes

What is the right theoretical model to design algorithms for current and upcoming high performance computers

8 votes

Are there descriptive complexity representations of quantum complexity classes?