Članki z zahtevami za javni dostop - Konstantin MakarychevVeč o tem
Ni na voljo nikjer: 1
Minimum nonuniform graph partitioning with unrelated weights
KS Makarychev, YS Makarychev
Sbornik: Mathematics 208 (12), 1835, 2017
Zahteve: US National Science Foundation
Na voljo nekje: 21
Random access in large-scale DNA data storage
L Organick, SD Ang, YJ Chen, R Lopez, S Yekhanin, K Makarychev, ...
Nature biotechnology 36 (3), 242-248, 2018
Zahteve: US National Science Foundation
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering
K Makarychev, Y Makarychev, I Razenshteyn
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Zahteve: US National Science Foundation
DNA assembly for nanopore data storage readout
R Lopez, YJ Chen, S Dumas Ang, S Yekhanin, K Makarychev, MZ Racz, ...
Nature communications 10 (1), 2933, 2019
Zahteve: US Department of Defense
Algorithms for stable and perturbation-resilient problems
H Angelidakis, K Makarychev, Y Makarychev
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Zahteve: US National Science Foundation
Scaling up DNA data storage and random access retrieval
L Organick, SD Ang, YJ Chen, R Lopez, S Yekhanin, K Makarychev, ...
BioRxiv, 114553, 2017
Zahteve: US National Science Foundation
Nonlinear dimension reduction via outer bi-lipschitz extensions
S Mahabadi, K Makarychev, Y Makarychev, I Razenshteyn
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Zahteve: US National Science Foundation
Near-optimal algorithms for explainable k-medians and k-means
K Makarychev, L Shan
International Conference on Machine Learning, 7358-7367, 2021
Zahteve: US National Science Foundation
Improved guarantees for k-means++ and k-means++ parallel
K Makarychev, A Reddy, L Shan
Advances in Neural Information Processing Systems 33, 16142-16152, 2020
Zahteve: US National Science Foundation
Correlation clustering with asymmetric classification errors
J Jafarov, S Kalhan, K Makarychev, Y Makarychev
International Conference on Machine Learning, 4641-4650, 2020
Zahteve: US National Science Foundation
Explainable k-means: don’t be greedy, plant bigger trees!
K Makarychev, L Shan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Zahteve: US National Science Foundation
Single-pass pivot algorithm for correlation clustering. keep it simple!
K Makarychev, S Chakrabarty
Advances in Neural Information Processing Systems 36, 6412-6421, 2023
Zahteve: US National Science Foundation
Batch optimization for DNA synthesis
K Makarychev, MZ Rácz, C Rashtchian, S Yekhanin
IEEE Transactions on Information Theory 68 (11), 7454-7470, 2022
Zahteve: US National Science Foundation
Robust algorithms with polynomial loss for near-unanimity CSPs
V Dalmau, M Kozik, A Krokhin, K Makarychev, Y Makarychev, J Oprsal
SIAM Journal on Computing 48 (6), 1763-1795, 2019
Zahteve: US National Science Foundation, European Commission, Government of Spain
Bisect and conquer: Hierarchical clustering via max-uncut bisection
V Chatziafratis, G Yaroslavtsev, E Lee, K Makarychev, S Ahmadian, ...
International Conference on Artificial Intelligence and Statistics, 3121-3132, 2020
Zahteve: US National Science Foundation
Random cuts are optimal for explainable k-medians
K Makarychev, L Shan
Advances in Neural Information Processing Systems 36, 66890-66901, 2023
Zahteve: US National Science Foundation
Triplet reconstruction and all other phylogenetic csps are approximation resistant
V Chatziafratis, K Makarychev
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
Zahteve: US National Science Foundation
Certified algorithms: Worst-case analysis and beyond
K Makarychev, Y Makarychev
Innovations in Theoretical Computer Science Conference, 2020
Zahteve: US National Science Foundation
Concentration inequalities for nonlinear matroid intersection
K Makarychev, W Schudy, M Sviridenko
Random Structures & Algorithms 46 (3), 541-571, 2015
Zahteve: UK Engineering and Physical Sciences Research Council
Approximation scheme for weighted metric clustering via sherali-adams
D Avdiukhin, V Chatziafratis, K Makarychev, G Yaroslavtsev
Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 7926-7934, 2024
Zahteve: US National Science Foundation
Podatke o objavi in financiranju samodejno določi računalniški program