Dan-Adrian Alistarh

Alistarh Group

76 Publications

Mark all

[76]
2020 | Conference Paper | IST-REx-ID: 8191
D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2020, no. 7, pp. 37–49.
View | DOI
 
[75]
2020 | Journal Article | IST-REx-ID: 8268 | OA
N. M. Gurel et al., “Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications,” IEEE Transactions on Signal Processing, vol. 68. IEEE, pp. 4268–4282, 2020.
View | DOI | Download Preprint (ext.) | arXiv
 
[74]
2020 | Conference Paper | IST-REx-ID: 8286 | OA
D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Virtual, Online; Germany, 2020, vol. 168.
View | Files available | DOI | arXiv
 
[73]
2020 | Conference Paper | IST-REx-ID: 8383
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.
View | DOI
 
[72]
2020 | Conference Paper | IST-REx-ID: 8722 | OA
S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. 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, San Diego, CA, United States, 2020, pp. 45–61.
View | DOI | Download Preprint (ext.) | arXiv
 
[71]
2020 | Journal Article | IST-REx-ID: 8723 | OA
S. Li et al., “Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging,” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2020.
View | DOI | Download Preprint (ext.) | arXiv
 
[70]
2020 | Conference Paper | IST-REx-ID: 8724 | OA
N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in Proceedings of the 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5416–5425.
View | Files available | arXiv
 
[69]
2020 | Preprint | IST-REx-ID: 8725 | OA
V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” arXiv. .
View | Download Preprint (ext.) | arXiv
 
[68]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.
View | Files available | DOI | arXiv
 
[67]
2020 | Conference Paper | IST-REx-ID: 7635
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.
View | DOI
 
[66]
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, San Diego, CA, United States, 2020, pp. 276–291.
View | DOI
 
[65]
2019 | Conference Paper | IST-REx-ID: 7201 | OA
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, and T. Hoefler, “SparCML: High-performance sparse communication for machine learning,” in International Conference for High Performance Computing, Networking, Storage and Analysis, SC, Denver, CO, Unites States, 2019.
View | DOI | Download Preprint (ext.) | arXiv
 
[64]
2019 | Conference Paper | IST-REx-ID: 7228
N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
View | DOI
 
[63]
2019 | Conference Paper | IST-REx-ID: 7437 | OA
C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.
View | Download Preprint (ext.) | arXiv
 
[62]
2019 | Conference Paper | IST-REx-ID: 7542 | OA
C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938.
View | Download Published Version (ext.) | arXiv
 
[61]
2019 | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
View | DOI
 
[60]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
View | DOI | Download Preprint (ext.) | arXiv
 
[59]
2019 | Conference Paper | IST-REx-ID: 6676 | OA
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.
View | DOI | Download Preprint (ext.) | arXiv
 
[58]
2019 | Conference Paper | IST-REx-ID: 7122
S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in 2018 IEEE Conference on Decision and Control, Miami Beach, FL, United States, 2019.
View | DOI
 
[57]
2018 | Conference Paper | IST-REx-ID: 7812 | OA
A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.
View | Files available | arXiv
 
[56]
2018 | Journal Article | IST-REx-ID: 536 | OA
D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.
View | Files available | DOI
 
[55]
2018 | Conference Paper | IST-REx-ID: 5961
D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.
View | DOI
 
[54]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
D.-A. Alistarh, C. De Sa, and N. 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, Egham, United Kingdom, 2018, pp. 169–178.
View | DOI | Download Preprint (ext.) | arXiv
 
[53]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.
View | DOI | Download Preprint (ext.) | arXiv
 
[52]
2018 | Conference Paper | IST-REx-ID: 5964 | OA
V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.
View | DOI | Download Submitted Version (ext.)
 
[51]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.
View | DOI | Download Preprint (ext.) | arXiv
 
[50]
2018 | Conference Paper | IST-REx-ID: 5966 | OA
D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.
View | DOI | Download Preprint (ext.) | arXiv
 
[49]
2018 | Journal Article | IST-REx-ID: 6001
D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” ACM Transactions on Parallel Computing, vol. 4, no. 4. Association for Computing Machinery, 2018.
View | Files available | DOI
 
[48]
2018 | Conference Paper | IST-REx-ID: 6031
A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in 2018 IEEE International Workshop on Signal Processing Systems, Cape Town, South Africa, 2018, vol. 2018–October.
View | DOI
 
[47]
2018 | Conference Paper | IST-REx-ID: 6558 | OA
D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine Stochastic Gradient Descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. Volume 2018, pp. 4613–4623.
View | Download Published Version (ext.) | arXiv
 
[46]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in Advances in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.
View | Download Preprint (ext.) | arXiv
 
[45]
2018 | Conference Paper | IST-REx-ID: 7116 | OA
D. Grubic, L. Tam, D.-A. Alistarh, and C. 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, Vienna, Austria, 2018, pp. 145–156.
View | Files available | DOI
 
[44]
2018 | Conference Paper | IST-REx-ID: 7123 | OA
D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.
View | DOI | Download Preprint (ext.) | arXiv
 
[43]
2017 | Conference Paper | IST-REx-ID: 787 | OA
D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, and R. Gelashvili, “Time-space trade-offs in population protocols,” presented at the SODA: Symposium on Discrete Algorithms, 2017, pp. 2560–2579.
View | DOI | Download None (ext.)
 
[42]
2017 | Conference Paper | IST-REx-ID: 788 | OA
D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, and P. Uznański, “Robust detection in leak-prone population protocols,” presented at the DNA Computing and Molecular Programming, 2017, vol. 10467 LNCS, pp. 155–171.
View | DOI | Download None (ext.)
 
[41]
2017 | Conference Paper | IST-REx-ID: 789
D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “Forkscan: Conservative memory reclamation for modern operating systems,” presented at the EuroSys: European Conference on Computer Systems, 2017, pp. 483–498.
View | DOI
 
[40]
2017 | Conference Paper | IST-REx-ID: 790
K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, and C. Zhang, “FPGA-accelerated dense linear machine learning: A precision-convergence trade-off,” presented at the FCCM: Field-Programmable Custom Computing Machines, 2017, pp. 160–167.
View | DOI
 
[39]
2017 | Conference Paper | IST-REx-ID: 791 | OA
D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice in priority scheduling,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Washington, WA, USA, 2017, vol. Part F129314, pp. 283–292.
View | DOI | Download Submitted Version (ext.)
 
[38]
2017 | Conference Paper | IST-REx-ID: 487
G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.
View | DOI
 
[37]
2017 | Conference Paper | IST-REx-ID: 431 | OA
D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.
View | Download Submitted Version (ext.) | arXiv
 
[36]
2017 | Conference Paper | IST-REx-ID: 432 | OA
H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning,” in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol. 70, pp. 4035–4043.
View | Files available
 
[35]
2016 | Conference Paper | IST-REx-ID: 785
S. Haider, W. Hasenplaugh, and D.-A. Alistarh, “Lease/Release: Architectural support for scaling contended data structures,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2016, vol. 12-16-March-2016.
View | DOI
 
[34]
2016 | Journal Article | IST-REx-ID: 786 | OA
D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock free concurrent algorithms practically wait free ,” Journal of the ACM, vol. 63, no. 4. ACM, 2016.
View | DOI | Download Preprint (ext.) | arXiv
 
[33]
2015 | Conference Paper | IST-REx-ID: 776
D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2015, vol. 2015–January, pp. 11–20.
View | DOI
 
[32]
2015 | Conference Paper | IST-REx-ID: 777
D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph partitioning,” presented at the NIPS: Neural Information Processing Systems, 2015, vol. 2015–January, pp. 1900–1908.
View | Download None (ext.)
 
[31]
2015 | Conference Paper | IST-REx-ID: 778 | OA
D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent limitations of hybrid transactional memory,” presented at the DISC: Distributed Computing, 2015, vol. 9363, pp. 185–199.
View | DOI | Download None (ext.) | arXiv
 
[30]
2015 | Conference Paper | IST-REx-ID: 779
D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.
View | Files available | DOI
 
[29]
2015 | Conference Paper | IST-REx-ID: 780 | OA
D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in population protocols,” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2015, vol. 9135, pp. 479–491.
View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2015 | Conference Paper | IST-REx-ID: 781
D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority in population protocols,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 47–56.
View | DOI
 
[27]
2015 | Conference Paper | IST-REx-ID: 782
D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under stochastic schedulers,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 251–260.
View | DOI
 
[26]
2015 | Conference Paper | IST-REx-ID: 783 | OA
D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.
View | DOI | Download None (ext.)
 
[25]
2015 | Conference Paper | IST-REx-ID: 784
D.-A. Alistarh et al., “A high-radix, low-latency optical switch for data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom, 2015, pp. 367–368.
View | DOI
 
[24]
2014 | Conference Paper | IST-REx-ID: 768
D.-A. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, and S. Gilbert, “Dynamic task allocation in asynchronous shared memory,” presented at the SODA: Symposium on Discrete Algorithms, 2014, pp. 416–435.
View | DOI
 
[23]
2014 | Journal Article | IST-REx-ID: 769
D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and R. Guerraoui, “Tight bounds for asynchronous renaming,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
View | DOI
 
[22]
2014 | Conference Paper | IST-REx-ID: 770
D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, and N. Shavit, “StackTrack: An automated transactional approach to concurrent memory reclamation,” presented at the EuroSys: European Conference on Computer Systems, 2014.
View | DOI
 
[21]
2014 | Conference Paper | IST-REx-ID: 771
D.-A. Alistarh, O. Denysyuk, L. Rodrígues, and N. Shavit, “Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing systems,” presented at the PODC: Principles of Distributed Computing, 2014, pp. 232–241.
View | DOI
 
[20]
2014 | Conference Paper | IST-REx-ID: 772 | OA
D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock-free concurrent algorithms practically wait-free?,” presented at the STOC: Symposium on Theory of Computing, 2014, pp. 714–723.
View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2014 | Conference Paper | IST-REx-ID: 773
D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” presented at the DISC: Distributed Computing, Austin, USA, 2014, vol. 8784, pp. 61–75.
View | DOI
 
[18]
2014 | Conference Paper | IST-REx-ID: 774
D.-A. Alistarh, K. Censor Hille, and N. Shavit, “Brief announcement: Are lock-free concurrent algorithms practically wait-free?,” presented at the PODC: Principles of Distributed Computing, 2014, pp. 50–52.
View | DOI
 
[17]
2014 | Conference Paper | IST-REx-ID: 775 | OA
D.-A. Alistarh, J. Kopinsky, A. Matveev, and N. Shavit, “The levelarray: A fast, practical long-lived renaming algorithm,” presented at the ICDCS: International Conference on Distributed Computing Systems, 2014, pp. 348–357.
View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2013 | Conference Paper | IST-REx-ID: 765
D.-A. Alistarh, J. Aspnes, G. Giakkoupis, and P. Woelfel, “Randomized loose renaming in O(loglogn) time,” presented at the PODC: Principles of Distributed Computing, 2013, pp. 200–209.
View | DOI
 
[15]
2012 | Conference Paper | IST-REx-ID: 762
D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, and G. Losa, “On the cost of composing shared-memory algorithms,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2012, pp. 298–307.
View | DOI
 
[14]
2012 | Conference Paper | IST-REx-ID: 763
D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206.
View | DOI
 
[13]
2012 | Journal Article | IST-REx-ID: 764
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” Algorithmica (New York), vol. 62, no. 1–2. Springer, pp. 595–629, 2012.
View | DOI
 
[12]
2012 | Conference Paper | IST-REx-ID: 766
D.-A. Alistarh, M. Bender, S. Gilbert, and R. Guerraoui, “How to allocate tasks asynchronously,” presented at the FOCS: Foundations of Computer Science, 2012, pp. 331–340.
View | DOI
 
[11]
2012 | Journal Article | IST-REx-ID: 767
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating Fast Indulgent Algorithms,” Theory of Computing Systems, vol. 51, no. 4. Elsevier, pp. 404–424, 2012.
View | DOI
 
[10]
2011 | Conference Paper | IST-REx-ID: 757
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating fast indulgent algorithms,” presented at the ICDCN: International Conference on Distributed Computing and Networking, 2011, vol. 6522 LNCS, pp. 41–52.
View | DOI
 
[9]
2011 | Conference Paper | IST-REx-ID: 759
D.-A. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, “The complexity of renaming,” presented at the FOCS: Foundations of Computer Science, 2011, pp. 718–727.
View | DOI
 
[8]
2011 | Conference Paper | IST-REx-ID: 760
D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS, pp. 97–109.
View | DOI
 
[7]
2011 | Conference Paper | IST-REx-ID: 761
D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and M. Zadimoghaddam, “Optimal-time adaptive strong renaming, with applications to counting,” presented at the PODC: Principles of Distributed Computing, 2011, pp. 239–248.
View | DOI
 
[6]
2010 | Conference Paper | IST-REx-ID: 754
D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast randomized test-and-set and renaming,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 94–108.
View | DOI
 
[5]
2010 | Conference Paper | IST-REx-ID: 755
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient can gossip be? (On the cost of resilient information exchange),” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2010, vol. 6199 LNCS, no. PART 2, pp. 115–126.
View | DOI
 
[4]
2010 | Conference Paper | IST-REx-ID: 756
D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, and C. Newport, “Securing every bit: Authenticated broadcast in radio networks,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2010, pp. 50–59.
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 758
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Brief announcement: New bounds for partially synchronous set agreement,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 404–405.
View | DOI
 
[2]
2009 | Conference Paper | IST-REx-ID: 752
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” presented at the ISAAC: International Symposium on Algorithms and Computation, 2009, vol. 5878 LNCS, pp. 943–953.
View | DOI
 
[1]
2008 | Conference Paper | IST-REx-ID: 753
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “How to solve consensus in the smallest window of synchrony,” presented at the DISC: Distributed Computing, 2008, vol. 5218 LNCS, pp. 32–46.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Export / Embed

76 Publications

Mark all

[76]
2020 | Conference Paper | IST-REx-ID: 8191
D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2020, no. 7, pp. 37–49.
View | DOI
 
[75]
2020 | Journal Article | IST-REx-ID: 8268 | OA
N. M. Gurel et al., “Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications,” IEEE Transactions on Signal Processing, vol. 68. IEEE, pp. 4268–4282, 2020.
View | DOI | Download Preprint (ext.) | arXiv
 
[74]
2020 | Conference Paper | IST-REx-ID: 8286 | OA
D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Virtual, Online; Germany, 2020, vol. 168.
View | Files available | DOI | arXiv
 
[73]
2020 | Conference Paper | IST-REx-ID: 8383
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.
View | DOI
 
[72]
2020 | Conference Paper | IST-REx-ID: 8722 | OA
S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. 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, San Diego, CA, United States, 2020, pp. 45–61.
View | DOI | Download Preprint (ext.) | arXiv
 
[71]
2020 | Journal Article | IST-REx-ID: 8723 | OA
S. Li et al., “Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging,” IEEE Transactions on Parallel and Distributed Systems. IEEE, 2020.
View | DOI | Download Preprint (ext.) | arXiv
 
[70]
2020 | Conference Paper | IST-REx-ID: 8724 | OA
N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in Proceedings of the 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5416–5425.
View | Files available | arXiv
 
[69]
2020 | Preprint | IST-REx-ID: 8725 | OA
V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” arXiv. .
View | Download Preprint (ext.) | arXiv
 
[68]
2020 | Conference Paper | IST-REx-ID: 7605 | OA
D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16.
View | Files available | DOI | arXiv
 
[67]
2020 | Conference Paper | IST-REx-ID: 7635
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.
View | DOI
 
[66]
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, San Diego, CA, United States, 2020, pp. 276–291.
View | DOI
 
[65]
2019 | Conference Paper | IST-REx-ID: 7201 | OA
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, and T. Hoefler, “SparCML: High-performance sparse communication for machine learning,” in International Conference for High Performance Computing, Networking, Storage and Analysis, SC, Denver, CO, Unites States, 2019.
View | DOI | Download Preprint (ext.) | arXiv
 
[64]
2019 | Conference Paper | IST-REx-ID: 7228
N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
View | DOI
 
[63]
2019 | Conference Paper | IST-REx-ID: 7437 | OA
C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.
View | Download Preprint (ext.) | arXiv
 
[62]
2019 | Conference Paper | IST-REx-ID: 7542 | OA
C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938.
View | Download Published Version (ext.) | arXiv
 
[61]
2019 | Conference Poster | IST-REx-ID: 6485
N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming via communicating sequential processes. ACM Press, 2019, pp. 417–418.
View | DOI
 
[60]
2019 | Conference Paper | IST-REx-ID: 6673 | OA
D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019, pp. 145–154.
View | DOI | Download Preprint (ext.) | arXiv
 
[59]
2019 | Conference Paper | IST-REx-ID: 6676 | OA
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Why extension-based proofs fail,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 986–996.
View | DOI | Download Preprint (ext.) | arXiv
 
[58]
2019 | Conference Paper | IST-REx-ID: 7122
S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in 2018 IEEE Conference on Decision and Control, Miami Beach, FL, United States, 2019.
View | DOI
 
[57]
2018 | Conference Paper | IST-REx-ID: 7812 | OA
A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.
View | Files available | arXiv
 
[56]
2018 | Journal Article | IST-REx-ID: 536 | OA
D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.
View | Files available | DOI
 
[55]
2018 | Conference Paper | IST-REx-ID: 5961
D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.
View | DOI
 
[54]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
D.-A. Alistarh, C. De Sa, and N. 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, Egham, United Kingdom, 2018, pp. 169–178.
View | DOI | Download Preprint (ext.) | arXiv
 
[53]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.
View | DOI | Download Preprint (ext.) | arXiv
 
[52]
2018 | Conference Paper | IST-REx-ID: 5964 | OA
V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.
View | DOI | Download Submitted Version (ext.)
 
[51]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.
View | DOI | Download Preprint (ext.) | arXiv
 
[50]
2018 | Conference Paper | IST-REx-ID: 5966 | OA
D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.
View | DOI | Download Preprint (ext.) | arXiv
 
[49]
2018 | Journal Article | IST-REx-ID: 6001
D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” ACM Transactions on Parallel Computing, vol. 4, no. 4. Association for Computing Machinery, 2018.
View | Files available | DOI
 
[48]
2018 | Conference Paper | IST-REx-ID: 6031
A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in 2018 IEEE International Workshop on Signal Processing Systems, Cape Town, South Africa, 2018, vol. 2018–October.
View | DOI
 
[47]
2018 | Conference Paper | IST-REx-ID: 6558 | OA
D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine Stochastic Gradient Descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. Volume 2018, pp. 4613–4623.
View | Download Published Version (ext.) | arXiv
 
[46]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in Advances in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.
View | Download Preprint (ext.) | arXiv
 
[45]
2018 | Conference Paper | IST-REx-ID: 7116 | OA
D. Grubic, L. Tam, D.-A. Alistarh, and C. 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, Vienna, Austria, 2018, pp. 145–156.
View | Files available | DOI
 
[44]
2018 | Conference Paper | IST-REx-ID: 7123 | OA
D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.
View | DOI | Download Preprint (ext.) | arXiv
 
[43]
2017 | Conference Paper | IST-REx-ID: 787 | OA
D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, and R. Gelashvili, “Time-space trade-offs in population protocols,” presented at the SODA: Symposium on Discrete Algorithms, 2017, pp. 2560–2579.
View | DOI | Download None (ext.)
 
[42]
2017 | Conference Paper | IST-REx-ID: 788 | OA
D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, and P. Uznański, “Robust detection in leak-prone population protocols,” presented at the DNA Computing and Molecular Programming, 2017, vol. 10467 LNCS, pp. 155–171.
View | DOI | Download None (ext.)
 
[41]
2017 | Conference Paper | IST-REx-ID: 789
D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “Forkscan: Conservative memory reclamation for modern operating systems,” presented at the EuroSys: European Conference on Computer Systems, 2017, pp. 483–498.
View | DOI
 
[40]
2017 | Conference Paper | IST-REx-ID: 790
K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, and C. Zhang, “FPGA-accelerated dense linear machine learning: A precision-convergence trade-off,” presented at the FCCM: Field-Programmable Custom Computing Machines, 2017, pp. 160–167.
View | DOI
 
[39]
2017 | Conference Paper | IST-REx-ID: 791 | OA
D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice in priority scheduling,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Washington, WA, USA, 2017, vol. Part F129314, pp. 283–292.
View | DOI | Download Submitted Version (ext.)
 
[38]
2017 | Conference Paper | IST-REx-ID: 487
G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.
View | DOI
 
[37]
2017 | Conference Paper | IST-REx-ID: 431 | OA
D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.
View | Download Submitted Version (ext.) | arXiv
 
[36]
2017 | Conference Paper | IST-REx-ID: 432 | OA
H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning,” in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol. 70, pp. 4035–4043.
View | Files available
 
[35]
2016 | Conference Paper | IST-REx-ID: 785
S. Haider, W. Hasenplaugh, and D.-A. Alistarh, “Lease/Release: Architectural support for scaling contended data structures,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2016, vol. 12-16-March-2016.
View | DOI
 
[34]
2016 | Journal Article | IST-REx-ID: 786 | OA
D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock free concurrent algorithms practically wait free ,” Journal of the ACM, vol. 63, no. 4. ACM, 2016.
View | DOI | Download Preprint (ext.) | arXiv
 
[33]
2015 | Conference Paper | IST-REx-ID: 776
D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” presented at the PPoPP: Principles and Practice of Parallel Pogramming, 2015, vol. 2015–January, pp. 11–20.
View | DOI
 
[32]
2015 | Conference Paper | IST-REx-ID: 777
D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph partitioning,” presented at the NIPS: Neural Information Processing Systems, 2015, vol. 2015–January, pp. 1900–1908.
View | Download None (ext.)
 
[31]
2015 | Conference Paper | IST-REx-ID: 778 | OA
D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent limitations of hybrid transactional memory,” presented at the DISC: Distributed Computing, 2015, vol. 9363, pp. 185–199.
View | DOI | Download None (ext.) | arXiv
 
[30]
2015 | Conference Paper | IST-REx-ID: 779
D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.
View | Files available | DOI
 
[29]
2015 | Conference Paper | IST-REx-ID: 780 | OA
D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in population protocols,” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2015, vol. 9135, pp. 479–491.
View | DOI | Download Preprint (ext.) | arXiv
 
[28]
2015 | Conference Paper | IST-REx-ID: 781
D.-A. Alistarh, R. Gelashvili, and M. Vojnović, “Fast and exact majority in population protocols,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 47–56.
View | DOI
 
[27]
2015 | Conference Paper | IST-REx-ID: 782
D.-A. Alistarh, T. Sauerwald, and M. Vojnović, “Lock-Free algorithms under stochastic schedulers,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 251–260.
View | DOI
 
[26]
2015 | Conference Paper | IST-REx-ID: 783 | OA
D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.
View | DOI | Download None (ext.)
 
[25]
2015 | Conference Paper | IST-REx-ID: 784
D.-A. Alistarh et al., “A high-radix, low-latency optical switch for data centers,” presented at the SIGCOMM: Special Interest Group on Data Communication, London, United Kindgdom, 2015, pp. 367–368.
View | DOI
 
[24]
2014 | Conference Paper | IST-REx-ID: 768
D.-A. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, and S. Gilbert, “Dynamic task allocation in asynchronous shared memory,” presented at the SODA: Symposium on Discrete Algorithms, 2014, pp. 416–435.
View | DOI
 
[23]
2014 | Journal Article | IST-REx-ID: 769
D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and R. Guerraoui, “Tight bounds for asynchronous renaming,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
View | DOI
 
[22]
2014 | Conference Paper | IST-REx-ID: 770
D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, and N. Shavit, “StackTrack: An automated transactional approach to concurrent memory reclamation,” presented at the EuroSys: European Conference on Computer Systems, 2014.
View | DOI
 
[21]
2014 | Conference Paper | IST-REx-ID: 771
D.-A. Alistarh, O. Denysyuk, L. Rodrígues, and N. Shavit, “Balls-into-Leaves: Sub-logarithmic renaming in synchronous message-passing systems,” presented at the PODC: Principles of Distributed Computing, 2014, pp. 232–241.
View | DOI
 
[20]
2014 | Conference Paper | IST-REx-ID: 772 | OA
D.-A. Alistarh, K. Censor Hillel, and N. Shavit, “Are lock-free concurrent algorithms practically wait-free?,” presented at the STOC: Symposium on Theory of Computing, 2014, pp. 714–723.
View | DOI | Download Preprint (ext.) | arXiv
 
[19]
2014 | Conference Paper | IST-REx-ID: 773
D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” presented at the DISC: Distributed Computing, Austin, USA, 2014, vol. 8784, pp. 61–75.
View | DOI
 
[18]
2014 | Conference Paper | IST-REx-ID: 774
D.-A. Alistarh, K. Censor Hille, and N. Shavit, “Brief announcement: Are lock-free concurrent algorithms practically wait-free?,” presented at the PODC: Principles of Distributed Computing, 2014, pp. 50–52.
View | DOI
 
[17]
2014 | Conference Paper | IST-REx-ID: 775 | OA
D.-A. Alistarh, J. Kopinsky, A. Matveev, and N. Shavit, “The levelarray: A fast, practical long-lived renaming algorithm,” presented at the ICDCS: International Conference on Distributed Computing Systems, 2014, pp. 348–357.
View | DOI | Download Preprint (ext.) | arXiv
 
[16]
2013 | Conference Paper | IST-REx-ID: 765
D.-A. Alistarh, J. Aspnes, G. Giakkoupis, and P. Woelfel, “Randomized loose renaming in O(loglogn) time,” presented at the PODC: Principles of Distributed Computing, 2013, pp. 200–209.
View | DOI
 
[15]
2012 | Conference Paper | IST-REx-ID: 762
D.-A. Alistarh, R. Guerraoui, P. Kuznetsov, and G. Losa, “On the cost of composing shared-memory algorithms,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2012, pp. 298–307.
View | DOI
 
[14]
2012 | Conference Paper | IST-REx-ID: 763
D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206.
View | DOI
 
[13]
2012 | Journal Article | IST-REx-ID: 764
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” Algorithmica (New York), vol. 62, no. 1–2. Springer, pp. 595–629, 2012.
View | DOI
 
[12]
2012 | Conference Paper | IST-REx-ID: 766
D.-A. Alistarh, M. Bender, S. Gilbert, and R. Guerraoui, “How to allocate tasks asynchronously,” presented at the FOCS: Foundations of Computer Science, 2012, pp. 331–340.
View | DOI
 
[11]
2012 | Journal Article | IST-REx-ID: 767
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating Fast Indulgent Algorithms,” Theory of Computing Systems, vol. 51, no. 4. Elsevier, pp. 404–424, 2012.
View | DOI
 
[10]
2011 | Conference Paper | IST-REx-ID: 757
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating fast indulgent algorithms,” presented at the ICDCN: International Conference on Distributed Computing and Networking, 2011, vol. 6522 LNCS, pp. 41–52.
View | DOI
 
[9]
2011 | Conference Paper | IST-REx-ID: 759
D.-A. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, “The complexity of renaming,” presented at the FOCS: Foundations of Computer Science, 2011, pp. 718–727.
View | DOI
 
[8]
2011 | Conference Paper | IST-REx-ID: 760
D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS, pp. 97–109.
View | DOI
 
[7]
2011 | Conference Paper | IST-REx-ID: 761
D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and M. Zadimoghaddam, “Optimal-time adaptive strong renaming, with applications to counting,” presented at the PODC: Principles of Distributed Computing, 2011, pp. 239–248.
View | DOI
 
[6]
2010 | Conference Paper | IST-REx-ID: 754
D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast randomized test-and-set and renaming,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 94–108.
View | DOI
 
[5]
2010 | Conference Paper | IST-REx-ID: 755
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient can gossip be? (On the cost of resilient information exchange),” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2010, vol. 6199 LNCS, no. PART 2, pp. 115–126.
View | DOI
 
[4]
2010 | Conference Paper | IST-REx-ID: 756
D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, and C. Newport, “Securing every bit: Authenticated broadcast in radio networks,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2010, pp. 50–59.
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 758
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Brief announcement: New bounds for partially synchronous set agreement,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 404–405.
View | DOI
 
[2]
2009 | Conference Paper | IST-REx-ID: 752
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Of choices, failures and asynchrony: the many faces of set agreement,” presented at the ISAAC: International Symposium on Algorithms and Computation, 2009, vol. 5878 LNCS, pp. 943–953.
View | DOI
 
[1]
2008 | Conference Paper | IST-REx-ID: 753
D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “How to solve consensus in the smallest window of synchrony,” presented at the DISC: Distributed Computing, 2008, vol. 5218 LNCS, pp. 32–46.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Export / Embed