| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
Jukka Suomela earned this badge 39 times |
nov 23 at 19:54
Ternary (and beyond) computation and quantum computing?
nov 9 at 22:28
NP-hard problems on trees
nov 8 at 18:52
How to format author information in research papers?
jun 7 '12 at 10:30
In a random perfect matching of a regular bipartite graph, are all edges equally probable?
apr 12 '12 at 16:52
List of TCS conferences and workshops
apr 6 '12 at 4:19
Randomize or Not?
feb 8 '12 at 1:58
How do you get a “Physical Intuition” for results in TCS?
jan 25 '12 at 18:51
Approximation algorithms used in exact algorithms
jan 2 '12 at 17:21
Common false beliefs in theoretical computer science
dec 18 '11 at 10:27
Open access journals
dec 8 '11 at 16:41
Infinitely large but locally finite computation problems
oct 28 '11 at 19:09
A square with entries whose adjacencies never repeat
oct 13 '11 at 11:36
What is “distributed computing” as a field of computer science?
aug 20 '11 at 18:02
Not-one 3-SAT; How hard is it?
jul 23 '11 at 17:18
Examples of the price of abstraction?
jul 13 '11 at 23:19
Justification for the Hungarian method (Kuhn-Munkres)
jul 5 '11 at 6:27
How to publish a paper?
jun 2 '11 at 22:00
How to make a paper stronger?
jun 2 '11 at 20:45
Quality of a conference
may 17 '11 at 21:48
What is the best place to get BibTeX entries for computer science articles ?
may 9 '11 at 23:49
Small steps for better TCS conferences?
may 9 '11 at 18:23
Small steps for better TCS conferences?
may 9 '11 at 6:58
Small steps for better TCS conferences?
may 9 '11 at 3:13
Small steps for better TCS conferences?
may 9 '11 at 1:28
Small steps for better TCS conferences?
mar 1 '11 at 16:25
LP relaxation of independent set
feb 22 '11 at 16:07
How to write a negative review for a conference paper?
feb 13 '11 at 0:29
What is mathematical difference between “random” and “unique”?
nov 23 '10 at 5:25
Which algorithms are used most often in practice?
nov 11 '10 at 23:14
Why have we not been able to develop a unified complexity theory of distributed computing?
nov 4 '10 at 21:48
Number of Vertex Covers and Permanent
nov 2 '10 at 8:42
Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete?
nov 1 '10 at 21:27
How to know if X and Y have coauthored?
sep 21 '10 at 8:57
Quick encoding of balanced vectors
sep 3 '10 at 15:39
Online transitive closure better than O(N^2) per edge addition
