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.
417 Publications
2014 | Journal Article | IST-REx-ID: 769
Tight bounds for asynchronous renaming
D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, R. Guerraoui, Journal of the ACM 61 (2014).
View
| DOI
D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, R. Guerraoui, Journal of the ACM 61 (2014).
2014 | Conference Paper | IST-REx-ID: 770
StackTrack: An automated transactional approach to concurrent memory reclamation
D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, N. Shavit, in:, ACM, 2014.
View
| DOI
D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, N. Shavit, in:, ACM, 2014.
2014 | Conference Paper | IST-REx-ID: 771
Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing systems
D.-A. Alistarh, O. Denysyuk, L. Rodrígues, N. Shavit, in:, ACM, 2014, pp. 232–241.
View
| DOI
D.-A. Alistarh, O. Denysyuk, L. Rodrígues, N. Shavit, in:, ACM, 2014, pp. 232–241.
2014 | Conference Paper | IST-REx-ID: 772 | 
Are lock-free concurrent algorithms practically wait-free?
D.-A. Alistarh, K. Censor Hillel, N. Shavit, in:, ACM, 2014, pp. 714–723.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
D.-A. Alistarh, K. Censor Hillel, N. Shavit, in:, ACM, 2014, pp. 714–723.
2014 | Conference Paper | IST-REx-ID: 773
Communication-efficient randomized consensus
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, in:, F. Kuhn (Ed.), Springer, 2014, pp. 61–75.
View
| DOI
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, in:, F. Kuhn (Ed.), Springer, 2014, pp. 61–75.