Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Chechik, Shiri
86  Ergebnisse:
Personensuche X
?
1

Approximate Distance Sensitivity Oracles in Subquadratic Sp..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bilò, Davide ; Chechik, Shiri ; Choudhary, Keerti... - p. 1396-1409 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Constant Approximation of Min-Distances in Near-Linear Time:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Chechik, Shiri ; Zhang, Tianyi - p. 896-906 , 2022
Link: https://doi.org/10.1109/..
 
?
3

Constant-Round Near-Optimal Spanners in Congested Clique:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
Chechik, Shiri ; Zhang, Tianyi - p. 325-334 , 2022
Link: https://dl.acm.org/doi/1..
 
?
4

Optimal Girth Approximation for Dense Directed Graphs:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Chechik, Shiri ; Lifshitz, Gur - p. 290-300 , 2021
Link: https://doi.org/10.1137/..
 
?
5

Incremental single source shortest paths in sparse digraphs:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Chechik, Shiri ; Zhang, Tianyi - p. 2463-2477 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Incremental Single Source Shortest Paths in Sparse Digraphs:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Chechik, Shiri ; Zhang, Tianyi - p. 2463-2477 , 2021
Link: https://doi.org/10.1137/..
 
?
7

Optimal girth approximation for dense directed graphs:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Chechik, Shiri ; Lifshitz, Gur - p. 290-300 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Single-source shortest paths in the CONGEST model with impr..:

Chechik, Shiri ; Mukhtar, Doron
Distributed Computing.  35 (2021)  4 - p. 357-374 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Distance sensitivity oracles with subcubic preprocessing ti..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Chechik, Shiri ; Cohen, Sarel - p. 1375-1388 , 2020
Link: https://dl.acm.org/doi/1..
 
?
10

Ramsey Spanning Trees and Their Applications:

Abraham, Ittai ; Chechik, Shiri ; Elkin, Michael..
ACM Transactions on Algorithms.  16 (2020)  2 - p. 1-21 , 2020
Link: https://doi.org/10.1145/..
 
?
11

Single-Source Shortest Paths in the CONGEST Model with Impr..:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Chechik, Shiri ; Mukhtar, Doron - p. 464-473 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Ramsey Spanning Trees and Their Applications:

Abraham, Ittai ; Chechik, Shiri ; Elkin, Michael..
ACM Transactions on Algorithms (TALG).  16 (2020)  2 - p. 1-21 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

Constant girth approximation for directed graphs in subquad..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Chechik, Shiri ; Liu, Yang P. ; Rotem, Omer. - p. 1010-1023 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Dynamic low-stretch spanning trees in subpolynomial time:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Chechik, Shiri ; Zhang, Tianyi - p. 463-475 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Near optimal algorithms for the single source replacement p..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Chechik, Shiri ; Cohen, Sarel - p. 2090-2109 , 2019
Link: https://dl.acm.org/doi/1..
 
1-15