Shiri Chechik
Shiri Chechik
Professor of Computer Science, Tel-Aviv University
Email confirmado em post.tau.ac.il - Página inicial
Título
Citado por
Citado por
Ano
Better approximation algorithms for the graph diameter
S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1052014
Fault tolerant spanners for general graphs
S Chechik, M Langberg, D Peleg, L Roditty
SIAM Journal on Computing 39 (7), 3403-3423, 2010
882010
New additive spanners
S Chechik
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
692013
Approximate distance oracles with constant query time
S Chechik
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
522014
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
I Abraham, S Chechik, S Krinninger
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
492017
Deterministic decremental single source shortest paths: beyond the o (mn) bound
A Bernstein, S Chechik
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
482016
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
I Abraham, S Chechik, C Gavoille
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
452012
Compact routing schemes with improved stretch
S Chechik
Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013
422013
Low-distortion inference of latent similarities from a multiplex social network
I Abraham, S Chechik, D Kempe, A Slivkins
SIAM Journal on Computing 44 (3), 617-668, 2015
372015
Approximate distance oracles with improved bounds
S Chechik
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
362015
Near-optimal light spanners
S Chechik, C Wulff-Nilsen
ACM Transactions on Algorithms (TALG) 14 (3), 1-15, 2018
322018
Deterministic partially dynamic single source shortest paths for sparse graphs
A Bernstein, S Chechik
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
302017
Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms
M Arar, S Chechik, S Cohen, C Stein, D Wajc
arXiv preprint arXiv:1711.06625, 2017
282017
Fault tolerant additive and (μ, α)-spanners
G Braunschvig, S Chechik, D Peleg, A Sealfon
Theoretical Computer Science 580, 94-100, 2015
262015
Fully dynamic all-pairs shortest paths: Breaking the o (n) barrier
I Abraham, S Chechik, K Talwar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
252014
Average distance queries through weighted samples in graphs and metric spaces: High scalability with tight statistical guarantees
S Chechik, E Cohen, H Kaplan
arXiv preprint arXiv:1503.08528, 2015
242015
Decremental single-source reachability and strongly connected components in O (m√ n) total update time
S Chechik, TD Hansen, GF Italiano, J Łącki, N Parotsidis
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
232016
Secluded connectivity problems
S Chechik, MP Johnson, M Parter, D Peleg
Algorithmica 79 (3), 708-741, 2017
222017
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
S Chechik, TD Hansen, GF Italiano, V Loitzenbauer, N Parotsidis
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
222017
Fully dynamic maximal independent set in expected poly-log update time
S Chechik, T Zhang
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
212019
O sistema não pode efectuar a operação agora. Tente novamente mais tarde.
Artigos 1–20