Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




4976 Publications

2018 | Journal Article | IST-REx-ID: 5860 | OA
Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0395
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5961
Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798
View | DOI | WoS
 
2018 | Journal Article | IST-REx-ID: 5960 | OA
Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications