Theoretical Computer Science
user avatar
user avatar
user avatar
Vinayak Pathak
  • Member for 11 years, 9 months
  • Last seen more than 2 years ago
Profile Activity
Stats
1,631
reputation
18k
reached
5
answers
10
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
9
silver badges
22
bronze badges
Top tags
View all tags
4
Score
2
Posts
13
Posts %
4
Score
2
Posts
13
Posts %
2
Score
5
Posts
33
Posts %
0
Score
3
Posts
20
Posts %
0
Score
2
Posts
13
Posts %
0
Score
2
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
28
Examples where insight from geometry was useful for solving something completely non-geometric
May 9, 2011
question
21
Element distinctness in O(n) time?
Nov 14, 2012
question
17
Asymptotically, how many permutations of $[1..n]$ have at most $k$ inversions?
Feb 15, 2013
question
15
Is the lower bound proof in this paper correct?
Aug 31, 2010
question
15
Drawing graphs with few "sharp" vertices?
May 1, 2012
question
13
Largest common subgraph of two maximal planar graphs
Apr 14, 2011
question
13
Given a graph, decide if its edge connectivity is at least n/2 or not
Sep 5, 2011
question
12
Problems to reduce from to prove an $\Omega(n\log n)$ lower bound
Oct 11, 2011
question
10
Places where the order of points along a simple polygon passing through them is useful
May 9, 2011
answer
9
Everyday encounters with NP-complete problems
Aug 31, 2010
Top Meta posts
0
1
5
CSTheory Blog Announcement and Signup Sheet
Top network posts
View all network posts
15
Why is exhaling more forceful than inhaling?
9
How does Yeast-two-hybrid detect interactions between several proteins in one experiment?
9
Randomized String Searching
8
What's the state of the art in designing and creating your own life forms?
7
Recursion for runtime of divide and conquer algorithms

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.