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.

8978 Publications


2014 | Conference Paper | IST-REx-ID: 771
Alistarh D-A, Denysyuk O, Rodrígues L, Shavit N. Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing systems. In: ACM; 2014:232-241. doi:10.1145/2611462.2611499
View | DOI
 

2014 | Conference Paper | IST-REx-ID: 772 | OA
Alistarh D-A, Censor Hillel K, Shavit N. Are lock-free concurrent algorithms practically wait-free? In: ACM; 2014:714-723. doi:10.1145/2591796.2591836
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 773
Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. In: Kuhn F, ed. Vol 8784. Springer; 2014:61-75. doi:10.1007/978-3-662-45174-8_5
View | DOI
 

2014 | Conference Paper | IST-REx-ID: 774
Alistarh D-A, Censor Hille K, Shavit N. Brief announcement: Are lock-free concurrent algorithms practically wait-free? In: ACM; 2014:50-52. doi:10.1145/2611462.2611502
View | DOI
 

2014 | Conference Paper | IST-REx-ID: 775 | OA
Alistarh D-A, Kopinsky J, Matveev A, Shavit N. The levelarray: A fast, practical long-lived renaming algorithm. In: IEEE; 2014:348-357. doi:10.1109/ICDCS.2014.43
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications