User Radu GRIGore

576

votes

6

answers

117k

views

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

Jun 28 '16 at 16:57 Community♦ 1

466

votes

70

answers

166k

views

What papers should everyone read?

big-list soft-question

Feb 15 at 16:45 gadmm 55

363

votes

93

answers

110k

views

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list

Jan 5 '19 at 10:30 Community♦ 1

313

votes

29

answers

195k

views

Core algorithms deployed

ds.algorithms big-picture application-of-theory

Nov 25 '13 at 22:41 Community♦ 1

223

votes

60

answers

90k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 at 13:30 Community♦ 1

145

votes

39

answers

41k

views

What videos should everybody watch?

soft-question big-list

Apr 5 at 1:36 Raphael Augusto 423

130

votes

28

answers

20k

views

Problems Between P and NPC

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

Nov 27 '18 at 12:17 Community♦ 1

121

votes

11

answers

10k

views

How hard is unshuffling a string?

ds.algorithms open-problem

Feb 25 '19 at 10:45 Mohammad Al-Turkistany 19.8k

119

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

114

votes

17

answers

8k

views

Examples of the price of abstraction?

ds.algorithms reference-request big-list lower-bounds

Jun 22 '16 at 23:15 Community♦ 1

105

votes

7

answers

8k

views

Solid applications of category theory in TCS?

pl.programming-languages lo.logic ct.category-theory

May 8 '19 at 9:06 Community♦ 1

101

votes

37

answers

14k

views

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

reference-request big-list books

Dec 25 '18 at 5:55 kauray 125

95

votes

15

answers

10k

views

A simple decision problem whose decidability is not known

computability decidability

Nov 7 at 22:23 Bjørn Kjos-Hanssen♦ 4,273

94

votes

5

answers

20k

views

List of TCS conferences and workshops

soft-question big-list conferences

Jun 1 '19 at 7:21 a3nm 6,766

88

votes

9

answers

15k

views

What would it mean to disprove Church-Turing thesis?

computability proofs hypercomputation

Jul 10 at 23:58 Abraham Lim Ken Zhi 1

79

votes

9

answers

9k

views

Are research papers hard to read?

soft-question research-practice

May 16 at 10:03 a3nm 6,766

74

votes

20

answers

8k

views

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

reference-request soft-question big-list topology

Aug 23 '11 at 14:25 Community♦ 1

72

votes

13

answers

20k

views

Uses of algebraic structures in theoretical computer science

reference-request big-picture big-list algebra survey

Jun 16 at 13:40 auspicious99 111

72

votes

9

answers

13k

views

Powerful Algorithms too complex to implement

ds.algorithms ds.data-structures big-list implementation

Jul 24 '18 at 17:51 Kevin A. Wortman 383

67

votes

7

answers

7k

views

Are runtime bounds in P decidable? (answer: no)

cc.complexity-theory approximation-hardness

Sep 14 '17 at 19:54 Dmytro Taranovsky 2,062

66

votes

7

answers

4k

views

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

cc.complexity-theory np-hardness big-picture

Mar 9 '14 at 21:27 Sylvain 3,244

65

votes

11

answers

4k

views

What are good references to understanding the proof of the PCP theorem?

cc.complexity-theory reference-request pcp

Sep 21 '16 at 19:42 Sasho Nikolov 17.6k

63

votes

3

answers

8k

views

How do I referee a paper?

soft-question big-list paper-review

Feb 23 '11 at 1:28 Community♦ 1

63

votes

11

answers

7k

views

Common false beliefs in theoretical computer science

big-list examples

May 17 '13 at 13:10 Community♦ 1

63

votes

1

answer

3k

views

More on PH in PP?

cc.complexity-theory counting-complexity derandomization relativization

Mar 6 '16 at 21:46 Community♦ 1

63

votes

14

answers

13k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 19

62

votes

17

answers

8k

views

Polynomial-time algorithms with huge exponent/constant

ds.algorithms big-list

Jan 22 '18 at 0:44 Thomas Klimpel 2,868

62

votes

5

answers

2k

views

Problems that can be used to show polynomial-time hardness results

cc.complexity-theory lower-bounds conditional-results

Feb 10 at 9:53 Michael Wehar 4,149

62

votes

5

answers

5k

views

The origin of the notion of treewidth

graph-theory co.combinatorics big-picture ho.history-overview treewidth

Jan 10 '19 at 9:44 Glorfindel 197

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

383 Bookmarks

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

What papers should everyone read?

Algorithms from the Book.

Core algorithms deployed

Major unsolved problems in theoretical computer science?

What videos should everybody watch?

Problems Between P and NPC

How hard is unshuffling a string?

Advice on good research practices

What Lecture Notes Should Everyone Read?

Examples of the price of abstraction?

Solid applications of category theory in TCS?

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

A simple decision problem whose decidability is not known

List of TCS conferences and workshops

What would it mean to disprove Church-Turing thesis?

Are research papers hard to read?

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

Uses of algebraic structures in theoretical computer science

Powerful Algorithms too complex to implement

Are runtime bounds in P decidable? (answer: no)

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

What are good references to understanding the proof of the PCP theorem?

How do I referee a paper?

Common false beliefs in theoretical computer science

More on PH in PP?

Applications of topology to computer science

Polynomial-time algorithms with huge exponent/constant

Problems that can be used to show polynomial-time hardness results

The origin of the notion of treewidth