Stack Exchange

Aaron Sterling

Evanston, IL

http://www.cs.iastate.edu/~sterling/

Co-editor: Theoretical Computer Science Community Blog

Visiting Predoctoral Fellow, Northwestern University.
PhD Candidate (ABD), Computer Science, Iowa State University.

Research interests: self-assembly, distributed computing, chemoinformatics, model checking.

Personal Blog

top accounts reputation activity subscriptions
Top Questions
155 votes

What videos should everybody watch?

soft-question big-list asked Sep 12, 2010 at 17:04
cstheory.stackexchange.com

105 votes

List of TCS conferences and workshops

soft-question big-list conferences asked Aug 21, 2011 at 17:29
cstheory.stackexchange.com

40 votes

Projective Plane of Order 12

co.combinatorics open-problem projective-geometry incidence-geometry finite-geometry asked Sep 14, 2010 at 1:13
mathoverflow.net

38 votes

Extended Church-Turing Thesis

soft-question lo.logic church-turing-thesis asked Jul 27, 2011 at 16:06
cstheory.stackexchange.com

26 votes

What are the consequences of $L = \oplus L$?

cc.complexity-theory complexity-classes logspace asked Nov 16, 2011 at 15:45
cstheory.stackexchange.com

22 votes

How much computational power fits into a cubic centimeter?

cc.complexity-theory quantum-computing ne.neural-evol physics natural-computing asked Nov 7, 2010 at 2:23
cstheory.stackexchange.com

18 votes

What is the status of fuzzy logic for TCS in 2011?

soft-question asked Apr 5, 2011 at 14:23
cstheory.stackexchange.com

15 votes

Tiling survey that updates "Tilings and patterns"?

reference-request mg.metric-geometry discrete-geometry textbook-recommendation tiling asked Mar 31, 2011 at 20:08
mathoverflow.net

14 votes

Projective Plane of Order 12

open-problem asked Sep 11, 2010 at 15:26
cstheory.stackexchange.com

14 votes

Infinitely large but locally finite computation problems

dc.distributed-comp asked Dec 6, 2011 at 16:43
cstheory.stackexchange.com

1 2 3

Top Answers
92
List of TCS conferences and workshops
cstheory.stackexchange.com

44
What papers should everyone read?
cstheory.stackexchange.com

42
Advice on good research practices
cstheory.stackexchange.com

41
What videos should everybody watch?
cstheory.stackexchange.com

33
Major unsolved problems in theoretical computer science?
cstheory.stackexchange.com

32
DNA-algorithms and NP-completeness
cstheory.stackexchange.com

27
Why have we not been able to develop a unified complexity theory of distributed computing?
cstheory.stackexchange.com

25
Correspondence between complexity classes and logic
cstheory.stackexchange.com

24
Hardness jumps in computational complexity?
cstheory.stackexchange.com

23
What videos should everybody watch?
cstheory.stackexchange.com

21
Many-one reductions vs. Turing reductions to define NPC
cstheory.stackexchange.com

19
Explain P = NP problem to 10 year old
cstheory.stackexchange.com

19
Surprising Results in Complexity (Not on the Complexity Blog List)
cstheory.stackexchange.com

19
History of recursion
cstheory.stackexchange.com

19
Applications of TCS to classical mathematics?
cstheory.stackexchange.com

19
What videos should everybody watch?
cstheory.stackexchange.com

18
Which algorithms are used most often in practice?
cstheory.stackexchange.com

15
Ternary (and beyond) computation and quantum computing?
cstheory.stackexchange.com

14
Forbidden minors for bounded treewidth graphs
cstheory.stackexchange.com

13
Writing universal recursive function
cstheory.stackexchange.com

12
Truly random number generator: Turing computable?
cstheory.stackexchange.com

11
What videos should everybody watch?
cstheory.stackexchange.com

10
How hard is unshuffling a string?
cstheory.stackexchange.com

9
Has Oracles actually provided intuition for proving anything in Complexity Theory?
mathoverflow.net

9
space-bounded TMs and oracles
cstheory.stackexchange.com

9
Automata Theory / Formal Language Thesis Topic
cstheory.stackexchange.com

9
Can we infer the next player in chess from the current board configuration?
cstheory.stackexchange.com

9
Great algorithms, machine learning and no linear algebra
cstheory.stackexchange.com

9
A square with entries whose adjacencies never repeat
cstheory.stackexchange.com

9
What is the right theoretical model to design algorithms for current and upcoming high performance computers
cstheory.stackexchange.com

1 2