Arvind Sankar

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices	2006	Arvind Sankar Daniel A. Spielman Shang‐Hua Teng
+	Smoothed analysis of Gaussian elimination	2004	Arvind Sankar
+	Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices	2003	Arvind Sankar Daniel A. Spielman Shang‐Hua Teng
+	Multilinear Polynomials and a Conjecture of Frankl and Füredi	1999	Arvind Sankar Sundar Vishwanathan

Common Coauthors

Coauthor	Papers Together
Daniel A. Spielman	2
Shang‐Hua Teng	2
Sundar Vishwanathan	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	The Expected Norm of Random Matrices	2000	Yoav Seginer	3
+	How Accurate is Gaussian Elimination	1989	Nicholas J. Higham	3
+	Average-Case Stability of Gaussian Elimination	1990	Lloyd N. Trefethen Robert Schreiber	3
+ PDF Chat	Incorporating Condition Measures into the Complexity Theory of Linear Programming	1995	James Renegar	3
+	Eigenvalue Roulette and Random Test Matrices	1993	Alan Edelman	3
+	Complexity theory and numerical analysis	1997	Steve Smale	3
+	Probabilistic Analysis of Gaussian Elimination Without Pivoting	1997	Man-Chung Yeung Tony F. Chan	3
+ PDF Chat	Eigenvalues and Condition Numbers of Random Matrices	1988	Alan Edelman	3
+	Smoothed Analysis of Renegar’s Condition Number for Linear Programming	2002	John Dunagan Daniel A. Spielman Shang‐Hua Teng	2
+	Local Operator Theory, Random Matrices and Banach Spaces	2001	Kenneth R. Davidson Stanisław J. Szarek	2
+	Smoothed analysis of κ(A)	2003	Mario Wschebor	2
+ PDF Chat	Probability in Banach Spaces	1976	Michel Ledoux Michel Talagrand	2
+	Smoothed analysis of the perceptron algorithm for linear programming	2002	Avrim Blum John Dunagan	2
+ PDF Chat	The Probability That a Numerical Analysis Problem is Difficult	1988	James Demmel	2
+	Continuous Univariate Distributions, Volume 2	1996	Robert H. Berk	2
+	Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables	1965	J. W. W. Milton Abramowitz Irene A. Stegun	1
+ PDF Chat	Discrete Approximations to Continuous Univariate Distributions—an Alternative to Simulation	1999	Alberto Luceño	1
+	On generalizations of the deBruijn—Erdös theorem	1994	Hunter S. Snevily	1
+	Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems	1991	Noga Alon László Babai Hiroshi Suzuki	1
+	Proof of a Conjecture of Frankl and Füredi	1997	Gurumurthi V. Ramanan	1
+	FAMILIES OF FINITE SETS WITH MISSING INTERSECTIONS	1984	Péter Frankl Zoltán Füredi	1
+	On $t$-designs	1975	D. K. Ray-Chaudhuri Richard M. Wilson	1
+	A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality	1988	László Babai	1
+	Spaces with Large Distance to ℓ n ∞ and Random Matrices	1990	Stanisław J. Szarek	1
+	Probability in Banach Spaces, 9	1994	J. Hoffmann-Jørgensen James Kuelbs Michael B. Marcus	1
+ PDF Chat	Smoothed analysis of termination of linear programming algorithms	2003	Daniel A. Spielman Shang‐Hua Teng	1
+ PDF Chat	The probability that a numerical analysis problem is difficult	1988	James Demmel	1
+ PDF Chat	Geometric Algorithms and Combinatorial Optimization	1993	Martin Grötschel László Lovász Alexander Schrijver	1
+	Smoothed analysis of algorithms	2004	Daniel A. Spielman Shang‐Hua Teng	1
+	Intersection theorems with geometric consequences	1981	Péter Frankl R. Wilson	1