Obserwuj
Robert Krauthgamer
Robert Krauthgamer
Zweryfikowany adres z weizmann.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Bounded geometries, fractals, and low-distortion embeddings
A Gupta, R Krauthgamer, JR Lee
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
5042003
Navigating nets: Simple algorithms for proximity search
R Krauthgamer, JR Lee
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
4332004
Polylogarithmic inapproximability
E Halperin, R Krauthgamer
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2722003
On the hardness of approximating multicut and sparsest-cut
S Chawla, R Krauthgamer, R Kumar, Y Rabani, D Sivakumar
computational complexity 15, 94-114, 2006
2572006
Finding and certifying a large hidden clique in a semirandom graph
U Feige, R Krauthgamer
Random Structures & Algorithms 16 (2), 195-208, 2000
2472000
A polylogarithmic approximation of the minimum bisection
U Feige, R Krauthgamer
SIAM Journal on Computing 31 (4), 1090-1118, 2002
2192002
Measured descent: A new embedding method for finite metrics
R Krauthgamer, JR Lee, M Mendel, A Naor
45th Annual IEEE Symposium on Foundations of Computer Science, 434-443, 2004
1872004
Approximating edit distance efficiently
Z Bar-Yossef, TS Jayram, R Krauthgamer, R Kumar
45th Annual IEEE Symposium on Foundations of Computer Science, 550-559, 2004
1752004
How hard is it to approximate the best Nash equilibrium?
E Hazan, R Krauthgamer
SIAM Journal on Computing 40 (1), 79-91, 2011
1412011
Polylogarithmic approximation for edit distance and the asymmetric query complexity
A Andoni, R Krauthgamer, K Onak
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 377-386, 2010
1412010
Partitioning graphs into balanced components
R Krauthgamer, J Naor, R Schwartz
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1412009
Earth mover distance over high-dimensional spaces.
A Andoni, P Indyk, R Krauthgamer
SODA 8, 343-352, 2008
1382008
Hardness of approximation for vertex-connectivity network design problems
G Kortsarz, R Krauthgamer, JR Lee
SIAM Journal on Computing 33 (3), 704-720, 2004
1312004
Algorithms on negatively curved spaces
R Krauthgamer, JR Lee
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
1262006
Anti-third party CD8+ CTLs as potent veto cells: coexpression of CD8 and FasL is a prerequisite
S Reich-Zeliger, Y Zhao, R Krauthgamer, E Bachar-Lustig, Y Reisner
Immunity 13 (4), 507-515, 2000
1232000
Streaming algorithms via precision sampling
A Andoni, R Krauthgamer, K Onak
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 363-372, 2011
1142011
Fault-tolerant spanners: better and simpler
M Dinitz, R Krauthgamer
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
1142011
Dynamic resource allocation using projected future benefits
TJ Kimbrel, R Krauthgamer, M Minkoff, BM Schieber, MI Sviridenko, ...
US Patent 7,308,415, 2007
1122007
Sketching cuts in graphs and hypergraphs
D Kogan, R Krauthgamer
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
1082015
Improved Lower Bounds for Embeddings into
R Krauthgamer, Y Rabani
SIAM Journal on Computing 38 (6), 2487-2498, 2009
1062009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20