Dan-Adrian Alistarh

Alistarh Group

118 Publications

Mark all

[118]
2024 | Conference Paper | IST-REx-ID: 15011 | OA
Kurtic, Eldar, Torsten Hoefler, and Dan-Adrian Alistarh. “How to Prune Your Language Model: Recovering Accuracy on the ‘Sparsity May Cry’ Benchmark.” In Proceedings of Machine Learning Research, 234:542–53. ML Research Press, 2024.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[117]
2023 | Conference Paper | IST-REx-ID: 12735 | OA
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 107–18. Association for Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[116]
2023 | Conference Paper | IST-REx-ID: 13053 | OA
Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[115]
2023 | Journal Article | IST-REx-ID: 13179 | OA
Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230.
[Published Version] View | Files available | DOI
 
[114]
2023 | Journal Article | IST-REx-ID: 12566 | OA
Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science. Elsevier, 2023. https://doi.org/10.1016/j.tcs.2023.113733.
[Published Version] View | Files available | DOI | WoS
 
[113]
2023 | Journal Article | IST-REx-ID: 12330 | OA
Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[112]
2023 | Conference Paper | IST-REx-ID: 14461 | OA
Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In Proceedings of the 40th International Conference on Machine Learning, 202:24020–44. ML Research Press, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2023 | Conference Paper | IST-REx-ID: 14460 | OA
Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In Proceedings of the 40th International Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[110]
2023 | Conference Paper | IST-REx-ID: 14458 | OA
Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” In Proceedings of the 40th International Conference on Machine Learning, 202:10323–37. ML Research Press, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[109]
2023 | Journal Article | IST-REx-ID: 14364 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/20M1375851.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[108]
2023 | Conference Paper | IST-REx-ID: 14771 | OA
Iofinova, Eugenia B, Elena-Alexandra Peste, and Dan-Adrian Alistarh. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.” In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 24364–73. IEEE, 2023. https://doi.org/10.1109/cvpr52729.2023.02334.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[107]
2023 | Conference Paper | IST-REx-ID: 14260 | OA
Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” In 35th International Conference on Computer Aided Verification , 13964:156–69. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_8.
[Published Version] View | Files available | DOI
 
[106]
2023 | Research Data Reference | IST-REx-ID: 14995 | OA
Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.7877757.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[105]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.
[Published Version] View | Files available | DOI | arXiv
 
[104]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.” In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.14.
[Published Version] View | Files available | DOI | arXiv
 
[103]
2022 | Conference Paper | IST-REx-ID: 12780 | OA
Markov, Ilia, Hamidreza Ramezanikebrya, and Dan-Adrian Alistarh. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” In Proceedings of the 23rd ACM/IFIP International Middleware Conference, 241–54. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528535.3565248.
[Published Version] View | Files available | DOI | arXiv
 
[102]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 246–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538435.
[Published Version] View | Files available | DOI | arXiv
 
[101]
2022 | Conference Paper | IST-REx-ID: 11181 | OA
Brown, Trevor A, William Sigouin, and Dan-Adrian Alistarh. “PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures.” In Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 385–99. Association for Computing Machinery, 2022. https://doi.org/10.1145/3503221.3508410.
[Published Version] View | Files available | DOI | WoS
 
[100]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” In Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 353–67. Association for Computing Machinery, 2022. https://doi.org/10.1145/3503221.3508432.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[99]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Zenodo, 2022. https://doi.org/10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[98]
2022 | Conference Paper | IST-REx-ID: 12299 | OA
Iofinova, Eugenia B, Elena-Alexandra Peste, Mark Kurtz, and Dan-Adrian Alistarh. “How Well Do Sparse ImageNet Models Transfer?” In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 12256–66. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/cvpr52688.2022.01195.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[97]
2021 | Journal Article | IST-REx-ID: 10180 | OA
Hoefler, Torsten, Dan-Adrian Alistarh, Tal Ben-Nun, Nikoli Dryden, and Elena-Alexandra Peste. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[96]
2021 | Conference Paper | IST-REx-ID: 10218 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.43.
[Published Version] View | Files available | DOI | arXiv
 
[95]
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.4.
[Published Version] View | Files available | DOI
 
[94]
2021 | Conference Paper | IST-REx-ID: 10853 | OA
Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 208–20. Association for Computing Machinery, 2021. https://doi.org/10.1145/3409964.3461810.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[93]
2021 | Conference Paper | IST-REx-ID: 11436 | OA
Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In 35th AAAI Conference on Artificial Intelligence, AAAI 2021, 35:8209–16. AAAI Press, 2021.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[92]
2021 | Conference Paper | IST-REx-ID: 11452 | OA
Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, 4:2823–34. Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[91]
2021 | Conference Paper | IST-REx-ID: 11463 | OA
Frantar, Elias, Eldar Kurtic, and Dan-Adrian Alistarh. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” In 35th Conference on Neural Information Processing Systems, 34:14873–86. Curran Associates, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[90]
2021 | Conference Paper | IST-REx-ID: 11464 | OA
Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” In 35th Conference on Neural Information Processing Systems, 34:7254–66. Curran Associates, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[89]
2021 | Conference Paper | IST-REx-ID: 9543 | OA
Davies, Peter, Vijaykrishna Gurunanthan, Niusha Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In 9th International Conference on Learning Representations, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[88]
2021 | Conference Paper | IST-REx-ID: 9620 | OA
Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In Structural Information and Communication Complexity, 12810:3–12. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_1.
[Preprint] View | Files available | DOI
 
[87]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” In Structural Information and Communication Complexity, 12810:87–105. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_6.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[86]
2021 | Conference Paper | IST-REx-ID: 11458 | OA
Peste, Elena-Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In 35th Conference on Neural Information Processing Systems, 34:8557–70. Curran Associates, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[85]
2021 | Conference Paper | IST-REx-ID: 13147 | OA
Alimisis, Foivos, Peter Davies, and Dan-Adrian Alistarh. “Communication-Efficient Distributed Optimization with Quantized Preconditioners.” In Proceedings of the 38th International Conference on Machine Learning, 139:196–206. ML Research Press, 2021.
[Published Version] View | Files available | arXiv
 
[84]
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Giorgi Nadiradze, Salvatore Di Girolamo, Nikoli Dryden, Dan-Adrian Alistarh, and Torsten Hoefler. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2021. https://doi.org/10.1109/TPDS.2020.3040606.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[83]
2021 | Conference Paper | IST-REx-ID: 9951
Alistarh, Dan-Adrian, Martin Töpfer, and Przemysław Uznański. “Comparison Dynamics in Population Protocols.” In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 55–65. Association for Computing Machinery, 2021. https://doi.org/10.1145/3465084.3467915.
View | DOI | WoS
 
[82]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[81]
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In 35th Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[80]
2021 | Journal Article | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2021. https://doi.org/10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[79]
2021 | Journal Article | IST-REx-ID: 9571 | OA
Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[78]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.
[Published Version] View | Files available | DOI | arXiv
 
[77]
2020 | Conference Paper | IST-REx-ID: 8725 | OA
Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.
[Published Version] View | Files available | DOI | arXiv
 
[76]
2020 | Conference Paper | IST-REx-ID: 9632 | OA
Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[75]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing Systems, 33:22361–72. Curran Associates, 2020.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[74]
2020 | Conference Paper | IST-REx-ID: 9415 | OA
Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020.
[Published Version] View | Files available
 
[73]
2020 | Journal Article | IST-REx-ID: 8268 | OA
Gurel, Nezihe Merve, Kaan Kara, Alen Stojanov, Tyler Smith, Thomas Lemmin, Dan-Adrian Alistarh, Markus Puschel, and Ce Zhang. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.” IEEE Transactions on Signal Processing. IEEE, 2020. https://doi.org/10.1109/TSP.2020.3010355.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[72]
2020 | Conference Paper | IST-REx-ID: 8722 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 45–61. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374528.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[71]
2020 | Conference Paper | IST-REx-ID: 8724 | OA
Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In Proceedings of the 37th International Conference on Machine Learning, 119:5416–25. ML Research Press, 2020.
[Published Version] View | Files available | arXiv
 
[70]
2020 | Conference Paper | IST-REx-ID: 7636 | OA
Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian 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, 276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[69]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400213.
View | DOI | WoS
 
[68]
2020 | Conference Paper | IST-REx-ID: 7635
Koval, Nikita, Mariia Sokolova, Alexander Fedorov, Dan-Adrian Alistarh, and Dmitry Tsitelov. “Testing Concurrency on the JVM with Lincheck.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 423–24. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374503.
View | DOI
 
[67]
2020 | Conference Paper | IST-REx-ID: 8383
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.
View | DOI
 
[66]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 
[65]
2019 | Conference Poster | IST-REx-ID: 6485
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. Lock-Free Channels for Programming via Communicating Sequential Processes. Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. ACM Press, 2019. https://doi.org/10.1145/3293883.3297000.
View | DOI | WoS
 
[64]
2019 | Conference Paper | IST-REx-ID: 7122
Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression for Communication-Limited Convex Optimization.” In 2018 IEEE Conference on Decision and Control. IEEE, 2019. https://doi.org/10.1109/cdc.2018.8619625.
View | DOI | WoS
 
[63]
2019 | Conference Paper | IST-REx-ID: 7201 | OA
Renggli, Cedric, Saleh Ashkboos, Mehdi Aghagolzadeh, Dan-Adrian Alistarh, and Torsten Hoefler. “SparCML: High-Performance Sparse Communication for Machine Learning.” In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. ACM, 2019. https://doi.org/10.1145/3295500.3356222.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[62]
2019 | Conference Paper | IST-REx-ID: 7228
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” In 25th Anniversary of Euro-Par, 11725:317–33. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29400-7_23.
View | DOI | WoS
 
[61]
2019 | Conference Paper | IST-REx-ID: 7437 | OA
Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In 36th International Conference on Machine Learning, ICML 2019, 2019–June:12481–512. IMLS, 2019.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[60]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[59]
2019 | Conference Paper | IST-REx-ID: 7542 | OA
Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
[58]
2019 | Conference Paper | IST-REx-ID: 6676 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 986–96. ACM Press, 2019. https://doi.org/10.1145/3313276.3316407.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[57]
2018 | Journal Article | IST-REx-ID: 536 | OA
Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.
[Published Version] View | Files available | DOI
 
[56]
2018 | Conference Paper | IST-REx-ID: 7116 | OA
Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.
[Published Version] View | Files available | DOI
 
[55]
2018 | Journal Article | IST-REx-ID: 6001
Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.
View | Files available | DOI
 
[54]
2018 | Conference Paper | IST-REx-ID: 7812 | OA
Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 6th International Conference on Learning Representations, 2018.
[Published Version] View | Files available | arXiv
 
[53]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[52]
2018 | Conference Paper | IST-REx-ID: 5961
Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798.
View | DOI | WoS
 
[51]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[50]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[49]
2018 | Conference Paper | IST-REx-ID: 5966 | OA
Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 383–92. ACM Press, 2018. https://doi.org/10.1145/3210377.3210406.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[48]
2018 | Conference Paper | IST-REx-ID: 5964 | OA
Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[47]
2018 | Conference Paper | IST-REx-ID: 6031
Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In 2018 IEEE International Workshop on Signal Processing Systems, Vol. 2018–October. IEEE, 2018. https://doi.org/10.1109/SiPS.2018.8598402.
View | DOI | WoS
 
[46]
2018 | Conference Paper | IST-REx-ID: 7123 | OA
Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[45]
2018 | Conference Paper | IST-REx-ID: 6558 | OA
Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
[44]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In Advances in Neural Information Processing Systems 31, Volume 2018:5973–83. Neural Information Processing Systems Foundation, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[43]
2017 | Conference Paper | IST-REx-ID: 487
Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367.
View | DOI
 
[42]
2017 | Conference Paper | IST-REx-ID: 788 | OA
Alistarh, Dan-Adrian, Bartłomiej Dudek, Adrian Kosowski, David Soloveichik, and Przemysław Uznański. “Robust Detection in Leak-Prone Population Protocols,” 10467 LNCS:155–71. Springer, 2017. https://doi.org/10.1007/978-3-319-66799-7_11.
View | DOI | Download None (ext.) | arXiv
 
[41]
2017 | Conference Paper | IST-REx-ID: 787 | OA
Alistarh, Dan-Adrian, James Aspnes, David Eisenstat, Ronald Rivest, and Rati Gelashvili. “Time-Space Trade-Offs in Population Protocols,” 2560–79. SIAM, 2017. https://doi.org/doi.org/10.1137/1.9781611974782.169.
View | DOI | Download None (ext.)
 
[40]
2017 | Conference Paper | IST-REx-ID: 789
Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “Forkscan: Conservative Memory Reclamation for Modern Operating Systems,” 483–98. ACM, 2017. https://doi.org/10.1145/3064176.3064214.
View | DOI
 
[39]
2017 | Conference Paper | IST-REx-ID: 790
Kara, Kaan, Dan-Adrian Alistarh, Gustavo Alonso, Onur Mutlu, and Ce Zhang. “FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off,” 160–67. IEEE, 2017. https://doi.org/10.1109/FCCM.2017.39.
View | DOI
 
[38]
2017 | Conference Paper | IST-REx-ID: 791 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[37]
2017 | Conference Paper | IST-REx-ID: 431 | OA
Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,” 2017:1710–21. Neural Information Processing Systems Foundation, 2017.
[Submitted Version] View | Download Submitted Version (ext.) | arXiv
 
[36]
2017 | Conference Paper | IST-REx-ID: 432 | OA
Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” In Proceedings of Machine Learning Research, 70:4035–43. ML Research Press, 2017.
[Submitted Version] View | Files available
 
[35]
2016 | Journal Article | IST-REx-ID: 786 | OA
Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock Free Concurrent Algorithms Practically Wait Free .” Journal of the ACM. ACM, 2016. https://doi.org/10.1145/2903136.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[34]
2016 | Conference Paper | IST-REx-ID: 785
Haider, Syed, William Hasenplaugh, and Dan-Adrian Alistarh. “Lease/Release: Architectural Support for Scaling Contended Data Structures,” Vol. 12-16-March-2016. ACM, 2016. https://doi.org/10.1145/2851141.2851155.
View | DOI
 
[33]
2015 | Conference Paper | IST-REx-ID: 776
Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015. https://doi.org/10.1145/2688500.2688523.
View | DOI
 
[32]
2015 | Conference Paper | IST-REx-ID: 777
Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.
View | Download None (ext.)
 
[31]
2015 | Conference Paper | IST-REx-ID: 778 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99. Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13.
View | DOI | Download None (ext.) | arXiv
 
[30]
2015 | Conference Paper | IST-REx-ID: 779
Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM, 2015. https://doi.org/10.1145/2755573.2755600.
View | Files available | DOI
 
[29]
2015 | Conference Paper | IST-REx-ID: 780 | OA
Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2015 | Conference Paper | IST-REx-ID: 781
Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429.
View | DOI
 
[27]
2015 | Conference Paper | IST-REx-ID: 782
Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430.
View | DOI
 
[26]
2015 | Conference Paper | IST-REx-ID: 783 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.
View | DOI | Download None (ext.)
 
[25]
2015 | Conference Paper | IST-REx-ID: 784
Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035.
View | DOI
 
[24]
2014 | Conference Paper | IST-REx-ID: 768
Alistarh, Dan-Adrian, James Aspnes, Michael Bender, Rati Gelashvili, and Seth Gilbert. “Dynamic Task Allocation in Asynchronous Shared Memory,” 416–35. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.31.
View | DOI
 
[23]
2014 | Journal Article | IST-REx-ID: 769
Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Rachid Guerraoui. “Tight Bounds for Asynchronous Renaming.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597630.
View | DOI
 
[22]
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
 
[21]
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
 
[20]
2014 | Conference Paper | IST-REx-ID: 772 | OA
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
 
[19]
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
 
[18]
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
 
[17]
2014 | Conference Paper | IST-REx-ID: 775 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Alexander Matveev, and Nir Shavit. “The Levelarray: A Fast, Practical Long-Lived Renaming Algorithm,” 348–57. IEEE, 2014. https://doi.org/10.1109/ICDCS.2014.43.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2013 | Conference Paper | IST-REx-ID: 765
Alistarh, Dan-Adrian, James Aspnes, George Giakkoupis, and Philipp Woelfel. “Randomized Loose Renaming in O(Loglogn) Time,” 200–209. ACM, 2013. https://doi.org/10.1145/2484239.2484240.
View | DOI
 
[15]
2012 | Conference Paper | IST-REx-ID: 762
Alistarh, Dan-Adrian, Rachid Guerraoui, Petr Kuznetsov, and Giuliano Losa. “On the Cost of Composing Shared-Memory Algorithms,” 298–307. ACM, 2012. https://doi.org/10.1145/2312005.2312057.
View | DOI
 
[14]
2012 | Conference Paper | IST-REx-ID: 763
Alistarh, Dan-Adrian, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. “Early Deciding Synchronous Renaming in O(Log f) Rounds or Less,” 7355 LNCS:195–206. Springer, 2012. https://doi.org/10.1007/978-3-642-31104-8_17.
View | DOI
 
[13]
2012 | Journal Article | IST-REx-ID: 764
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York). Springer, 2012. https://doi.org/10.1007/s00453-011-9581-7.
View | DOI
 
[12]
2012 | Conference Paper | IST-REx-ID: 766
Alistarh, Dan-Adrian, Michael Bender, Seth Gilbert, and Rachid Guerraoui. “How to Allocate Tasks Asynchronously,” 331–40. IEEE, 2012. https://doi.org/10.1109/FOCS.2012.41.
View | DOI
 
[11]
2012 | Journal Article | IST-REx-ID: 767
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms.” Theory of Computing Systems. Elsevier, 2012. https://doi.org/10.1007/s00224-012-9407-2.
View | DOI
 
[10]
2011 | Conference Paper | IST-REx-ID: 757
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms,” 6522 LNCS:41–52. Springer, 2011. https://doi.org/10.1007/978-3-642-17679-1_4.
View | DOI
 
[9]
2011 | Conference Paper | IST-REx-ID: 759
Alistarh, Dan-Adrian, James Aspnes, Seth Gilbert, and Rachid Guerraoui. “The Complexity of Renaming,” 718–27. IEEE, 2011. https://doi.org/10.1109/FOCS.2011.66.
View | DOI
 
[8]
2011 | Conference Paper | IST-REx-ID: 761
Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Morteza Zadimoghaddam. “Optimal-Time Adaptive Strong Renaming, with Applications to Counting,” 239–48. ACM, 2011. https://doi.org/10.1145/1993806.1993850.
View | DOI
 
[7]
2011 | Conference Paper | IST-REx-ID: 760
Alistarh, Dan-Adrian, and James Aspnes. “Sub-Logarithmic Test-and-Set against a Weak Adversary,” 6950 LNCS:97–109. Springer, 2011. https://doi.org/10.1007/978-3-642-24100-0_7.
View | DOI
 
[6]
2010 | Conference Paper | IST-REx-ID: 754
Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_9.
View | DOI
 
[5]
2010 | Conference Paper | IST-REx-ID: 755
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam. “How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),” 6199 LNCS:115–26. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_10.
View | DOI
 
[4]
2010 | Conference Paper | IST-REx-ID: 756
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, Žarko Milošević, and Calvin Newport. “Securing Every Bit: Authenticated Broadcast in Radio Networks,” 50–59. ACM, 2010. https://doi.org/10.1145/1810479.1810489.
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 758
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Brief Announcement: New Bounds for Partially Synchronous Set Agreement,” 6343 LNCS:404–5. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_40.
View | DOI
 
[2]
2009 | Conference Paper | IST-REx-ID: 752
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement,” 5878 LNCS:943–53. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_95.
View | DOI
 
[1]
2008 | Conference Paper | IST-REx-ID: 753
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “How to Solve Consensus in the Smallest Window of Synchrony,” 5218 LNCS:32–46. Springer, 2008. https://doi.org/10.1007/978-3-540-87779-0_3.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed

118 Publications

Mark all

[118]
2024 | Conference Paper | IST-REx-ID: 15011 | OA
Kurtic, Eldar, Torsten Hoefler, and Dan-Adrian Alistarh. “How to Prune Your Language Model: Recovering Accuracy on the ‘Sparsity May Cry’ Benchmark.” In Proceedings of Machine Learning Research, 234:542–53. ML Research Press, 2024.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[117]
2023 | Conference Paper | IST-REx-ID: 12735 | OA
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 107–18. Association for Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[116]
2023 | Conference Paper | IST-REx-ID: 13053 | OA
Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[115]
2023 | Journal Article | IST-REx-ID: 13179 | OA
Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230.
[Published Version] View | Files available | DOI
 
[114]
2023 | Journal Article | IST-REx-ID: 12566 | OA
Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science. Elsevier, 2023. https://doi.org/10.1016/j.tcs.2023.113733.
[Published Version] View | Files available | DOI | WoS
 
[113]
2023 | Journal Article | IST-REx-ID: 12330 | OA
Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[112]
2023 | Conference Paper | IST-REx-ID: 14461 | OA
Markov, Ilia, Adrian Vladu, Qi Guo, and Dan-Adrian Alistarh. “Quantized Distributed Training of Large Models with Convergence Guarantees.” In Proceedings of the 40th International Conference on Machine Learning, 202:24020–44. ML Research Press, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[111]
2023 | Conference Paper | IST-REx-ID: 14460 | OA
Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks at the Edge.” In Proceedings of the 40th International Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[110]
2023 | Conference Paper | IST-REx-ID: 14458 | OA
Frantar, Elias, and Dan-Adrian Alistarh. “SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot.” In Proceedings of the 40th International Conference on Machine Learning, 202:10323–37. ML Research Press, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[109]
2023 | Journal Article | IST-REx-ID: 14364 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/20M1375851.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[108]
2023 | Conference Paper | IST-REx-ID: 14771 | OA
Iofinova, Eugenia B, Elena-Alexandra Peste, and Dan-Adrian Alistarh. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.” In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 24364–73. IEEE, 2023. https://doi.org/10.1109/cvpr52729.2023.02334.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[107]
2023 | Conference Paper | IST-REx-ID: 14260 | OA
Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” In 35th International Conference on Computer Aided Verification , 13964:156–69. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_8.
[Published Version] View | Files available | DOI
 
[106]
2023 | Research Data Reference | IST-REx-ID: 14995 | OA
Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.7877757.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[105]
2023 | Conference Paper | IST-REx-ID: 13262 | OA
Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.
[Published Version] View | Files available | DOI | arXiv
 
[104]
2022 | Conference Paper | IST-REx-ID: 11184 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.” In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.14.
[Published Version] View | Files available | DOI | arXiv
 
[103]
2022 | Conference Paper | IST-REx-ID: 12780 | OA
Markov, Ilia, Hamidreza Ramezanikebrya, and Dan-Adrian Alistarh. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” In Proceedings of the 23rd ACM/IFIP International Middleware Conference, 241–54. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528535.3565248.
[Published Version] View | Files available | DOI | arXiv
 
[102]
2022 | Conference Paper | IST-REx-ID: 11844 | OA
Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 246–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538435.
[Published Version] View | Files available | DOI | arXiv
 
[101]
2022 | Conference Paper | IST-REx-ID: 11181 | OA
Brown, Trevor A, William Sigouin, and Dan-Adrian Alistarh. “PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures.” In Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 385–99. Association for Computing Machinery, 2022. https://doi.org/10.1145/3503221.3508410.
[Published Version] View | Files available | DOI | WoS
 
[100]
2022 | Conference Paper | IST-REx-ID: 11180 | OA
Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” In Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 353–67. Association for Computing Machinery, 2022. https://doi.org/10.1145/3503221.3508432.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[99]
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” Zenodo, 2022. https://doi.org/10.5281/ZENODO.5733408.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[98]
2022 | Conference Paper | IST-REx-ID: 12299 | OA
Iofinova, Eugenia B, Elena-Alexandra Peste, Mark Kurtz, and Dan-Adrian Alistarh. “How Well Do Sparse ImageNet Models Transfer?” In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 12256–66. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/cvpr52688.2022.01195.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[97]
2021 | Journal Article | IST-REx-ID: 10180 | OA
Hoefler, Torsten, Dan-Adrian Alistarh, Tal Ben-Nun, Nikoli Dryden, and Elena-Alexandra Peste. “Sparsity in Deep Learning: Pruning and Growth for Efficient Inference and Training in Neural Networks.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[96]
2021 | Conference Paper | IST-REx-ID: 10218 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.43.
[Published Version] View | Files available | DOI | arXiv
 
[95]
2021 | Conference Paper | IST-REx-ID: 10217 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.4.
[Published Version] View | Files available | DOI
 
[94]
2021 | Conference Paper | IST-REx-ID: 10853 | OA
Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 208–20. Association for Computing Machinery, 2021. https://doi.org/10.1145/3409964.3461810.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[93]
2021 | Conference Paper | IST-REx-ID: 11436 | OA
Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In 35th AAAI Conference on Artificial Intelligence, AAAI 2021, 35:8209–16. AAAI Press, 2021.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[92]
2021 | Conference Paper | IST-REx-ID: 11452 | OA
Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, 4:2823–34. Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[91]
2021 | Conference Paper | IST-REx-ID: 11463 | OA
Frantar, Elias, Eldar Kurtic, and Dan-Adrian Alistarh. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” In 35th Conference on Neural Information Processing Systems, 34:14873–86. Curran Associates, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[90]
2021 | Conference Paper | IST-REx-ID: 11464 | OA
Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” In 35th Conference on Neural Information Processing Systems, 34:7254–66. Curran Associates, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[89]
2021 | Conference Paper | IST-REx-ID: 9543 | OA
Davies, Peter, Vijaykrishna Gurunanthan, Niusha Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In 9th International Conference on Learning Representations, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[88]
2021 | Conference Paper | IST-REx-ID: 9620 | OA
Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In Structural Information and Communication Complexity, 12810:3–12. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_1.
[Preprint] View | Files available | DOI
 
[87]
2021 | Conference Paper | IST-REx-ID: 9823 | OA
Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” In Structural Information and Communication Complexity, 12810:87–105. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_6.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[86]
2021 | Conference Paper | IST-REx-ID: 11458 | OA
Peste, Elena-Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In 35th Conference on Neural Information Processing Systems, 34:8557–70. Curran Associates, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[85]
2021 | Conference Paper | IST-REx-ID: 13147 | OA
Alimisis, Foivos, Peter Davies, and Dan-Adrian Alistarh. “Communication-Efficient Distributed Optimization with Quantized Preconditioners.” In Proceedings of the 38th International Conference on Machine Learning, 139:196–206. ML Research Press, 2021.
[Published Version] View | Files available | arXiv
 
[84]
2021 | Journal Article | IST-REx-ID: 8723 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Giorgi Nadiradze, Salvatore Di Girolamo, Nikoli Dryden, Dan-Adrian Alistarh, and Torsten Hoefler. “Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging.” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2021. https://doi.org/10.1109/TPDS.2020.3040606.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[83]
2021 | Conference Paper | IST-REx-ID: 9951
Alistarh, Dan-Adrian, Martin Töpfer, and Przemysław Uznański. “Comparison Dynamics in Population Protocols.” In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 55–65. Association for Computing Machinery, 2021. https://doi.org/10.1145/3465084.3467915.
View | DOI | WoS
 
[82]
2021 | Conference Paper | IST-REx-ID: 10432 | OA
Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[81]
2021 | Conference Paper | IST-REx-ID: 10435 | OA
Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In 35th Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[80]
2021 | Journal Article | IST-REx-ID: 8286 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2021. https://doi.org/10.1007/s00453-021-00905-9.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[79]
2021 | Journal Article | IST-REx-ID: 9571 | OA
Ramezani-Kebrya, Ali, Fartash Faghri, Ilya Markov, Vitalii Aksenov, Dan-Adrian Alistarh, and Daniel M. Roy. “NUQSGD: Provably Communication-Efficient Data-Parallel SGD via Nonuniform Quantization.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[78]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15.
[Published Version] View | Files available | DOI | arXiv
 
[77]
2020 | Conference Paper | IST-REx-ID: 8725 | OA
Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.
[Published Version] View | Files available | DOI | arXiv
 
[76]
2020 | Conference Paper | IST-REx-ID: 9632 | OA
Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[75]
2020 | Conference Paper | IST-REx-ID: 9631 | OA
Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing Systems, 33:22361–72. Curran Associates, 2020.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[74]
2020 | Conference Paper | IST-REx-ID: 9415 | OA
Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020.
[Published Version] View | Files available
 
[73]
2020 | Journal Article | IST-REx-ID: 8268 | OA
Gurel, Nezihe Merve, Kaan Kara, Alen Stojanov, Tyler Smith, Thomas Lemmin, Dan-Adrian Alistarh, Markus Puschel, and Ce Zhang. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.” IEEE Transactions on Signal Processing. IEEE, 2020. https://doi.org/10.1109/TSP.2020.3010355.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[72]
2020 | Conference Paper | IST-REx-ID: 8722 | OA
Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations.” In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 45–61. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374528.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[71]
2020 | Conference Paper | IST-REx-ID: 8724 | OA
Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In Proceedings of the 37th International Conference on Machine Learning, 119:5416–25. ML Research Press, 2020.
[Published Version] View | Files available | arXiv
 
[70]
2020 | Conference Paper | IST-REx-ID: 7636 | OA
Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian 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, 276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[69]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400213.
View | DOI | WoS
 
[68]
2020 | Conference Paper | IST-REx-ID: 7635
Koval, Nikita, Mariia Sokolova, Alexander Fedorov, Dan-Adrian Alistarh, and Dmitry Tsitelov. “Testing Concurrency on the JVM with Lincheck.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 423–24. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374503.
View | DOI
 
[67]
2020 | Conference Paper | IST-REx-ID: 8383
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.
View | DOI
 
[66]
2020 | Conference Paper | IST-REx-ID: 15077 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
[Published Version] View | Files available | DOI | arXiv
 
[65]
2019 | Conference Poster | IST-REx-ID: 6485
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. Lock-Free Channels for Programming via Communicating Sequential Processes. Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. ACM Press, 2019. https://doi.org/10.1145/3293883.3297000.
View | DOI | WoS
 
[64]
2019 | Conference Paper | IST-REx-ID: 7122
Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression for Communication-Limited Convex Optimization.” In 2018 IEEE Conference on Decision and Control. IEEE, 2019. https://doi.org/10.1109/cdc.2018.8619625.
View | DOI | WoS
 
[63]
2019 | Conference Paper | IST-REx-ID: 7201 | OA
Renggli, Cedric, Saleh Ashkboos, Mehdi Aghagolzadeh, Dan-Adrian Alistarh, and Torsten Hoefler. “SparCML: High-Performance Sparse Communication for Machine Learning.” In International Conference for High Performance Computing, Networking, Storage and Analysis, SC. ACM, 2019. https://doi.org/10.1145/3295500.3356222.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[62]
2019 | Conference Paper | IST-REx-ID: 7228
Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” In 25th Anniversary of Euro-Par, 11725:317–33. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29400-7_23.
View | DOI | WoS
 
[61]
2019 | Conference Paper | IST-REx-ID: 7437 | OA
Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In 36th International Conference on Machine Learning, ICML 2019, 2019–June:12481–512. IMLS, 2019.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[60]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press, 2019. https://doi.org/10.1145/3323165.3323201.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[59]
2019 | Conference Paper | IST-REx-ID: 7542 | OA
Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
[58]
2019 | Conference Paper | IST-REx-ID: 6676 | OA
Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Why Extension-Based Proofs Fail.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 986–96. ACM Press, 2019. https://doi.org/10.1145/3313276.3316407.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[57]
2018 | Journal Article | IST-REx-ID: 536 | OA
Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.
[Published Version] View | Files available | DOI
 
[56]
2018 | Conference Paper | IST-REx-ID: 7116 | OA
Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.
[Published Version] View | Files available | DOI
 
[55]
2018 | Journal Article | IST-REx-ID: 6001
Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.
View | Files available | DOI
 
[54]
2018 | Conference Paper | IST-REx-ID: 7812 | OA
Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 6th International Conference on Learning Representations, 2018.
[Published Version] View | Files available | arXiv
 
[53]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[52]
2018 | Conference Paper | IST-REx-ID: 5961
Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798.
View | DOI | WoS
 
[51]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[50]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[49]
2018 | Conference Paper | IST-REx-ID: 5966 | OA
Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 383–92. ACM Press, 2018. https://doi.org/10.1145/3210377.3210406.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[48]
2018 | Conference Paper | IST-REx-ID: 5964 | OA
Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[47]
2018 | Conference Paper | IST-REx-ID: 6031
Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In 2018 IEEE International Workshop on Signal Processing Systems, Vol. 2018–October. IEEE, 2018. https://doi.org/10.1109/SiPS.2018.8598402.
View | DOI | WoS
 
[46]
2018 | Conference Paper | IST-REx-ID: 7123 | OA
Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[45]
2018 | Conference Paper | IST-REx-ID: 6558 | OA
Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.
[Published Version] View | Download Published Version (ext.) | WoS | arXiv
 
[44]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In Advances in Neural Information Processing Systems 31, Volume 2018:5973–83. Neural Information Processing Systems Foundation, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[43]
2017 | Conference Paper | IST-REx-ID: 487
Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367.
View | DOI
 
[42]
2017 | Conference Paper | IST-REx-ID: 788 | OA
Alistarh, Dan-Adrian, Bartłomiej Dudek, Adrian Kosowski, David Soloveichik, and Przemysław Uznański. “Robust Detection in Leak-Prone Population Protocols,” 10467 LNCS:155–71. Springer, 2017. https://doi.org/10.1007/978-3-319-66799-7_11.
View | DOI | Download None (ext.) | arXiv
 
[41]
2017 | Conference Paper | IST-REx-ID: 787 | OA
Alistarh, Dan-Adrian, James Aspnes, David Eisenstat, Ronald Rivest, and Rati Gelashvili. “Time-Space Trade-Offs in Population Protocols,” 2560–79. SIAM, 2017. https://doi.org/doi.org/10.1137/1.9781611974782.169.
View | DOI | Download None (ext.)
 
[40]
2017 | Conference Paper | IST-REx-ID: 789
Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “Forkscan: Conservative Memory Reclamation for Modern Operating Systems,” 483–98. ACM, 2017. https://doi.org/10.1145/3064176.3064214.
View | DOI
 
[39]
2017 | Conference Paper | IST-REx-ID: 790
Kara, Kaan, Dan-Adrian Alistarh, Gustavo Alonso, Onur Mutlu, and Ce Zhang. “FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off,” 160–67. IEEE, 2017. https://doi.org/10.1109/FCCM.2017.39.
View | DOI
 
[38]
2017 | Conference Paper | IST-REx-ID: 791 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, Part F129314:283–92. ACM, 2017. https://doi.org/10.1145/3087801.3087810.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[37]
2017 | Conference Paper | IST-REx-ID: 431 | OA
Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,” 2017:1710–21. Neural Information Processing Systems Foundation, 2017.
[Submitted Version] View | Download Submitted Version (ext.) | arXiv
 
[36]
2017 | Conference Paper | IST-REx-ID: 432 | OA
Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning.” In Proceedings of Machine Learning Research, 70:4035–43. ML Research Press, 2017.
[Submitted Version] View | Files available
 
[35]
2016 | Journal Article | IST-REx-ID: 786 | OA
Alistarh, Dan-Adrian, Keren Censor Hillel, and Nir Shavit. “Are Lock Free Concurrent Algorithms Practically Wait Free .” Journal of the ACM. ACM, 2016. https://doi.org/10.1145/2903136.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[34]
2016 | Conference Paper | IST-REx-ID: 785
Haider, Syed, William Hasenplaugh, and Dan-Adrian Alistarh. “Lease/Release: Architectural Support for Scaling Contended Data Structures,” Vol. 12-16-March-2016. ACM, 2016. https://doi.org/10.1145/2851141.2851155.
View | DOI
 
[33]
2015 | Conference Paper | IST-REx-ID: 776
Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue,” 2015–January:11–20. ACM, 2015. https://doi.org/10.1145/2688500.2688523.
View | DOI
 
[32]
2015 | Conference Paper | IST-REx-ID: 777
Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.
View | Download None (ext.)
 
[31]
2015 | Conference Paper | IST-REx-ID: 778 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99. Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13.
View | DOI | Download None (ext.) | arXiv
 
[30]
2015 | Conference Paper | IST-REx-ID: 779
Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM, 2015. https://doi.org/10.1145/2755573.2755600.
View | Files available | DOI
 
[29]
2015 | Conference Paper | IST-REx-ID: 780 | OA
Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2015 | Conference Paper | IST-REx-ID: 781
Alistarh, Dan-Adrian, Rati Gelashvili, and Milan Vojnović. “Fast and Exact Majority in Population Protocols,” 2015–July:47–56. ACM, 2015. https://doi.org/10.1145/2767386.2767429.
View | DOI
 
[27]
2015 | Conference Paper | IST-REx-ID: 782
Alistarh, Dan-Adrian, Thomas Sauerwald, and Milan Vojnović. “Lock-Free Algorithms under Stochastic Schedulers,” 2015–July:251–60. ACM, 2015. https://doi.org/10.1145/2767386.2767430.
View | DOI
 
[26]
2015 | Conference Paper | IST-REx-ID: 783 | OA
Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.
View | DOI | Download None (ext.)
 
[25]
2015 | Conference Paper | IST-REx-ID: 784
Alistarh, Dan-Adrian, Hitesh Ballani, Paolo Costa, Adam Funnell, Joshua Benjamin, Philip Watts, and Benn Thomsen. “A High-Radix, Low-Latency Optical Switch for Data Centers,” 367–68. ACM, 2015. https://doi.org/10.1145/2785956.2790035.
View | DOI
 
[24]
2014 | Conference Paper | IST-REx-ID: 768
Alistarh, Dan-Adrian, James Aspnes, Michael Bender, Rati Gelashvili, and Seth Gilbert. “Dynamic Task Allocation in Asynchronous Shared Memory,” 416–35. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.31.
View | DOI
 
[23]
2014 | Journal Article | IST-REx-ID: 769
Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Rachid Guerraoui. “Tight Bounds for Asynchronous Renaming.” Journal of the ACM. ACM, 2014. https://doi.org/10.1145/2597630.
View | DOI
 
[22]
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
 
[21]
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
 
[20]
2014 | Conference Paper | IST-REx-ID: 772 | OA
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
 
[19]
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
 
[18]
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
 
[17]
2014 | Conference Paper | IST-REx-ID: 775 | OA
Alistarh, Dan-Adrian, Justin Kopinsky, Alexander Matveev, and Nir Shavit. “The Levelarray: A Fast, Practical Long-Lived Renaming Algorithm,” 348–57. IEEE, 2014. https://doi.org/10.1109/ICDCS.2014.43.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2013 | Conference Paper | IST-REx-ID: 765
Alistarh, Dan-Adrian, James Aspnes, George Giakkoupis, and Philipp Woelfel. “Randomized Loose Renaming in O(Loglogn) Time,” 200–209. ACM, 2013. https://doi.org/10.1145/2484239.2484240.
View | DOI
 
[15]
2012 | Conference Paper | IST-REx-ID: 762
Alistarh, Dan-Adrian, Rachid Guerraoui, Petr Kuznetsov, and Giuliano Losa. “On the Cost of Composing Shared-Memory Algorithms,” 298–307. ACM, 2012. https://doi.org/10.1145/2312005.2312057.
View | DOI
 
[14]
2012 | Conference Paper | IST-REx-ID: 763
Alistarh, Dan-Adrian, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. “Early Deciding Synchronous Renaming in O(Log f) Rounds or Less,” 7355 LNCS:195–206. Springer, 2012. https://doi.org/10.1007/978-3-642-31104-8_17.
View | DOI
 
[13]
2012 | Journal Article | IST-REx-ID: 764
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.” Algorithmica (New York). Springer, 2012. https://doi.org/10.1007/s00453-011-9581-7.
View | DOI
 
[12]
2012 | Conference Paper | IST-REx-ID: 766
Alistarh, Dan-Adrian, Michael Bender, Seth Gilbert, and Rachid Guerraoui. “How to Allocate Tasks Asynchronously,” 331–40. IEEE, 2012. https://doi.org/10.1109/FOCS.2012.41.
View | DOI
 
[11]
2012 | Journal Article | IST-REx-ID: 767
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms.” Theory of Computing Systems. Elsevier, 2012. https://doi.org/10.1007/s00224-012-9407-2.
View | DOI
 
[10]
2011 | Conference Paper | IST-REx-ID: 757
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms,” 6522 LNCS:41–52. Springer, 2011. https://doi.org/10.1007/978-3-642-17679-1_4.
View | DOI
 
[9]
2011 | Conference Paper | IST-REx-ID: 759
Alistarh, Dan-Adrian, James Aspnes, Seth Gilbert, and Rachid Guerraoui. “The Complexity of Renaming,” 718–27. IEEE, 2011. https://doi.org/10.1109/FOCS.2011.66.
View | DOI
 
[8]
2011 | Conference Paper | IST-REx-ID: 761
Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Morteza Zadimoghaddam. “Optimal-Time Adaptive Strong Renaming, with Applications to Counting,” 239–48. ACM, 2011. https://doi.org/10.1145/1993806.1993850.
View | DOI
 
[7]
2011 | Conference Paper | IST-REx-ID: 760
Alistarh, Dan-Adrian, and James Aspnes. “Sub-Logarithmic Test-and-Set against a Weak Adversary,” 6950 LNCS:97–109. Springer, 2011. https://doi.org/10.1007/978-3-642-24100-0_7.
View | DOI
 
[6]
2010 | Conference Paper | IST-REx-ID: 754
Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_9.
View | DOI
 
[5]
2010 | Conference Paper | IST-REx-ID: 755
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam. “How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),” 6199 LNCS:115–26. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_10.
View | DOI
 
[4]
2010 | Conference Paper | IST-REx-ID: 756
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, Žarko Milošević, and Calvin Newport. “Securing Every Bit: Authenticated Broadcast in Radio Networks,” 50–59. ACM, 2010. https://doi.org/10.1145/1810479.1810489.
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 758
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Brief Announcement: New Bounds for Partially Synchronous Set Agreement,” 6343 LNCS:404–5. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_40.
View | DOI
 
[2]
2009 | Conference Paper | IST-REx-ID: 752
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement,” 5878 LNCS:943–53. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_95.
View | DOI
 
[1]
2008 | Conference Paper | IST-REx-ID: 753
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “How to Solve Consensus in the Smallest Window of Synchrony,” 5218 LNCS:32–46. Springer, 2008. https://doi.org/10.1007/978-3-540-87779-0_3.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed