Stack Exchange

What's new in purely functional data structures since Okasaki?

reference-request big-list ds.data-structures functional-programming Jun 15 '12 at 2:55 jbapple

cstheory.stackexchange.com

139

190 votes

21 answers

How to study math to really understand it and have a healthy lifestyle with free time?

soft-question advice Dec 31 '12 at 5:24 Grigor

math.stackexchange.com

104 votes

9 answers

How should I deal with discouragement as a graduate student?

graduate-school research Feb 18 at 6:35 Theresa Liao

academia.stackexchange.com

76 votes

Advice on good research practices

soft-question research-practice advice-request Nov 23 '10 at 23:12 Alessandro Cosentino

cstheory.stackexchange.com

57 votes

1 answer

Gerrymandering on a high-genus surface/can I use my powers for evil?

geometry combinatorial-geometry Mar 26 at 21:37 Alex Becker

math.stackexchange.com

56 votes

20 answers

Examples of “Unrelated” Mathematics Playing a Fundamental Role in TCS?

reference-request soft-question big-list topology Aug 23 '11 at 14:25 Jelani Nelson

cstheory.stackexchange.com

55 votes

12 answers

How important is knowing how to program for TCS?

soft-question big-list advice-request career Apr 22 at 17:16 lgidwani

cstheory.stackexchange.com

50 votes

How do I referee a paper?

soft-question big-list paper-review Feb 23 '11 at 1:28 Hsien-Chih Chang 張顯之

cstheory.stackexchange.com

49 votes

6 answers

How to get a job

soft-question career advice-request Apr 4 '12 at 19:24 Tim Sally

cstheory.stackexchange.com

48 votes

14 answers

What kind of mathematical background is needed for complexity theory?

cc.complexity-theory soft-question advice-request Oct 9 '12 at 13:23 Dana Moshkovitz

cstheory.stackexchange.com

45 votes

11 answers

Common false beliefs in theoretical computer science

big-list examples May 17 at 13:10 user1596990

cstheory.stackexchange.com

42 votes

7 answers

What can I do to recover from a short term burnout?

phd graduate-school motivation Feb 3 at 0:20 cbeleites

academia.stackexchange.com

39 votes

8 answers

Powerful Algorithms too complex to implement

ds.algorithms ds.data-structures big-list implementation Jun 10 '11 at 7:21 singhsumit

cstheory.stackexchange.com

39 votes

Casual tours around proofs

soft-question big-list Nov 11 '11 at 8:00 Kris

cstheory.stackexchange.com

39 votes

What's Up with O(1)?

search collections complexity data-access Nov 2 '11 at 2:17 CodeSlave

stackoverflow.com

38 votes

How do “scientific couples” (from different fields) find positions?

career personal-advice two-body-problem Mar 3 at 15:47 Nate Eldredge

academia.stackexchange.com

38 votes

6 answers

Good examples for how to write well in TCS

soft-question writing Oct 16 '12 at 6:24 Tom Gur

cstheory.stackexchange.com

37 votes

Positive topological ordering

ds.algorithms directed-acyclic-graph partial-order Nov 22 '10 at 10:23 domotorp

cstheory.stackexchange.com

36 votes

0 answers

A combinatorial version for the polynomial Hirsch conjecture

co.combinatorics cg.comp-geom open-problem linear-programming Oct 6 '10 at 2:12 Gil Kalai

cstheory.stackexchange.com

35 votes

Circuit lower bounds over arbitrary sets of gates

lower-bounds circuit-complexity circuit-families Jul 5 '11 at 20:50 Stasys

cstheory.stackexchange.com

35 votes

8 answers

What questions should one ask to the former/current students of a professor before deciding whether to do PhD under him/her?

phd advisor Mar 25 at 0:25 Sander Heinsalu

academia.stackexchange.com

34 votes

1 answer

Multiplying n polynomials of degree 1

ds.algorithms reference-request open-problem polynomials Sep 24 '10 at 6:31 Per Vognsen

cstheory.stackexchange.com

34 votes

Is there a sensible notion of an approximation algorithm for an undecidable problem?

computability approximation-algorithms parameterized-complexity halting-problem Jan 4 '11 at 13:25 Sariel Har-Peled

cstheory.stackexchange.com

33 votes

Applications of topology to computer science

reference-request ho.history-overview topology survey Apr 7 '11 at 22:24 Vijay D

cstheory.stackexchange.com

33 votes

1 answer

How many distinct colors are needed to lower-bound the choosability of a graph?

graph-theory co.combinatorics graph-colouring exp-time-algorithms Feb 11 '11 at 12:45 Serge Gaspers

cstheory.stackexchange.com

32 votes

6 answers

Geometric problems that are NP-complete in $R^3$ but tractable in $R^2$?

cc.complexity-theory reference-request cg.comp-geom Nov 12 '11 at 3:20 Zouzias

cstheory.stackexchange.com

32 votes

Inspirational talk for final year high school pupils

soft-question teaching Jun 15 '11 at 21:44 Sasho Nikolov

cstheory.stackexchange.com

31 votes