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

Universally Optimal Information Dissemination and Shortest ..:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
Chang, Yi-Jun ; Hecht, Oren ; Leitersdorf, Dean. - p. 380-390 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Improved All-Pairs Approximate Shortest Paths in Congested ..:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
Bui, Hong Duc ; Chandra, Shashwat ; Chang, Yi-Jun.. - p. 391-400 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Deterministic near-optimal distributed listing of cliques:

Censor-Hillel, Keren ; Leitersdorf, Dean ; Vulakh, David
Distributed Computing.  , 2024
Link: https://doi.org/10.1007/..
 
?
4

Fast Broadcast in Highly Connected Networks:

, In: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures,
Chandra, Shashwat ; Chang, Yi-Jun ; Dory, Michal.. - p. 331-343 , 2024
Link: https://dl.acm.org/doi/1..
 
?
5

Deterministic Near-Optimal Distributed Listing of Cliques:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
Censor-Hillel, Keren ; Leitersdorf, Dean ; Vulakh, David - p. 271-280 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

On Sparsity Awareness in Distributed Computations:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Censor-Hillel, Keren ; Leitersdorf, Dean ; Polosukhin, Volodymyr - p. 151-161 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Tight distributed listing of cliques:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Censor-Hillel, Keren ; Chang, Yi-Jun ; Gall, François Le. - p. 2878-2891 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Tight Distributed Listing of Cliques:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Censor-Hillel, Keren ; Chang, Yi-Jun ; Gall, François Le. - p. 2878-2891 , 2021
Link: https://doi.org/10.1137/..
 
?
9

Constant-Round Spanners and Shortest Paths in Congested Cli..:

, In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing,
Dory, Michal ; Fischer, Orr ; Khoury, Seri. - p. 223-233 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Fast approximate shortest paths in the congested clique:

Censor-Hillel, Keren ; Dory, Michal ; Korhonen, Janne H..
Distributed Computing.  34 (2020)  6 - p. 463-487 , 2020
Link: https://doi.org/10.1007/..
 
?
11

On Distributed Listing of Cliques:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Censor-Hillel, Keren ; Gall, François Le ; Leitersdorf, Dean - p. 474-482 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Sparse matrix multiplication and triangle listing in the Co..:

Censor-Hillel, Keren ; Leitersdorf, Dean ; Turner, Elia
Theoretical Computer Science.  809 (2020)  - p. 45-60 , 2020
Link: https://doi.org/10.1016/..
 
?
13

Fast Approximate Shortest Paths in the Congested Clique:

, In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing,
Censor-Hillel, Keren ; Dory, Michal ; Korhonen, Janne H.. - p. 74-83 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

PODC 2019 Review:

Ben-David, Naama ; Chang, Yi-Jun ; Dory, Michal.
ACM SIGACT News.  50 (2019)  4 - p. 33-45 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

PODC 2019 Review:

Ben-David, Naama ; Chang, Yi-Jun ; Dory, Michal.
ACM SIGACT News.  50 (2019)  4 - p. 33-45 , 2019
Link: https://doi.org/10.1145/..
 
1-15