User Radu GRIGore - Theoretical Computer Science Stack Exchange

bio	website	rgrig.appspot.com
	location	London, United Kingdom
	age	33
visits	member for	2 years, 9 months
	seen	yesterday
stats	profile views	554

	2,499 reputation	bio	website	rgrig.appspot.com	visits	member for	2 years, 9 months
1136 badges		location	London, United Kingdom		seen	yesterday

429

239

votes

66

answers

73

kviews

What papers should everyone read?

big-list soft-question

aug 16 at 9:00 vorushin 101

245

201

votes

5

answers

40

kviews

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

jun 15 '12 at 2:55 jbapple 2,192

203

188

votes

84

answers

43

kviews

Algorithms from the Book.

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

apr 18 '12 at 3:59 Sai Venkat 246

115

128

votes

53

answers

33

kviews

Major unsolved problems in theoretical computer science?

big-list open-problem

mar 31 at 21:18 Kaveh♦ 9,294

173

93

votes

35

answers

16

kviews

What videos should everybody watch?

soft-question big-list

apr 2 at 22:29 Yash 1

48

88

votes

9

answers

6

kviews

How hard is unshuffling a string?

ds.algorithms open-problem

mar 29 at 6:19 Aryabhata 1,365

29

74

votes

15

answers

3

kviews

Examples of the price of abstraction?

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

apr 13 at 19:27 Community♦ 1

43

68

votes

22

answers

6

kviews

Problems Between P and NPC

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

aug 20 '11 at 14:45 Lev Reyzin 7,255

98

64

votes

15

answers

7

kviews

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list

jul 31 at 4:02 Daniel Apon 3,372

61

62

votes

29

answers

5

kviews

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

reference-request big-list books

apr 17 at 9:37 Kaveh♦ 9,294

32

60

votes

5

answers

3

kviews

Solid applications of category theory in TCS?

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

apr 2 at 5:02 tcamps 3

41

60

votes

2

answers

4

kviews

List of TCS conferences and workshops

soft-question big-list conferences

sep 14 at 18:33 Huck Bennett 1,748

32

56

votes

20

answers

3

kviews

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 281

16

56

votes

34

answers

3

kviews

Small steps for better TCS conferences?

soft-question big-list research-practice conferences

apr 15 '12 at 19:35 Radu GRIGore 2,499

33

50

votes

3

answers

3

kviews

How do I referee a paper?

soft-question big-list paper-review

feb 23 '11 at 1:28 Hsien-Chih Chang 張顯之 4,316

28

49

votes

6

answers

4

kviews

How to get a job

soft-question career advice-request

apr 4 '12 at 19:24 Tim Sally 251

24

46

votes

10

answers

3

kviews

What would it mean to disprove Church-Turing thesis?

computability proofs hypercomputation

jul 14 '11 at 12:23 Giorgio Marinelli 11

17

46

votes

0

answers

2

kviews

more on PH in PP?

cc.complexity-theory counting-complexity derandomization relativization

nov 19 '11 at 20:30 Tayfun Pay 597

26

45

votes

11

answers

3

kviews

Common false beliefs in theoretical computer science

big-list examples

may 17 at 13:10 user1596990 1

17

45

votes

7

answers

2

kviews

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

cc.complexity-theory np-hardness big-picture

jul 26 '11 at 13:34 Zirui Wang 147

16

45

votes

3

answers

1

kviews

Evidence that matrix multiplication can be done in quadratic time?

ds.algorithms linear-algebra matrix-product

mar 8 '11 at 21:32 Suresh Venkat♦ 19.5k

23

45

votes

9

answers

3

kviews

Are research papers hard to read?

soft-question research-practice

jun 20 '12 at 23:57 Mike Samuel 150

9

45

votes

11

answers

2

kviews

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

cc.complexity-theory reference-request pcp

jun 16 '11 at 17:17 Dana Moshkovitz 6,992

22

45

votes

4

answers

1

kviews

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

cc.complexity-theory lower-bounds conditional-results

nov 5 '10 at 23:38 Robin Kothari 7,131

20

45

votes

10

answers

2

kviews

Provable statements about genetic algorithms

ds.algorithms ne.neural-evol

apr 11 at 7:42 kburjorj 51

27

45

votes

11

answers

2

kviews

Information Theory used to prove neat combinatorial statements?

co.combinatorics big-list it.information-theory

dec 31 at 6:08 DurgaDatta 506

17

44

votes

14

answers

1

kviews

Where and how did computers help prove a theorem?

proofs survey examples

nov 8 '10 at 13:28 Peter Shor 12.7k

11

42

votes

13

answers

2

kviews

Applications of TCS to classical mathematics?

reference-request big-list

nov 23 '10 at 20:35 Gil Kalai 2,276

24

39

votes

8

answers

7

kviews

Powerful Algorithms too complex to implement

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

jun 10 '11 at 7:21 singhsumit 465

12

38

votes

4

answers

1

kviews

Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?

cc.complexity-theory space-bounded big-picture

dec 2 '10 at 13:54 Michael Blondin 1,545

Radu GRIGore

254 Favorites