Konstantin Makarychev
Titolo
Citata da
Citata da
Anno
O (√ log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
A Agarwal, M Charikar, K Makarychev, Y Makarychev
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1842005
Near-optimal algorithms for unique games
M Charikar, K Makarychev, Y Makarychev
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
1452006
Network-aware scheduling for data-parallel jobs: Plan when you can
V Jalaparti, P Bodik, I Menache, S Rao, K Makarychev, M Caesar
ACM SIGCOMM Computer Communication Review 45 (4), 407-420, 2015
1442015
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, 2018
1242018
A new class of non-Shannon-type inequalities for entropies
K Makarychev, Y Makarychev, A Romashchenko, N Vereshchagin
Communications in Information and Systems 2 (2), 147-166, 2002
1222002
Integrality gaps for Sherali-Adams relaxations
M Charikar, K Makarychev, Y Makarychev
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1202009
Quadratic forms on graphs
N Alon, K Makarychev, Y Makarychev, A Naor
Inventiones mathematicae 163 (3), 499-522, 2006
842006
Near-optimal algorithms for maximum constraint satisfaction problems
M Charikar, K Makarychev, Y Makarychev
ACM Transactions on Algorithms (TALG) 5 (3), 32, 2009
822009
Min-max graph partitioning and small set expansion
N Bansal, U Feige, R Krauthgamer, K Makarychev, V Nagarajan, J Seffi, ...
SIAM Journal on Computing 43 (2), 872-904, 2014
762014
The Grothendieck constant is strictly smaller than Krivine’s bound
M Braverman, K Makarychev, Y Makarychev, A Naor
Forum of Mathematics, Pi 1, 2013
732013
How to play unique games using embeddings
E Chlamtac, K Makarychev, Y Makarychev
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
662006
Improved approximation for the directed spanner problem
P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ...
Automata, Languages and Programming, 1-12, 2011
56*2011
Approximation algorithms for semi-random partitioning problems
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
512012
Online make-to-order joint replenishment model: primal dual competitive algorithms
N Buchbinder, T Kimbrel, R Levi, K Makarychev, M Sviridenko
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
50*2008
Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs
S Chawla, K Makarychev, T Schramm, G Yaroslavtsev
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of …, 2015
452015
Bilu–Linial stable instances of max cut and minimum multiway cut
K Makarychev, Y Makarychev, A Vijayaraghavan
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
452014
Metric extension operators, vertex sparsifiers and Lipschitz extendability
K Makarychev, Y Makarychev
Israel Journal of Mathematics 212 (2), 913-959, 2016
43*2016
Quadratic forms on graphs
N Alon, K Makarychev, Y Makarychev, A Naor
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
382005
SERIAL AND PARALLEL METHODS FOR I/O EFFICIENT SUFFIX TREE CONSTRUCTION
AN Ghoting, K Makarychev
US Patent App. 12/697,159, 2010
362010
Serial and parallel methods for i/o efficient suffix tree construction
A Ghoting, K Makarychev
Proceedings of the 2009 ACM SIGMOD International Conference on Management of …, 2009
362009
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20