Stack Exchange

Max

top accounts reputation activity favorites subscriptions
203
188 votes
84 answers

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list Apr 18 '12 at 3:59 Sai Venkat
cstheory.stackexchange.com

48
88 votes
9 answers

How hard is unshuffling a string?

ds.algorithms open-problem Mar 29 at 6:19 Aryabhata
cstheory.stackexchange.com

16
56 votes
34 answers

Small steps for better TCS conferences?

soft-question big-list research-practice conferences Apr 15 '12 at 19:35 Radu GRIGore
cstheory.stackexchange.com

18
55 votes
12 answers

How important is knowing how to program for TCS?

soft-question big-list advice-request career Apr 22 at 17:16 lgidwani
cstheory.stackexchange.com

6
23 votes
2 answers

Advice for attending my first TCS conference

soft-question big-list conferences Nov 25 '11 at 16:12 Dave Clarke
cstheory.stackexchange.com

4
21 votes
2 answers

Natural CLIQUE to k-Color reduction

cc.complexity-theory graph-theory np-hardness reductions Nov 21 '12 at 21:17 David Eppstein
cstheory.stackexchange.com

12
17 votes
4 answers

What would a very simple quantum program look like?

quantum-computing Dec 15 '11 at 23:46 Darius Jahandarie
cstheory.stackexchange.com

3
14 votes
1 answer

What is the most general structure on which matrix product verification can be done in $O(n^2)$ time?

ds.algorithms linear-algebra matrix-product Apr 8 '11 at 4:01 Suresh Venkat
cstheory.stackexchange.com

2
13 votes
1 answer

Appropriate to thank examiners?

etiquette ethics Nov 27 '12 at 16:14 Community
academia.stackexchange.com

3
11 votes
1 answer

What is the complexity of (possibly succinct) Nurikabe?

cc.complexity-theory np-hardness puzzles Apr 1 '11 at 23:23 András Salamon
cstheory.stackexchange.com

1
7 votes
1 answer

Is predicting (in the limit) computable sequences as hard as the halting problem?

computability Nov 12 '10 at 5:53 Bob Unwin
cstheory.stackexchange.com

2
7 votes
0 answers

Is CFL strictly contained in NL?

cc.complexity-theory fl.formal-languages space-bounded grammars Dec 27 '12 at 5:34 Kaveh
cstheory.stackexchange.com

1
7 votes
1 answer

Regular expressions of families of regular expressions

fl.formal-languages regular-language regular-expressions Oct 8 '12 at 4:58 Community
cstheory.stackexchange.com

2
6 votes
0 answers

Fair and “robust” fallback permutations

ds.algorithms co.combinatorics dc.distributed-comp Oct 13 '11 at 0:06 Jukka Suomela
cstheory.stackexchange.com

1
6 votes
2 answers

Rearranging strings to minimise storage in a trie

ds.algorithms ds.data-structures Jan 2 '12 at 10:20 Anthony Labarre
cstheory.stackexchange.com

1
2 votes
1 answer

Why is the D0L word a least fixed point?

sequences-and-series formal-languages fixed-point-theorems Oct 5 '12 at 12:27 Brian M. Scott
math.stackexchange.com

2
0 votes
0 answers

Classification of Saturated LL(1) Grammars

fl.formal-languages grammars Nov 20 '11 at 19:46 slkpg
cstheory.stackexchange.com