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, Patrick Eugster, Maurice Herlihy, Alexander Matveev, and Nir Shavit. “StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation.” ACM, 2014. https://doi.org/10.1145/2592798.2592808.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 771
Alistarh, Dan-Adrian, Oksana Denysyuk, Luís Rodrígues, and Nir Shavit. “Balls-into-Leaves: Sub-Logarithmic Renaming in Synchronous Message-Passing Systems,” 232–41. ACM, 2014. https://doi.org/10.1145/2611462.2611499.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 772 | 
Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock-Free Concurrent Algorithms Practically Wait-Free?,” 714–23. ACM, 2014. https://doi.org/10.1145/2591796.2591836.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 773
Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” edited by Fabian Kuhn, 8784:61–75. Springer, 2014. https://doi.org/10.1007/978-3-662-45174-8_5.
View
| DOI
2014 | Conference Paper | IST-REx-ID: 774
Alistarh, Dan-Adrian, Keren Censor Hille, and Nir Shavit. “Brief Announcement: Are Lock-Free Concurrent Algorithms Practically Wait-Free?,” 50–52. ACM, 2014. https://doi.org/10.1145/2611462.2611502.
View
| DOI