6 Publications

Mark all

[6]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” 35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.
View | Files available | DOI | arXiv
 
[5]
2020 | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing, Springer Nature, 2020, doi:10.1007/s00446-020-00380-5.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.
View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150 | OA
Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

6 Publications

Mark all

[6]
2021 | Conference Paper | IST-REx-ID: 10219 | OA
Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” 35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.
View | Files available | DOI | arXiv
 
[5]
2020 | Journal Article | IST-REx-ID: 7939 | OA
Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing, Springer Nature, 2020, doi:10.1007/s00446-020-00380-5.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72.
View | Download Published Version (ext.) | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6933 | OA
Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2019 | Conference Paper | IST-REx-ID: 6935 | OA
Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–61, doi:10.1145/3293611.3331581.
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2019 | Journal Article | IST-REx-ID: 7150 | OA
Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications