Theoretical Computer Science
Rachit's user avatar
Rachit's user avatar
Rachit's user avatar
Rachit
  • Member for 12 years, 5 months
  • Last seen more than 10 years ago
Profile Activity
Stats
838
reputation
10k
reached
4
answers
5
questions
Communities
About

Graduate student at UIUC

Badges
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
17
bronze badges
Top tags
View all tags
17
Score
5
Posts
56
Posts %
16
Score
6
Posts
67
Posts %
11
Score
2
Posts
22
Posts %
10
Score
6
Posts
67
Posts %
9
Score
1
Posts
11
Posts %
1
Score
1
Posts
11
Posts %
Top posts
question
16
When are two algorithms said to be "similar"?
Mar 6, 2012
question
14
Space-approximation Trade-off
Mar 1, 2013
answer
11
Approximation algorithms for problems in P
Mar 28, 2012
answer
9
Data structure for shortest paths
Dec 22, 2011
question
8
Reducing the maximum degree in a graph
Dec 11, 2012
question
7
Sparse graphs versus dense graphs
Mar 17, 2012
answer
6
Computing distances with approximation less than 2 in general graphs?
Nov 11, 2011
question
5
Bounds on sum of squares of node degrees in undirected graphs
May 4, 2012
answer
1
Average-degree Bounded Graphs are no harder than Maximum-degree Bounded Graphs (for distance oracles with purely multiplicative stretch)
Nov 25, 2012