User Radu GRIGore

48 votes

Algorithms from the Book

answered Aug 18, 2010 at 16:07

44 votes

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

answered Sep 21, 2010 at 8:13

37 votes

What papers should everyone read?

answered Sep 12, 2010 at 12:14

29 votes

Accepted

Symbolic Execution is a case of Abstract Interpretation?

answered Nov 9, 2013 at 12:35

28 votes

Accepted

What is the theoretical basis of imperative programming?

answered Aug 18, 2010 at 13:07

22 votes

Books on programming language semantics

answered Dec 5, 2010 at 2:42

18 votes

What is the enlightenment I'm supposed to attain after studying finite automata?

answered Dec 23, 2012 at 8:57

14 votes

Accepted

Are innermost reductions perpetual in untyped λ-calculus?

answered Dec 15, 2010 at 2:23

13 votes

Relationship between contracts and dependent typing

answered Mar 1, 2011 at 11:07

13 votes

Accepted

Is it possible to generate a collision free hash function from an equality function?

answered Mar 14, 2011 at 20:44

13 votes

How important is knowing how to program for TCS?

answered Nov 8, 2011 at 19:10

13 votes

Accepted

Original Hoare Logic termination paper

answered Oct 7, 2012 at 14:37

12 votes

What do we know about provably correct programs?

answered Jan 2, 2011 at 9:45

11 votes

Accepted

Limits on lock-free collections?

answered Jan 27, 2011 at 16:28

11 votes

#SAT Solver download

answered Sep 15, 2010 at 10:35

11 votes

For which algorithms is there a large gap between the theoretical analysis and reality?

answered Aug 19, 2010 at 12:18

11 votes

Small steps for better TCS conferences?

answered Apr 15, 2012 at 19:35

11 votes

How to Create Mission Critical Software?

answered Sep 16, 2012 at 21:09

10 votes

Where and how did computers help prove a theorem?

answered Aug 18, 2010 at 11:06

9 votes

Accepted

How to find the cycles which, together, involve the biggest number of non-shared edges in a directed graph?

answered Apr 16, 2012 at 15:59

8 votes

Proof assistant for writing mathematics

answered Feb 24, 2011 at 9:55

8 votes

Practical applications of the Theory of Equality with Uninterpreted Functions (EUF)

answered Jan 17, 2011 at 15:13

7 votes

Well known classes of boolean formulas that require exponentially long resolution proofs

answered Aug 20, 2010 at 6:41

6 votes

Heuristics for estimating the efficiency of Reduced Ordered Binary Decision Diagrams?

answered Aug 31, 2010 at 15:18

6 votes

Reference Request: Application of Block Designs to Software Testing

answered Sep 3, 2010 at 8:56

6 votes

Complexity of n-queens-completion?

answered Dec 30, 2014 at 20:50

5 votes

Accepted

Graph with minimum number of edges having given sets of nodes as its paths

answered Jan 18, 2015 at 10:24

5 votes

Unary parametricity vs. binary parametricity

answered May 30, 2012 at 10:40

5 votes

Can words in regular languages be generated by automata in a unique way?

answered Sep 7, 2010 at 16:55

5 votes

Streaming algorithms suitable for undergrad course

answered Dec 19, 2014 at 14:34

Stack Exchange Network

44 Answers

Algorithms from the Book

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

What papers should everyone read?

Symbolic Execution is a case of Abstract Interpretation?

What is the theoretical basis of imperative programming?

Books on programming language semantics

What is the enlightenment I'm supposed to attain after studying finite automata?

Are innermost reductions perpetual in untyped λ-calculus?

Relationship between contracts and dependent typing

Is it possible to generate a collision free hash function from an equality function?

How important is knowing how to program for TCS?

Original Hoare Logic termination paper

What do we know about provably correct programs?

Limits on lock-free collections?

#SAT Solver download

For which algorithms is there a large gap between the theoretical analysis and reality?

Small steps for better TCS conferences?

How to Create Mission Critical Software?

Where and how did computers help prove a theorem?

How to find the cycles which, together, involve the biggest number of non-shared edges in a directed graph?

Proof assistant for writing mathematics

Practical applications of the Theory of Equality with Uninterpreted Functions (EUF)

Well known classes of boolean formulas that require exponentially long resolution proofs

Heuristics for estimating the efficiency of Reduced Ordered Binary Decision Diagrams?

Reference Request: Application of Block Designs to Software Testing

Complexity of n-queens-completion?

Graph with minimum number of edges having given sets of nodes as its paths

Unary parametricity vs. binary parametricity

Can words in regular languages be generated by automata in a unique way?

Streaming algorithms suitable for undergrad course