user avatar
user avatar
user avatar
Xavier Labouze
  • Member for 10 years, 9 months
  • Last seen this week
72 answers
480 votes
177k views
977 bookmarks
What papers should everyone read?
39 answers
267 votes
134k views
641 bookmarks
What Books Should Everyone Read?
60 answers
228 votes
94k views
228 bookmarks
Major unsolved problems in theoretical computer science?
30 answers
140 votes
24k views
113 bookmarks
Problems Between P and NPC
13 answers
122 votes
12k views
134 bookmarks
Advice on good research practices
15 answers
119 votes
18k views
232 bookmarks
What Lecture Notes Should Everyone Read?
5 answers
102 votes
22k views
96 bookmarks
List of TCS conferences and workshops
13 answers
70 votes
8k views
53 bookmarks
Common false beliefs in theoretical computer science
12 answers
63 votes
3k views
24 bookmarks
Parameterized complexity from P to NP-hard and back again
33 answers
61 votes
4k views
20 bookmarks
Small steps for better TCS conferences?
15 answers
58 votes
3k views
26 bookmarks
Open access journals
9 answers
57 votes
24k views
42 bookmarks
Explain P = NP problem to 10 year old
16 answers
57 votes
4k views
46 bookmarks
What tools do you use to write papers?
6 answers
47 votes
2k views
19 bookmarks
Ways for a mathematician to stay informed of current research in complexity theory
2 answers
42 votes
3k views
11 bookmarks
Alphabet of single-tape Turing machine
6 answers
41 votes
3k views
18 bookmarks
Which model of computation is "the best"?
3 answers
40 votes
1k views
16 bookmarks
Selecting papers to read
5 answers
37 votes
2k views
11 bookmarks
When should you say what you know?
4 answers
37 votes
2k views
11 bookmarks
What is the smallest result you publish on ArXiv?
13 answers
36 votes
3k views
17 bookmarks
Easy decision problem, hard search problem
8 answers
36 votes
2k views
20 bookmarks
Collaborative tools for dummies/professors
6 answers
36 votes
7k views
10 bookmarks
Journals with quick reviewing
11 answers
34 votes
4k views
17 bookmarks
Concepts in theoretical CS that would be approachable ages 8-14
1 answer
32 votes
4k views
18 bookmarks
Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming
9 answers
30 votes
2k views
17 bookmarks
What is the best place to get BibTeX entries for computer science articles ?
7 answers
29 votes
22k views
18 bookmarks
Why is CNF used for SAT and not DNF?
2 answers
28 votes
9k views
19 bookmarks
How to publish a paper?
3 answers
27 votes
2k views
11 bookmarks
Cryptography without assumptions -- seeking an overview
3 answers
26 votes
2k views
8 bookmarks
Consequences of #P = FP
4 answers
26 votes
767 views
5 bookmarks
Missing Wikipedia articles