User Xavier Labouze

476

votes

71

answers

171k

views

What papers should everyone read?

big-list soft-question

Apr 6 at 6:24 kalia 11

250

votes

39

answers

122k

views

What Books Should Everyone Read?

reference-request soft-question big-list books

Aug 14 at 19:16 M.S. Dousti 16.1k

226

votes

60

answers

92k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 '20 at 13:30 Community♦ 1

134

votes

29

answers

21k

views

Problems Between P and NPC

cc.complexity-theory np-hardness big-list np-intermediate

Aug 15 at 23:45 Mark S 802

120

votes

13

answers

12k

views

Advice on good research practices

soft-question research-practice advice-request

Jul 13 '18 at 4:29 Community♦ 1

115

votes

15

answers

17k

views

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list

Jan 23 '17 at 4:51 Community♦ 1

96

votes

5

answers

21k

views

List of TCS conferences and workshops

soft-question big-list conferences

Aug 18 at 2:25 Mahdi Cheraghchi 3,846

64

votes

11

answers

7k

views

Common false beliefs in theoretical computer science

big-list examples

May 17 '13 at 13:10 Community♦ 1

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

61

votes

12

answers

3k

views

Parameterized complexity from P to NP-hard and back again

cc.complexity-theory np-hardness big-list phase-transition

Jul 20 '19 at 19:45 user13136 2,437

58

votes

15

answers

2k

views

Open access journals

soft-question conferences journals

Sep 20 '19 at 8:45 Pascal 105

57

votes

9

answers

23k

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

56

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

47

votes

6

answers

2k

views

Ways for a mathematician to stay informed of current research in complexity theory

cc.complexity-theory soft-question research-practice

Jan 27 '11 at 5:53 Oleksandr Bondarenko 4,165

41

votes

6

answers

2k

views

Which model of computation is “the best”?

ds.algorithms reference-request soft-question machine-models

May 3 '18 at 17:26 Community♦ 1

41

votes

2

answers

2k

views

Alphabet of single-tape Turing machine

computability turing-machines

Mar 5 '11 at 21:11 Marzio De Biasi 21.7k

40

votes

3

answers

1k

views

Selecting papers to read

soft-question advice-request

Mar 7 '14 at 0:02 Community♦ 1

37

votes

5

answers

2k

views

When should you say what you know?

soft-question research-practice authorship

Nov 16 '10 at 17:54 Community♦ 1

36

votes

8

answers

2k

views

Collaborative tools for dummies/professors

soft-question research-practice software writing

Apr 5 '13 at 21:37 Community♦ 1

36

votes

6

answers

6k

views

Journals with quick reviewing

soft-question research-practice paper-review journals

Jul 4 '14 at 13:57 Robin Kothari 13.1k

36

votes

4

answers

2k

views

What is the smallest result you publish on ArXiv?

soft-question advice-request research-practice paper-review

Mar 29 '19 at 23:13 Community♦ 1

36

votes

13

answers

2k

views

Easy decision problem, hard search problem

cc.complexity-theory big-list

Oct 29 '13 at 15:01 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 3,403

31

votes

1

answer

4k

views

Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming

soft-question sat terminology

Aug 8 '17 at 6:44 András Salamon 18.4k

29

votes

9

answers

2k

views

What is the best place to get BibTeX entries for computer science articles ?

soft-question research-practice paper-review bibliography

Jan 4 '12 at 19:16 Community♦ 1

28

votes

2

answers

9k

views

How to publish a paper?

soft-question research-practice paper-review

Jul 2 '11 at 21:33 Jukka Suomela 11.1k

27

votes

7

answers

19k

views

Why is CNF used for SAT and not DNF?

ds.algorithms sat

Jun 18 '15 at 14:01 Lenar Hoyt 304

26

votes

4

answers

765

views

Missing Wikipedia articles

soft-question big-list survey

May 3 '17 at 5:34 Joshua Grochow 34.2k

26

votes

3

answers

2k

views

Consequences of #P = FP

cc.complexity-theory ds.algorithms complexity-classes counting-complexity ai.artificial-intel

Jan 28 '12 at 21:56 Community♦ 1

26

votes

3

answers

2k

views

Cryptography without assumptions — seeking an overview

cr.crypto-security

Dec 6 '13 at 12:58 Stefano Tessaro 41

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

56 Bookmarks

What papers should everyone read?

What Books Should Everyone Read?

Major unsolved problems in theoretical computer science?

Problems Between P and NPC

Advice on good research practices

What Lecture Notes Should Everyone Read?

List of TCS conferences and workshops

Common false beliefs in theoretical computer science

Small steps for better TCS conferences?

Parameterized complexity from P to NP-hard and back again

Open access journals

Explain P = NP problem to 10 year old

What tools do you use to write papers?

Ways for a mathematician to stay informed of current research in complexity theory

Which model of computation is “the best”?

Alphabet of single-tape Turing machine

Selecting papers to read

When should you say what you know?

Collaborative tools for dummies/professors

Journals with quick reviewing

What is the smallest result you publish on ArXiv?

Easy decision problem, hard search problem

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

Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming

What is the best place to get BibTeX entries for computer science articles ?

How to publish a paper?

Why is CNF used for SAT and not DNF?

Missing Wikipedia articles

Consequences of #P = FP

Cryptography without assumptions — seeking an overview