Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
On permutations with limited independence
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Some structural properties of low-rank matrices related to computational complexity
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Lectures on Discrete Geometry
On restricted min-wise independence of permutations
Random Structures & Algorithms
Measures of Pseudorandomness for Finite Sequences: Minimal Values
Combinatorics, Probability and Computing
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On (ε,k)-min-wise independent permutations
Random Structures & Algorithms
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Small Sample Spaces Cannot Fool Low Degree Polynomials
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Proceedings of the forty-third annual ACM symposium on Theory of computing
Dimensionality reduction: beyond the Johnson-Lindenstrauss bound
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Sparsity lower bounds for dimensionality reducing maps
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The approximate rank of a matrix and its algorithmic applications: approximate rank
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We describe a lower bound for the rank of any real matrix in which all diagonal entries are significantly larger in absolute value than all other entries, and discuss several applications of this result to the study of problems in Geometry, Coding Theory, Extremal Finite Set Theory and Probability. This is partly a survey, containing a unified approach for proving various known results, but it contains several new results as well.