Skip header Section
Skip Bibliometrics Section
Asymptotic theory of finite dimensional normed spacesJune 1986
- Authors:
- Vitali D Milman,
- Gideon Schechtman
Abstract
No abstract available.
Cited By
- Esfandiari H, Karbasi A, Mirrokni V, Velegkas G and Zhou F Replicable clustering Proceedings of the 37th International Conference on Neural Information Processing Systems, (39277-39320)
- Bartošová D, Lopez-Abad J, Lupini M and Mbombo B (2022). The Ramsey Properties for Grassmannians Over ℝ, ℂ, Combinatorica, 42:1, (9-69), Online publication date: 1-Feb-2022.
- Mahloujifar S, Zhang X, Mahmoody M and Evans D Empirically measuring concentration Proceedings of the 33rd International Conference on Neural Information Processing Systems, (5209-5220)
- Paouris G, Phillipson K and Rojas J A Faster Solution to Smale's 17th Problem I Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation, (323-330)
- Huang H (2018). John Ellipsoid and the Center of Mass of a Convex Body, Discrete & Computational Geometry, 60:4, (809-830), Online publication date: 1-Dec-2018.
- Devore R, Petrova G and Wojtaszczyk P (2017). Data assimilation and sampling in Banach spaces, Calcolo: a quarterly on numerical analysis and theory of computation, 54:3, (963-1007), Online publication date: 1-Sep-2017.
- Kumari S and Jayaram B (2017). Measuring Concentration of Distances—An Effective and Efficient Empirical Index, IEEE Transactions on Knowledge and Data Engineering, 29:2, (373-386), Online publication date: 1-Feb-2017.
- Even-Zohar C, Hass J, Linial N and Nowik T (2016). Invariants of Random Knots and Links, Discrete & Computational Geometry, 56:2, (274-314), Online publication date: 1-Sep-2016.
- Zongming Ma and Yihong Wu (2015). Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms, IEEE Transactions on Information Theory, 61:12, (6939-6956), Online publication date: 1-Dec-2015.
- Mosonyi M (2015). Coding Theorems for Compound Problems via Quantum Rényi Divergences, IEEE Transactions on Information Theory, 61:6, (2997-3012), Online publication date: 1-Jun-2015.
- Fawzi O, Hayden P and Sen P (2013). From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking, Journal of the ACM, 60:6, (1-61), Online publication date: 1-Nov-2013.
- Paouris G and Pivovarov P (2013). Small-Ball Probabilities for the Volume of Random Convex Sets, Discrete & Computational Geometry, 49:3, (601-646), Online publication date: 1-Apr-2013.
- Bjelaković I, Boche H, Janßen G and Nötzel J Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities Information Theory, Combinatorics, and Search Theory, (247-283)
- Pestov V Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions Proceedings of the Fourth International Conference on SImilarity Search and APplications, (25-32)
- Fawzi O, Hayden P and Sen P From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking Proceedings of the forty-third annual ACM symposium on Theory of computing, (773-782)
- Regev O and Klartag B Quantum one-way communication can be exponentially stronger than classical communication Proceedings of the forty-third annual ACM symposium on Theory of computing, (31-40)
- Baxter B (2011). On kernel engineering via Paley---Wiener, Calcolo: a quarterly on numerical analysis and theory of computation, 48:1, (21-31), Online publication date: 1-Mar-2011.
- Pestov V Indexability, concentration, and VC theory Proceedings of the Third International Conference on SImilarity Search and APplications, (3-12)
- Indyk P and Szarek S Almost-Euclidean subspaces of l1Nvia tensor products Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, (632-641)
- Chlamtac E, Krauthgamer R and Raghavendra P Approximating sparsest cut in graphs of bounded treewidth Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, (124-137)
- Mendel M and Naor A Towards a calculus for non-linear spectral gaps Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (236-255)
- Lee J and Sidiropoulos A Genus and the geometry of the cut graph Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (193-201)
- Volnyansky I and Pestov V Curse of Dimensionality in Pivot Based Indexes Proceedings of the 2009 Second International Workshop on Similarity Search and Applications, (39-46)
- Kilian J, Madeira A, Strauss M and Zheng X Fast private norm estimation and heavy hitters Proceedings of the 5th conference on Theory of cryptography, (176-193)
- Brinkman B, Karagiozova A and Lee J Vertex cuts, random walks, and dimension reduction in series-parallel graphs Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (621-630)
- Lee J Volume distortion for subsets of Euclidean spaces Proceedings of the twenty-second annual symposium on Computational geometry, (207-216)
- Indyk P and Woodruff D Polylogarithmic private approximations and efficient matching Proceedings of the Third conference on Theory of Cryptography, (245-264)
- Arora S, Lovász L, Newman I, Rabani Y, Rabinovich Y and Vempala S Local versus global properties of metric spaces Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (41-50)
- Bhargava A and Kosaraju S Derandomization of dimensionality reduction and SDP based algorithms Proceedings of the 9th international conference on Algorithms and Data Structures, (396-408)
- Mendelson S On the limitations of embedding methods Proceedings of the 18th annual conference on Learning Theory, (353-365)
- Arora S, Lee J and Naor A Euclidean distortion and the sparsest cut Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (553-562)
- Mendelson S and Philips P (2004). On the Importance of Small Coordinate Projections, The Journal of Machine Learning Research, 5, (219-238), Online publication date: 1-Dec-2004.
- Rabinovich Y On average distortion of embedding metrics into the line and into L1 Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (456-462)
- Krauthgamer R and Sasson O Property testing of data dimensionality Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (18-27)
- Newman I and Rabinovich Y A lower bound on the distortion of embedding planar metrics into Euclidean space Proceedings of the eighteenth annual symposium on Computational geometry, (94-96)
- Raz R Exponential separation of quantum and classical communication complexity Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (358-367)
- Dyer M, Frieze A and Kannan R (1991). A random polynomial-time algorithm for approximating the volume of convex bodies, Journal of the ACM, 38:1, (1-17), Online publication date: 3-Jan-1991.
- Friedman J, Kahn J and Szemerédi E On the second eigenvalue of random regular graphs Proceedings of the twenty-first annual ACM symposium on Theory of computing, (587-598)
- Dyer M and Frieze A A random polynomial time algorithm for approximating the volume of convex bodies Proceedings of the twenty-first annual ACM symposium on Theory of computing, (375-381)
Index Terms
- Asymptotic theory of finite dimensional normed spaces
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Finite linear spaces admitting a two-dimensional projective linear group
This article is a contribution to the study of linear spaces admitting a line-transitive automorphism group. We classify such linear spaces where PSL(2, q), q > 3 acts line transitively. We prove that the only cases which arise are projective planes, a ...
Allometry constants of finite-dimensional spaces: theory and computations
We describe the computations of some intrinsic constants associated to an n-dimensional normed space $${\mathcal{V}}$$, namely the N-th “allometry” constants $$\kappa_\infty^N(\mathcal{V}) := \inf \{\|T\| \cdot \|T'\|, \quad T\,:\,\ell_\infty^N \to \...
Stability of additive mappings in non-Archimedean fuzzy normed spaces
In this paper we introduce a notion of a non-Archimedean fuzzy norm and study the stability of the Cauchy equation in the context of non-Archimedean fuzzy spaces in the spirit of Hyers-Ulam-Rassias-Gavruta. As a corollary, the stability of the Jensen ...