From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

When Crossings Count - Approximating the Minimum Spanning Tree, и . CoRR, (2003)Nearest Neighbors In High-Dimensional Spaces. Handbook of Discrete and Computational Geometry, CRC Press LLC, Boca Raton, FL, 2nd издание, (апреля 2004)Declaring independence via the sketching of sketches., и . SODA, стр. 737-745. SIAM, (2008)Which Regular Expression Patterns are Hard to Match?, и . CoRR, (2015)Inerpolation of Symmetric Functions and a New Type of Combinatorial Design.. STOC, стр. 736-740. ACM, (1999)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)., и . STOC, стр. 51-58. ACM, (2015)Learning-Based Low-Rank Approximations., , и . NeurIPS, стр. 7400-7410. (2019)Generalization Bounds for Data-Driven Numerical Linear Algebra., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 2013-2040. PMLR, (2022)Approximate Nearest Neighbor under edit distance via product metrics.. SODA, стр. 646-650. SIAM, (2004)Polylogarithmic Private Approximations and Efficient Matching., и . TCC, том 3876 из Lecture Notes in Computer Science, стр. 245-264. Springer, (2006)