Random access in large-scale DNA data storage von Organick, Lee, Ang, Siena Dumas, Chen, Yuan-Jyue, Lopez, Randolph, Yekhanin, Sergey, Makarychev, Konstantin, Racz, Miklos Z, Kamath, Govinda, Gopalan, Parikshit, Nguyen, Bichlien, Takahashi, Christopher N, Newman, Sharon, Parker, Hsing-Yeh, Rashtchian, Cyrus, Stewart, Kendall, Gupta, Gagan, Carlson, Robert, Mulligan, John, Carmean, Douglas, Seelig, Georg, Ceze, Luis, Strauss, Karin

Volltext

DNA assembly for nanopore data storage readout von Lopez, Randolph, Chen, Yuan-Jyue, Dumas Ang, Siena, Yekhanin, Sergey, Makarychev, Konstantin, Racz, Miklos Z, Seelig, Georg, Strauss, Karin, Ceze, Luis

Volltext

A Union of Euclidean Metric Spaces is Euclidean von Konstantin Makarychev, Yury Makarychev

Volltext

THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND von BRAVERMAN, MARK, MAKARYCHEV, KONSTANTIN, MAKARYCHEV, YURY, NAOR, ASSAF

Volltext

I/O Efficient Algorithms for Serial and Parallel Suffix Tree Construction von GHOTING, Amol, MAKARYCHEV, Konstantin

Volltext

Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering von Makarychev, Konstantin, Makarychev, Yury, Razenshteyn, Ilya

Volltext

Metric extension operators, vertex sparsifiers and Lipschitz extendability von Makarychev, Konstantin, Makarychev, Yury

Volltext

Batch Optimization for DNA Synthesis von Makarychev, Konstantin, Racz, Miklos Z., Rashtchian, Cyrus, Yekhanin, Sergey

Volltext

Maximizing Polynomials Subject to Assignment Constraints von Makarychev, Konstantin, Sviridenko, Maxim

Volltext

Solving Optimization Problems with Diseconomies of Scale via Decoupling von Makarychev, Konstantin, Sviridenko, Maxim

Volltext

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs von Dalmau, Víctor, Kozik, Marcin, Krokhin, Andrei, Makarychev, Konstantin, Makarychev, Yury, Opršal, Jakub

Volltext

Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can von Jalaparti, Virajith, Bodik, Peter, Menache, Ishai, Rao, Sriram, Makarychev, Konstantin, Caesar, Matthew

Volltext

Approximation algorithms for spanner problems and Directed Steiner Forest von Berman, Piotr, Bhattacharyya, Arnab, Makarychev, Konstantin, Raskhodnikova, Sofya, Yaroslavtsev, Grigory

Volltext

Robust algorithms with polynomial loss for near-unanimity CSPs von Dalmau, Víctor, Kozik, Marcin, Krokhin, Andrei, Makarychev, Konstantin, Makarychev, Yury, Opršal, Jakub

Volltext

Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms von Buchbinder, Niv, Kimbrel, Tracy, Levi, Retsef, Makarychev, Konstantin, Sviridenko, Maxim

Volltext

Local Global Tradeoffs in Metric Embeddings von Charikar, Moses, Makarychev, Konstantin, Makarychev, Yury

Volltext

Chain Independence and Common Information von Makarychev, K., Makarychev, Y.

Volltext

Min-Max Graph Partitioning and Small Set Expansion von Bansal, Nikhil, Feige, Uriel, Krauthgamer, Robert, Makarychev, Konstantin, Nagarajan, Viswanath, Seffi, Joseph, Schwartz, Roy

Volltext

Near-optimal algorithms for maximum constraint satisfaction problems von Charikar, Moses, Makarychev, Konstantin, Makarychev, Yury

Volltext

Concentration inequalities for nonlinear matroid intersection von Makarychev, Konstantin, Schudy, Warren, Sviridenko, Maxim

Volltext