Skip to main content
Theoretical Computer Science

Nice Answer

 Nice Answer
Answer score of 10 or more. This badge can be awarded multiple times.

earned this badge 83 times.
What is the worst case of the randomized incremental delaunay triangulation algorithm?
Awarded Jun 4 at 15:55
Proof of Levenshtein distance
Awarded Apr 19, 2022 at 14:11
Problems that can be used to show polynomial-time hardness results
Awarded Dec 15, 2021 at 13:15
Can we compute $n$ from the bits of $3^n$ in $O(n)$ time?
Awarded Aug 3, 2020 at 15:02
Is there any good and free Introduction to topological graph theory
Awarded Oct 30, 2017 at 22:14
Where can I find a copy of Guy Jacobson's thesis "Succinct Static Data Structures"?
Awarded Sep 30, 2015 at 17:52
Where and how did computers help prove a theorem?
Awarded Jan 20, 2015 at 20:24
Polynomial-time algorithms with huge exponent/constant
Awarded Dec 11, 2014 at 22:52
efficient diff algorithm for trees and Levenshtein distance
Awarded Oct 15, 2014 at 8:25
Truly random number generator: Turing computable?
Awarded Jul 25, 2014 at 21:08
Provable gaps between decision tree complexity and "true" complexity
Awarded Apr 13, 2014 at 12:41
Polynomial speedups with algorithms based on semidefinite programming
Awarded Mar 1, 2014 at 23:15
Rigour leading to insight
Awarded Jan 26, 2014 at 17:44
What Lecture Notes Should Everyone Read?
Awarded Dec 23, 2013 at 20:45
Quality of a conference
Awarded Dec 2, 2013 at 14:30
Is every "nontrivial" algorithm Turing-complete?
Awarded Oct 22, 2013 at 23:37
Space complexity to compute the optimal string alignment for the Levenshtein edit distance
Awarded Oct 2, 2013 at 6:56
Select two numbers that sum to $p$, using sub-linear query time
Awarded Aug 18, 2013 at 23:53
Shortest paths perturbation
Awarded Jun 15, 2013 at 14:24
Sorting using a black box
Awarded Mar 28, 2013 at 9:10
Algorithms as fractals
Awarded Mar 28, 2013 at 2:09
P vs NP: Instructive example of when Brute Force search can be avoided
Awarded Mar 9, 2013 at 0:33
Can one return to a TCS research job after an excursion to a non-research industry job?
Awarded Mar 5, 2013 at 18:14
Is it sometimes better to not publish at all?
Awarded Feb 23, 2013 at 21:01
Multidimensional B+ tree
Awarded Feb 13, 2013 at 5:13
Applications of Game theory in computer science?
Awarded Jan 24, 2013 at 23:43
Reading Papers with Unclear Typesetting
Awarded Jan 20, 2013 at 22:24
Does Conway's PRIMEGAME generate all prime powers of 2?
Awarded Dec 15, 2012 at 18:58
Efficient and simple randomized algorithms where determinism is difficult
Awarded Nov 20, 2012 at 20:28
What is the complexity of rectangle packing when rotations are allowed?
Awarded Oct 16, 2012 at 18:41
Exact number of comparisons to compute the median
Awarded Aug 14, 2012 at 6:09
Uses of algebraic structures in theoretical computer science
Awarded Aug 10, 2012 at 12:42
Are there non-constructive algorithm existence proofs?
Awarded Jul 30, 2012 at 15:45
Learning triangles in the plane
Awarded Jun 1, 2012 at 19:02
How easy is it to switch the area of research in CS (going from M.Tech to PhD)?
Awarded May 25, 2012 at 14:15
How to find the cycles which, together, involve the biggest number of non-shared edges in a directed graph?
Awarded Apr 16, 2012 at 15:27
Notable examples of the square root idea in complexity analysis
Awarded Mar 28, 2012 at 9:50
When are two algorithms said to be "similar"?
Awarded Mar 7, 2012 at 15:45
Merging Two Binary Search Trees
Awarded Feb 29, 2012 at 9:07
How many steps does this recurrence take to get to 2 (or 1)?
Awarded Feb 19, 2012 at 22:53
About switching from a computer scientist to a mathematician
Awarded Feb 14, 2012 at 21:31
Is the concept of the Turing Machine derived from automata?
Awarded Feb 9, 2012 at 9:45
How to find a specific research topic to concentrate on?
Awarded Jan 30, 2012 at 5:34
Max-Cut Of Minor Closed Family
Awarded Jan 29, 2012 at 20:22
Polynomial-time algorithms with huge exponent/constant
Awarded Jan 24, 2012 at 18:49
Good practices for writing algorithms
Awarded Nov 12, 2011 at 13:54
Problems to reduce from to prove an $\Omega(n\log n)$ lower bound
Awarded Oct 11, 2011 at 14:40
When are more publications less?
Awarded Sep 26, 2011 at 6:18
Long-lasting errors in computer science
Awarded Aug 18, 2011 at 17:01
I dreamt of a data structure, does it exist?
Awarded Aug 7, 2011 at 3:23
The average number of annual publications for CS postdocs
Awarded Aug 2, 2011 at 4:57
Any algorithmic problem has a time complexity dominated by counting?
Awarded Jul 17, 2011 at 8:40
is "spaghetti sort" really O(n) (even as a thought experiment) ?
Awarded Jun 22, 2011 at 19:27
How to make a paper stronger?
Awarded May 30, 2011 at 23:51
How do you decide when you have enough research results to write a paper and to which journal you submit the paper
Awarded May 30, 2011 at 23:11
What is the computational complexity of "solving" chess?
Awarded May 15, 2011 at 18:37
Complexity of Topological Properties.
Awarded May 11, 2011 at 14:04
Small steps for better TCS conferences?
Awarded May 8, 2011 at 17:38
Have you ever realized you can't solve the homework you assigned?
Awarded Apr 25, 2011 at 6:29
If you could rename dynamic programming...
Awarded Mar 25, 2011 at 21:31
1
2

Others with this badge