E-LIB Suche - Ergebnisse für: Makarychev, Konstantin

1

Triplet Reconstruction and all other Phylogenetic CSPs are ..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Chatziafratis, Vaggos ; Makarychev, Konstantin - p. 253-284 , 2023

2

Batch Optimization for DNA Synthesis:

Makarychev, Konstantin ; Racz, Miklos Z. ; Rashtchian, Cyrus.
IEEE Transactions on Information Theory. 68 (2022) 11 - p. 7454-7470 , 2022

Link: https://doi.org/10.1109/..

3

Performance of Johnson--Lindenstrauss Transform for $k$-Mea..:

Makarychev, Konstantin ; Makarychev, Yury ; Razenshteyn, Ilya
SIAM Journal on Computing. 52 (2022) 2 - p. STOC19-269-STOC19-297 , 2022

Link: https://doi.org/10.1137/..

4

Explainable k-means: don't be greedy, plant bigger trees!:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,

Makarychev, Konstantin ; Shan, Liren - p. 1629-1642 , 2022

Link: https://dl.acm.org/doi/1..

5

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theo..:

Makarychev, Konstantin ; Makarychev, Yury ; Tulsiani, Madhur.. , 2020

Link: https://dl.acm.org/doi/1..

6

Robust Algorithms with Polynomial Loss for Near-Unanimity C..:

Dalmau, Víctor ; Kozik, Marcin ; Krokhin, Andrei...
SIAM Journal on Computing. 48 (2019) 6 - p. 1763-1795 , 2019

Link: https://doi.org/10.1137/..

7

Performance of Johnson-Lindenstrauss transform for k-means ..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,

Makarychev, Konstantin ; Makarychev, Yury ; Razenshteyn, Ilya - p. 1027-1038 , 2019

Link: https://dl.acm.org/doi/1..

8

DNA assembly for nanopore data storage readout:

Lopez, Randolph ; Chen, Yuan-Jyue ; Dumas Ang, Siena...
Nature Communications. 10 (2019) 1 - p. , 2019

Link: https://doi.org/10.1038/..

9

Solving Optimization Problems with Diseconomies of Scale vi..:

Makarychev, Konstantin ; Sviridenko, Maxim
Journal of the ACM (JACM). 65 (2018) 6 - p. 1-27 , 2018

Link: https://dl.acm.org/doi/1..

10

Erratum: Random access in large-scale DNA data storage:

Organick, Lee ; Ang, Siena Dumas ; Chen, Yuan-Jyue...
Nature Biotechnology. 36 (2018) 7 - p. 660-660 , 2018

Link: https://doi.org/10.1038/..

11

Nonlinear dimension reduction via outer Bi-Lipschitz extens..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,

Mahabadi, Sepideh ; Makarychev, Konstantin ; Makarychev, Yury. - p. 1088-1101 , 2018

Link: https://dl.acm.org/doi/1..

12

Random access in large-scale DNA data storage:

Organick, Lee ; Ang, Siena Dumas ; Chen, Yuan-Jyue...
Nature Biotechnology. 36 (2018) 3 - p. 242-248 , 2018

Link: https://doi.org/10.1038/..

13

Solving Optimization Problems with Diseconomies of Scale vi..:

Makarychev, Konstantin ; Sviridenko, Maxim
Journal of the ACM. 65 (2018) 6 - p. 1-27 , 2018

Link: https://doi.org/10.1145/..

14

Maximizing Polynomials Subject to Assignment Constraints:

Makarychev, Konstantin ; Sviridenko, Maxim
ACM Transactions on Algorithms (TALG). 13 (2017) 4 - p. 1-15 , 2017

Link: https://dl.acm.org/doi/1..

15

Maximizing Polynomials Subject to Assignment Constraints:

Makarychev, Konstantin ; Sviridenko, Maxim
ACM Transactions on Algorithms. 13 (2017) 4 - p. 1-15 , 2017

Link: https://doi.org/10.1145/..