Profile Activity

Radu GRIGore

Meta user

Network profile

Reputation

4,521

4.5k
4.2k
3.8k

2016
2017
2018
2019

Top tag

reference-request

Next privilege

5,000 Rep.

Approve tag wiki edits

Badges

Newest

Announcer

Next badge

74/100

Impact

18 posts edited

2 helpful flags

1,065 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

381 Favorites

Added Views Newest Activity Votes

565

votes

answers

116k

views

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

Jun 28 '16 at 16:57 Community♦ 1

455

votes

answers

162k

views

What papers should everyone read?

big-list soft-question

Sep 20 at 15:13 VS. 423

358

votes

answers

109k

views

Algorithms from the Book.

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

Jan 5 '19 at 10:30 xrq 953

307

votes

answers

193k

views

Core algorithms deployed

ds.algorithms big-picture application-of-theory

Nov 25 '13 at 22:41 Community♦ 1

218

votes

answers

87k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Sep 23 at 6:55 VS. 423

140

votes

answers

39k

views

What videos should everybody watch?

soft-question big-list

Jan 29 '17 at 0:00 Richard Cox 19

128

votes

answers

19k

views

Problems Between P and NPC

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

Nov 27 '18 at 12:17 Gamow 4,647

119

votes

answers

11k

views

Advice on good research practices

soft-question research-practice advice-request

Jul 13 '18 at 4:29 Community♦ 1

117

votes

answers

10k

views

How hard is unshuffling a string?

ds.algorithms open-problem

Feb 25 at 10:45 Mohammad Al-Turkistany 19.5k

113

votes

answers

16k

views

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list

Jan 23 '17 at 4:51 Community♦ 1

112

votes

answers

views

Examples of the price of abstraction?

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

Jun 22 '16 at 23:15 Community♦ 1

104

votes

answers

views

Solid applications of category theory in TCS?

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

May 8 at 9:06 michid 131

votes

answers

13k

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

votes

answers

views

A simple decision problem whose decidability is not known

computability decidability

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

votes

answers

19k

views

List of TCS conferences and workshops

soft-question big-list conferences

Jun 1 at 7:21 a3nm 6,504

votes

answers

14k

views

What would it mean to disprove Church-Turing thesis?

computability proofs hypercomputation

Oct 30 '18 at 18:39 Robert McGwier 1

votes

answers

views

Are research papers hard to read?

soft-question research-practice

Oct 12 '14 at 4:54 Alessandro Cosentino 3,640

votes

answers

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

votes

answers

19k

views

Uses of algebraic structures in theoretical computer science

reference-request big-list big-picture algebra

Mar 19 at 22:40 xrq 953

votes

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

votes

answers

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,224

votes

answers

views

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

cc.complexity-theory approximation-hardness

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

votes

answers

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.5k

votes

answers

views

Common false beliefs in theoretical computer science

big-list examples

May 17 '13 at 13:10 Community♦ 1

votes

answer

views

More on PH in PP?

cc.complexity-theory counting-complexity derandomization relativization

Mar 6 '16 at 21:46 Community♦ 1

votes

answers

views

How do I referee a paper?

soft-question big-list paper-review

Feb 23 '11 at 1:28 Community♦ 1

votes

answers

12k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 19

votes

answers

views

Small steps for better TCS conferences?

soft-question big-list research-practice conferences

Feb 16 '16 at 6:58 Community♦ 1

votes

answers

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 187

votes

answers

views

Polynomial-time algorithms with huge exponent/constant

ds.algorithms big-list

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

381 Favorites

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

Advice on good research practices

How hard is unshuffling a string?

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 $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

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

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

Common false beliefs in theoretical computer science

More on PH in PP?

How do I referee a paper?

Applications of topology to computer science

Small steps for better TCS conferences?

The origin of the notion of treewidth

Polynomial-time algorithms with huge exponent/constant