Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
4941 Publications
2018 | Journal Article | IST-REx-ID: 5960 |
S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 5963 |
D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 5965 |
D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 5967 |
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5966 |
D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv