rgrig

Oxford, United Kingdom

http://rgrig.appspot.com/

program verification, mostly

top accounts reputation activity subscriptions

Is the Jaccard distance a distance?

inequalities mg.metric-geometry co.combinatorics asked Mar 13, 2010 at 18:37

mathoverflow.net

59 votes

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

ds.algorithms big-list ds.data-structures asked Aug 19, 2010 at 10:15

cstheory.stackexchange.com

43 votes

Do you get DFS if you change the queue to a stack in a BFS implementation?

algorithms graphs asked Mar 13, 2012 at 18:03

cs.stackexchange.com

23 votes

What bounds can be put on counting reachable nodes in a dag?

ds.algorithms graph-theory asked Aug 25, 2010 at 8:34

cstheory.stackexchange.com

19 votes

What algorithms are known for computing Craig interpolants?

reference-request lo.logic proof-complexity feasible-interpolation asked Aug 27, 2010 at 19:47

cstheory.stackexchange.com

15 votes

Is it NP-hard to find (the root of) a small decision tree for a monotone boolean function?

graph-theory boolean-functions asked Jun 8, 2016 at 22:16

cstheory.stackexchange.com

14 votes

How hard is it to reduce termination to partial correctness?

cc.complexity-theory lo.logic program-verification program-logic asked Aug 18, 2010 at 15:10

cstheory.stackexchange.com

13 votes

How many bins do random numbers fill?

combinatorics probability discrete-mathematics asked Sep 30, 2010 at 18:37

math.stackexchange.com

12 votes

Do people look at loop nestness in boolean circuits?

cc.complexity-theory reference-request circuit-complexity machine-models ar.hardware-architecture asked Sep 13, 2010 at 12:09

cstheory.stackexchange.com

7 votes

Is it known whether hypergraph minimal covers are P-enumerable?

cc.complexity-theory reference-request lower-bounds asked Jun 29, 2013 at 20:35

cstheory.stackexchange.com

Top Answers

Algorithms from the Book

cstheory.stackexchange.com

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

cstheory.stackexchange.com

Graph searching: Breadth-first vs. depth-first

cs.stackexchange.com

What papers should everyone read?

cstheory.stackexchange.com

Why do so many textbooks have so much technical detail and so little enlightenment?

mathoverflow.net

Symbolic Execution is a case of Abstract Interpretation?

cstheory.stackexchange.com

What is convolution intuitively?

mathoverflow.net

What is the theoretical basis of imperative programming?

cstheory.stackexchange.com

Books on programming language semantics

cstheory.stackexchange.com

Learning Lambda Calculus

math.stackexchange.com

What is your favorite estimation exercise?

math.stackexchange.com

ML function of type 'a -> 'b

cs.stackexchange.com

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

cstheory.stackexchange.com

Explanation of method for showing that $\frac{0}{0}$ is undefined

math.stackexchange.com

How can I understand and prove the "sum and difference formulas" in trigonometry?

math.stackexchange.com

Original Hoare Logic termination paper

cstheory.stackexchange.com

Are innermost reductions perpetual in untyped λ-calculus?

cstheory.stackexchange.com

How important is knowing how to program for TCS?

cstheory.stackexchange.com

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

cstheory.stackexchange.com

Relationship between contracts and dependent typing

cstheory.stackexchange.com

What do we know about provably correct programs?

cstheory.stackexchange.com

What is the correct way to do delimiters?

tex.stackexchange.com

#SAT Solver download

cstheory.stackexchange.com

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

cstheory.stackexchange.com

How to Create Mission Critical Software?

cstheory.stackexchange.com

Limits on lock-free collections?

cstheory.stackexchange.com

Small steps for better TCS conferences?

cstheory.stackexchange.com

How Does My Radio Work?

mathoverflow.net

Where and how did computers help prove a theorem?

cstheory.stackexchange.com

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

cstheory.stackexchange.com