User Jeffε - Theoretical Computer Science Stack Exchange

Jeffε

Member for 13 years, 8 months
Last seen more than 1 year ago

jeffe.cs.illinois.edu
Urbana, IL

141 Answers

Score Activity Newest

131 votes

What papers should everyone read?

answered Sep 12, 2010 at 23:18

116 votes

Algorithms from the Book

answered Aug 17, 2010 at 20:49

71 votes

Major unsolved problems in theoretical computer science?

answered Aug 24, 2010 at 6:13

67 votes

Major unsolved problems in theoretical computer science?

answered Aug 17, 2010 at 20:51

66 votes

Common false beliefs in theoretical computer science

answered Dec 8, 2010 at 18:18

64 votes

Accepted

Why is CNF used for SAT and not DNF?

answered Sep 17, 2010 at 16:01

61 votes

How do I referee a paper?

answered Oct 3, 2010 at 21:22

58 votes

Polynomial-time algorithms with huge exponent/constant

answered May 27, 2011 at 3:03

55 votes

Accepted

If you could rename dynamic programming...

answered Mar 25, 2011 at 3:43

49 votes

Major unsolved problems in theoretical computer science?

answered Aug 17, 2010 at 20:28

46 votes

Problems Between P and NPC

answered Dec 29, 2010 at 6:22

45 votes

Accepted

What are the reasons that researchers in computational geometry prefer the BSS/real-RAM model?

answered Oct 12, 2010 at 5:56

43 votes

How to get a job

answered Oct 17, 2010 at 22:22

41 votes

What is the oldest open problem in TCS?

answered Oct 4, 2010 at 5:59

41 votes

Accepted

Efficient and simple randomized algorithms where determinism is difficult

answered Nov 20, 2012 at 16:10

34 votes

Small steps for better TCS conferences?

answered May 8, 2011 at 6:19

31 votes

Accepted

The quad-edge data structure (Delaunay/Voronoi)

answered Feb 6, 2011 at 5:23

31 votes

Accepted

I dreamt of a data structure, does it exist?

answered Aug 6, 2011 at 18:41

29 votes

Accepted

Long-lasting errors in computer science

answered Aug 18, 2011 at 13:39

28 votes

Accepted

Have you ever realized you can't solve the homework you assigned?

answered Apr 24, 2011 at 7:06

28 votes

Are there non-constructive algorithm existence proofs?

answered Jul 29, 2012 at 16:36

28 votes

Accepted

Is the concept of the Turing Machine derived from automata?

answered Feb 8, 2012 at 14:17

28 votes

Accepted

What is the computational complexity of "solving" chess?

answered May 14, 2011 at 22:57

28 votes

Is it sometimes better to not publish at all?

answered Feb 23, 2013 at 17:39

27 votes

Complexity of Topological Properties.

answered May 11, 2011 at 6:33

27 votes

Examples of "Unrelated" Mathematics Playing a Fundamental Role in TCS?

answered Oct 5, 2010 at 2:54

26 votes

Accepted

Does Conway's PRIMEGAME generate all prime powers of 2?

answered Dec 14, 2012 at 17:51

25 votes

Accepted

Merging Two Binary Search Trees

answered Feb 27, 2012 at 5:37

25 votes

is "spaghetti sort" really O(n) (even as a thought experiment) ?

answered Jun 20, 2011 at 5:45

25 votes

Accepted

Good practices for writing algorithms

answered Nov 10, 2011 at 14:04

1