Please note that IST 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.
2020 | Conference Paper | IST-REx-ID: 7605
D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” presented at the OPODIS: International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15.View | Files available | DOI | arXiv
2020 | Journal Article | IST-REx-ID: 7465
E. Mazur, M. C. Gallei, M. Adamowski, H. Han, H. S. Robert, and J. Friml, “Clathrin-mediated trafficking and PIN trafficking are required for auxin canalization and vascular tissue formation in Arabidopsis,” Plant Science, vol. 293, no. 4, p. 110414, 2020.View | Files available | DOI
2020 | Conference Paper | IST-REx-ID: 7636
T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 276–291.View | DOI
2020 | Conference Paper | IST-REx-ID: 7802
A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Philadelphia, PA, United States.View | Download (ext.) | arXiv
2020 | Conference Paper | IST-REx-ID: 7807
U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part I: Edge flips),” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 2823–2841.View | DOI | Download (ext.) | arXiv