MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Suresh Venkat

2,697
Reputation
1372 views
Is this your account?

Registered User 

Name Suresh Venkat
Member for 3 years
Seen May 30 at 16:38
Website
Location Salt Lake City
Age 42
CS prof. Interested in algorithms and computational geometry. Also non-Euclidean geometry and spaces of distributions
15

Questions
votes newest views recent
8

 
13
votes
3
answers
806
views

Analogy of Parseval identity for Legendre Transform ?

feb 3 11 at 11:32 Willie Wong 7,226●20●43

2
9
votes
3
answers
440
views

Making an l_2 distance out of l_1 distance

oct 25 09 at 10:38 Darsh Ranjan 3,557●21●35

2
7
votes
0
answers
191
views

Higher-order dimension in posets: a reference request

oct 11 10 at 22:38 Suresh Venkat 2,697●8●17

1
7
votes
3
answers
321
views

Classes of graphs for which isospectrum implies isomorphism ?

dec 13 10 at 17:42 Ian Agol 24.3k●1●34●86

1

2

 
4
votes
2
answers
711
views

Planar layouts of bipartite graphs

nov 7 10 at 22:47 David Eppstein 9,423●1●21●43

 
4
votes
1
answer
200
views

The “girthwidth” of a graph

dec 6 10 at 7:43 Aaron Meyerowitz 11.8k●1●10●31

2

1 2 next

 

73

Answers
votes newest views recent
20
Is the Jaccard distance a distance?
12
Example of a good Zero Knowledge Proof.
11
Colloquial catchy statements encoding serious mathematics
10
How can I embed an N-points metric space to a hypercube with low distortion?
9
EXPTime algorithms
7
Algorithm for embedding a graph with metric constraints
7
Why relativization can’t solve NP !=P?
6
Are all probabilities conditional probabilities?
6
Count of binary matrices that avoids a certain sub-matrix
6
Is there a standard measure for how close a matrix is to being a distance metric ?
6
Is the solution bounded Diophantine problem NP-complete?
6
What is the easiest randomized algorithm to motivate to the layperson?
5
Algorithm for k-medians in a convex polygon
5
An optimization problem, non complete bipartite graph and hungarian algorithm
5
Lower Bounds in Theoretical Computer Science
5
Approximating a set with fixed number of elements
5
Defining “average rank” when not every ranking covers the whole set
4
Local-Global approach to graph theory
4
Is there a central limit theorem for bounded non identically distributed random variables ?
4
What are the most important results (and papers) in complexity theory that every one should know?
3
finding numbers at k hamming distance
3
Suggest effective heuristic (not precise) graph colouring algorithm
3
Sparse approximate representation of a collection of vectors
3
Finding the union of N random circles arbitrarily (or conspiratorially) placed on a two-dimensional surface
2
How do researchers carry out computational experiments in Graph Theory?
2
Is this problem solvable in polynomial time?
2
Find the subset of a line on a sphere “far” from a set of points on the sphere.
2
Interesting applications of max-flow and linear programming
2
Theorems for nothing (and the proofs for free)
2
Paritioning a set of numbers A into two sets B,C so that abs(prod(B) - prod(C)) is minimal
1 2 3 next

 

380

Votes
375
5

 

60

Tags
× 18
× 18
× 15
× 14
× 13
× 11
× 10
× 7
× 7
× 5
 × 5
× 4
× 4
× 4
× 4
× 4
× 4
× 3
× 3
× 2
 × 2
× 2
× 2
× 2
× 2
× 2
× 2
× 2
× 2
× 2
 × 2









 

25

Badges
● Yearling× 3
● Nice Answer× 4
● Taxonomist
● Notable Question
 ● Civic Duty
● Nice Question× 2
● Popular Question
● Enthusiast
 ● Editor
● Enlightened
● Citizen Patrol
● Organizer
 ● Autobiographer
● Critic
● Commentator
● Teacher
 ● Scholar
● Supporter
● Student