Samorodnitsky, Alex One more proof of the first linear programming bound for binary codes and two conjectures. (English) Zbl 07748854 Isr. J. Math. 256, No. 2, 639-673 (2023). MSC: 94B05 90C05 PDFBibTeX XMLCite \textit{A. Samorodnitsky}, Isr. J. Math. 256, No. 2, 639--673 (2023; Zbl 07748854) Full Text: DOI arXiv
Navon, Michael; Samorodnitsky, Alex Linear programming bounds for codes via a covering argument. (English) Zbl 1173.90475 Discrete Comput. Geom. 41, No. 2, 199-207 (2009). MSC: 94B65 90C05 65T50 PDFBibTeX XMLCite \textit{M. Navon} and \textit{A. Samorodnitsky}, Discrete Comput. Geom. 41, No. 2, 199--207 (2009; Zbl 1173.90475) Full Text: DOI arXiv
Saks, Michael; Samorodnitsky, Alex; Zosin, Leonid A lower bound on the integrality gap for minimum multicut in directed networks. (English) Zbl 1058.05033 Combinatorica 24, No. 3, 525-530 (2004). MSC: 05C20 90B10 90C35 PDFBibTeX XMLCite \textit{M. Saks} et al., Combinatorica 24, No. 3, 525--530 (2004; Zbl 1058.05033) Full Text: DOI
Samorodnitsky, Alex On linear programming bounds for spherical codes and designs. (English) Zbl 1058.94025 Discrete Comput. Geom. 31, No. 3, 385-394 (2004). Reviewer: Demetre Voukalis (Athens) MSC: 94B65 94B05 90C05 51E22 05B30 PDFBibTeX XMLCite \textit{A. Samorodnitsky}, Discrete Comput. Geom. 31, No. 3, 385--394 (2004; Zbl 1058.94025) Full Text: DOI arXiv
Samorodnitsky, Alex On the optimum of Delsarte’s linear program. (English) Zbl 0991.94060 J. Comb. Theory, Ser. A 96, No. 2, 261-287 (2001). Reviewer: Patric Östergård (Helsinki) MSC: 94B65 90C05 51E22 PDFBibTeX XMLCite \textit{A. Samorodnitsky}, J. Comb. Theory, Ser. A 96, No. 2, 261--287 (2001; Zbl 0991.94060) Full Text: DOI
Gurvits, Leonid; Samorodnitsky, Alex A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume. (English) Zbl 1296.68068 Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC 2000), Portland, Oregon, USA, May 21–23, 2000. New York, NY: ACM Press (ISBN 1-58113-184-4). 48-57 (2000). MSC: 68Q17 68Q25 68W25 90C60 PDFBibTeX XMLCite \textit{L. Gurvits} and \textit{A. Samorodnitsky}, in: Proceedings of the thirty-second annual ACM symposium on theory of computing, STOC 2000. Portland, Oregon, USA, May 21--23, 2000. New York, NY: ACM Press. 48--57 (2000; Zbl 1296.68068) Full Text: DOI
Linial, Nathan; Samorodnitsky, Alex; Wigderson, Avi A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. (English) Zbl 0973.15004 Combinatorica 20, No. 4, 545-568 (2000). MSC: 15A15 15A12 90C27 PDFBibTeX XMLCite \textit{N. Linial} et al., Combinatorica 20, No. 4, 545--568 (2000; Zbl 0973.15004) Full Text: DOI