Prati
Shiri Chechik
Shiri Chechik
Professor of Computer Science, Tel-Aviv University
Potvrđena adresa e-pošte na post.tau.ac.il - Početna stranica
Naslov
Citirano
Citirano
Godina
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
1182014
Fault-tolerant spanners for general graphs
S Chechik, M Langberg, D Peleg, L Roditty
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1052009
New additive spanners
S Chechik
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
812013
Approximate distance oracles with constant query time
S Chechik
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
602014
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
572016
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
552017
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
522012
Approximate distance oracles with improved bounds
S Chechik
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
462015
Compact routing schemes with improved stretch
S Chechik
Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013
442013
Near-optimal light spanners
S Chechik, C Wulff-Nilsen
ACM Transactions on Algorithms (TALG) 14 (3), 1-15, 2018
392018
Identifying subgraphs in transformed social network graphs
I Abraham, JK Bradley, S Chechik, M Goldszmidt, A Slivkins, D Kempe
US Patent 9,439,053, 2016
382016
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
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
362017
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
362017
Fault tolerant additive and (μ, α)-spanners
G Braunschvig, S Chechik, D Peleg, A Sealfon
Theoretical Computer Science 580, 94-100, 2015
312015
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
302014
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
282019
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
282015
Near-optimal approximate decremental all pairs shortest paths
S Chechik
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
262018
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
262016
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20