User TCSGrad

454

votes

70

answers

161k

views

What papers should everyone read?

big-list soft-question

Sep 20 at 15:13 VS. 215

229

votes

37

answers

110k

views

What Books Should Everyone Read?

reference-request soft-question big-list books

Dec 27 at 6:35 Grigory Yaroslavtsev 1,143

118

votes

13

answers

11k

views

Advice on good research practices

soft-question research-practice advice-request

Jul 13 '18 at 4:29 Community♦ 1

99

votes

37

answers

13k

views

What are the recent TCS books whose drafts are available online?

reference-request big-list books

Dec 25 at 5:55 kauray 125

90

votes

5

answers

18k

views

List of TCS conferences and workshops

soft-question big-list conferences

Jun 1 at 7:21 a3nm 3,724

75

votes

8

answers

8k

views

Are research papers hard to read?

soft-question research-practice

Oct 12 '14 at 4:54 Alessandro Cosentino 2,980

61

votes

33

answers

4k

views

Small steps for better TCS conferences?

soft-question big-list research-practice conferences

Feb 16 '16 at 6:58 Community♦ 1

59

votes

6

answers

9k

views

How to get a job

soft-question career advice-request

Apr 4 '12 at 19:24 Community♦ 1

58

votes

15

answers

2k

views

Open access journals

soft-question conferences journals

Sep 20 at 8:45 Pascal 50

55

votes

16

answers

4k

views

What tools do you use to write papers?

soft-question big-list research-practice writing

Mar 5 '13 at 15:42 Community♦ 1

54

votes

9

answers

22k

views

Explain P = NP problem to 10 year old

cc.complexity-theory soft-question teaching p-vs-np

Jan 16 '14 at 8:24 Community♦ 1

44

votes

5

answers

966

views

Casual tours around proofs

soft-question big-list

Nov 11 '11 at 8:00 Kris 143

41

votes

8

answers

4k

views

What do you do when you cannot make progress on the problem you have been working on?

soft-question research-practice

May 1 '16 at 14:54 Aryeh 6,252

40

votes

3

answers

5k

views

How to find interesting research problems

soft-question research-practice advice-request career

Sep 2 '14 at 18:12 Community♦ 1

40

votes

3

answers

1k

views

Selecting papers to read

soft-question advice-request

Mar 7 '14 at 0:02 Community♦ 1

38

votes

1

answer

2k

views

Prerequisite for learning GCT

reference-request big-list survey gct

Oct 23 '13 at 19:38 Joshua Grochow 30.7k

35

votes

8

answers

13k

views

Why go to theoretical computer science/research?

soft-question career

Sep 22 '14 at 8:12 Community♦ 1

35

votes

7

answers

6k

views

How do I get started in theoretical CS ?

soft-question advice-request career

Jan 5 '11 at 17:26 Community♦ 1

34

votes

11

answers

4k

views

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

soft-question teaching

Mar 18 '12 at 18:21 Saeed 2,749

34

votes

1

answer

2k

views

Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$

cc.complexity-theory randomness randomized-algorithms nondeterminism barriers

Jan 7 '13 at 19:47 Kaveh 16.4k

34

votes

11

answers

1k

views

Approximation algorithms for problems in P

ds.algorithms approximation-algorithms

May 13 '13 at 14:56 user13407 27

32

votes

4

answers

818

views

Hardness of approximation assuming NP != coNP

approximation-hardness conditional-results

Sep 9 '15 at 23:29 Abhinav 103

29

votes

2

answers

1k

views

When does “X is NP-complete” imply “#X is #P-complete”?

cc.complexity-theory np-hardness counting-complexity

May 24 '17 at 18:17 Tayfun Pay 1,663

28

votes

2

answers

8k

views

How to publish a paper?

soft-question research-practice paper-review

Jul 2 '11 at 21:33 Jukka Suomela 9,081

26

votes

4

answers

1k

views

Compendium of the Best Approximation and Hardness Results for NP optimization problems

ds.algorithms reference-request approximation-algorithms approximation-hardness

Aug 25 '11 at 16:14 Babak Behsaz 343

25

votes

2

answers

800

views

Advice for attending my first TCS conference

soft-question big-list conferences

Nov 25 '11 at 16:12 Community♦ 1

24

votes

5

answers

1k

views

What are some career options for someone with a computer scientist master degree?

soft-question advice-request career

Apr 29 '16 at 9:22 Community♦ 1

23

votes

16

answers

3k

views

What tools do you use to give presentations?

soft-question research-practice writing

Sep 2 '11 at 21:24 Community♦ 1

22

votes

5

answers

820

views

Curious about computer-assisted NP-completeness proofs

cc.complexity-theory reference-request soft-question reductions proof-assistants

Jun 1 '16 at 13:23 Community♦ 1

21

votes

5

answers

2k

views

Theoretical Applications for Approximation Algorithms

ds.algorithms approximation-algorithms big-picture application-of-theory

Feb 25 '12 at 8:52 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

41 Favorites

What papers should everyone read?

What Books Should Everyone Read?

Advice on good research practices

What are the recent TCS books whose drafts are available online?

List of TCS conferences and workshops

Are research papers hard to read?

Small steps for better TCS conferences?

How to get a job

Open access journals

What tools do you use to write papers?

Explain P = NP problem to 10 year old

Casual tours around proofs

What do you do when you cannot make progress on the problem you have been working on?

How to find interesting research problems

Selecting papers to read

Prerequisite for learning GCT

Why go to theoretical computer science/research?

How do I get started in theoretical CS ?

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

Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$

Approximation algorithms for problems in P

Hardness of approximation assuming NP != coNP

When does “X is NP-complete” imply “#X is #P-complete”?

How to publish a paper?

Compendium of the Best Approximation and Hardness Results for NP optimization problems

Advice for attending my first TCS conference

What are some career options for someone with a computer scientist master degree?

What tools do you use to give presentations?

Curious about computer-assisted NP-completeness proofs

Theoretical Applications for Approximation Algorithms