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.
9084 Publications
2014 | Conference Paper | IST-REx-ID: 770
Alistarh, Dan-Adrian, et al. StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation. ACM, 2014, doi:10.1145/2592798.2592808.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 771
Alistarh, Dan-Adrian, et al. Balls-into-Leaves: Sub-Logarithmic Renaming in Synchronous Message-Passing Systems. ACM, 2014, pp. 232–41, doi:10.1145/2611462.2611499.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 772 |
Alistarh, Dan-Adrian, et al. Are Lock-Free Concurrent Algorithms Practically Wait-Free? ACM, 2014, pp. 714–23, doi:10.1145/2591796.2591836.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 773
Alistarh, Dan-Adrian, et al. Communication-Efficient Randomized Consensus. Edited by Fabian Kuhn, vol. 8784, Springer, 2014, pp. 61–75, doi:10.1007/978-3-662-45174-8_5.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 774
Alistarh, Dan-Adrian, et al. Brief Announcement: Are Lock-Free Concurrent Algorithms Practically Wait-Free? ACM, 2014, pp. 50–52, doi:10.1145/2611462.2611502.
View
| DOI