Skip to main content
Jagadish's user avatar
Jagadish's user avatar
Jagadish's user avatar
Jagadish
  • Member for 13 years, 10 months
  • Last seen more than a month ago
16 votes
Accepted

Solving semidefinite programs in polynomial time

4 votes

Approximation algorithms used in exact algorithms

5 votes

Reconstructing a tree from separator queries

1 vote

What CS blogs should everyone read?

8 votes

Efficient and simple randomized algorithms where determinism is difficult

3 votes

What are TCS conjectures that were proved for primes and small values but then turned out to be false?

2 votes

Funny TCS-related papers etc?

8 votes

Good examples for how to write well in TCS

59 votes

Polynomial-time algorithms with huge exponent/constant

13 votes

Does randomness buy us anything inside P?

39 votes

Polynomial-time algorithms with huge exponent/constant

15 votes

Polynomial-time algorithms with huge exponent/constant

10 votes
Accepted

Proof that sparsest cut is NP-hard

5 votes

Funny TCS-related papers etc?

4 votes

Inspirational talk for final year high school pupils

6 votes

Hardness jumps in computational complexity?

11 votes

Optimal greedy algorithms for NP-hard problems