38 Publications

Mark all

[38]
2020 | Conference Paper | IST-REx-ID: 7635
Testing concurrency on the JVM with Lincheck
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 423–424.
View | DOI
 
[37]
2020 | Conference Paper | IST-REx-ID: 7605   OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15.
View | Files available | DOI | arXiv
 
[36]
2020 | Conference Paper | IST-REx-ID: 7636
Non-blocking interpolation search trees with doubly-logarithmic running time
T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 276–291.
View | DOI
 
[35]
2019 | Conference Paper | IST-REx-ID: 6673   OA
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
View | DOI | Download (ext.) | arXiv
 
[34]
2019 | Conference Paper | IST-REx-ID: 7122
Gradient compression for communication-limited convex optimization
S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.
View | DOI
 
[33]
2019 | Conference Paper | IST-REx-ID: 7228
Scalable FIFO channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2019, pp. 317–333.
View | DOI
 
[32]
2019 | Conference Paper | IST-REx-ID: 7437   OA
Distributed learning over unreliable networks
C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.
View | Download (ext.) | arXiv
 
[31]
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View | DOI
 
[30]
2019 | Conference Paper | IST-REx-ID: 7201   OA
SparCML: High-performance sparse communication for machine learning
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, T. Hoefler, in:, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, ACM, 2019.
View | DOI | Download (ext.) | arXiv
 
[29]
2019 | Conference Paper | IST-REx-ID: 6676   OA
Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–996.
View | DOI | Download (ext.) | arXiv
 
[28]
2019 | Conference Paper | IST-REx-ID: 7542   OA
Powerset convolutional neural networks
C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.
View | Download (ext.) | arXiv
 
[27]
2018 | Conference Paper | IST-REx-ID: 5961
A brief tutorial on distributed and concurrent machine learning
D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–488.
View | DOI
 
[26]
2018 | Conference Paper | IST-REx-ID: 5966   OA
The transactional conflict problem
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–392.
View | DOI | Download (ext.) | arXiv
 
[25]
2018 | Conference Paper | IST-REx-ID: 6558   OA
Byzantine Stochastic Gradient Descent
D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, R. Garnett (Eds.), Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.
View | Download (ext.) | arXiv
 
[24]
2018 | Conference Paper | IST-REx-ID: 6589   OA
The convergence of sparsified gradient methods
D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural information processing systems, 2018, pp. 5973–5983.
View | Download (ext.) | arXiv
 
[23]
2018 | Journal Article | IST-REx-ID: 536   OA
Communication-efficient randomized consensus
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.
View | Files available | DOI
 
[22]
2018 | Conference Paper | IST-REx-ID: 5962   OA
The convergence of stochastic gradient descent in asynchronous shared memory
D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–178.
View | DOI | Download (ext.) | arXiv
 
[21]
2018 | Conference Paper | IST-REx-ID: 7812   OA
Model compression via distillation and quantization
A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.
View | Files available | arXiv
 
[20]
2018 | Conference Paper | IST-REx-ID: 5963   OA
Relaxed schedulers can efficiently parallelize iterative algorithms
D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 377–386.
View | DOI | Download (ext.) | arXiv
 
[19]
2018 | Conference Paper | IST-REx-ID: 6031
Fast quantized arithmetic on x86: Trading compute for data movement
A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.
View | DOI
 
[18]
2018 | Conference Paper | IST-REx-ID: 7116   OA
Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study
D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.
View | Files available | DOI
 
[17]
2018 | Conference Paper | IST-REx-ID: 7123   OA
Space-optimal majority in population protocols
D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.
View | DOI | Download (ext.) | arXiv
 
[16]
2018 | Journal Article | IST-REx-ID: 6001
ThreadScan: Automatic and scalable memory reclamation
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).
View | Files available | DOI
 
[15]
2018 | Conference Paper | IST-REx-ID: 5964   OA
Brief Announcement: Performance prediction for coarse-grained locking
V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 411–413.
View | DOI | Download (ext.)
 
[14]
2018 | Conference Paper | IST-REx-ID: 5965   OA
Distributionally linearizable data structures
D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–142.
View | DOI | Download (ext.) | arXiv
 
[13]
2017 | Conference Paper | IST-REx-ID: 787   OA
Time-space trade-offs in population protocols
D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, R. Gelashvili, in:, SIAM, 2017, pp. 2560–2579.
View | DOI | Download (ext.)
 
[12]
2017 | Conference Paper | IST-REx-ID: 788   OA
Robust detection in leak-prone population protocols
D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, in:, Springer, 2017, pp. 155–171.
View | DOI | Download (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 790
FPGA-accelerated dense linear machine learning: A precision-convergence trade-off
K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, C. Zhang, in:, IEEE, 2017, pp. 160–167.
View | DOI
 
[10]
2017 | Conference Paper | IST-REx-ID: 431   OA
QSGD: Communication-efficient SGD via gradient quantization and encoding
D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information Processing Systems Foundation, Inc., 2017, pp. 1710–1721.
View | Download (ext.)
 
[9]
2017 | Conference Paper | IST-REx-ID: 789
Forkscan: Conservative memory reclamation for modern operating systems
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, in:, ACM, 2017, pp. 483–498.
View | DOI
 
[8]
2017 | Conference Paper | IST-REx-ID: 791   OA
The power of choice in priority scheduling
D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 432   OA
ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning
H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings of Machine Learning Research, PMLR, 2017, pp. 4035–4043.
View | Files available
 
[6]
2017 | Conference Paper | IST-REx-ID: 487
Towards unlicensed cellular networks in TV white spaces
G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.
View | DOI
 
[5]
2016 | Conference Paper | IST-REx-ID: 785
Lease/Release: Architectural support for scaling contended data structures
S. Haider, W. Hasenplaugh, D.-A. Alistarh, in:, ACM, 2016.
View | DOI
 
[4]
2016 | Journal Article | IST-REx-ID: 786   OA
Are lock free concurrent algorithms practically wait free
D.-A. Alistarh, K. Censor Hillel, N. Shavit, Journal of the ACM 63 (2016).
View | DOI | Download (ext.) | arXiv
 
[3]
2015 | Conference Paper | IST-REx-ID: 784
A high-radix, low-latency optical switch for data centers
D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 2015, pp. 367–368.
View | DOI
 
[2]
2015 | Conference Paper | IST-REx-ID: 778   OA
Inherent limitations of hybrid transactional memory
D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 185–199.
View | DOI | Download (ext.) | arXiv
 
[1]
2015 | Conference Paper | IST-REx-ID: 780   OA
Polylogarithmic-time leader election in population protocols
D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.
View | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed

38 Publications

Mark all

[38]
2020 | Conference Paper | IST-REx-ID: 7635
Testing concurrency on the JVM with Lincheck
N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 423–424.
View | DOI
 
[37]
2020 | Conference Paper | IST-REx-ID: 7605   OA
In search of the fastest concurrent union-find algorithm
D.-A. Alistarh, A. Fedorov, N. Koval, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15.
View | Files available | DOI | arXiv
 
[36]
2020 | Conference Paper | IST-REx-ID: 7636
Non-blocking interpolation search trees with doubly-logarithmic running time
T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, ACM, 2020, pp. 276–291.
View | DOI
 
[35]
2019 | Conference Paper | IST-REx-ID: 6673   OA
Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
View | DOI | Download (ext.) | arXiv
 
[34]
2019 | Conference Paper | IST-REx-ID: 7122
Gradient compression for communication-limited convex optimization
S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.
View | DOI
 
[33]
2019 | Conference Paper | IST-REx-ID: 7228
Scalable FIFO channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2019, pp. 317–333.
View | DOI
 
[32]
2019 | Conference Paper | IST-REx-ID: 7437   OA
Distributed learning over unreliable networks
C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.
View | Download (ext.) | arXiv
 
[31]
2019 | Conference Poster | IST-REx-ID: 6485
Lock-free channels for programming via communicating sequential processes
N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming via Communicating Sequential Processes, ACM Press, 2019.
View | DOI
 
[30]
2019 | Conference Paper | IST-REx-ID: 7201   OA
SparCML: High-performance sparse communication for machine learning
C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, T. Hoefler, in:, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, ACM, 2019.
View | DOI | Download (ext.) | arXiv
 
[29]
2019 | Conference Paper | IST-REx-ID: 6676   OA
Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, ACM Press, 2019, pp. 986–996.
View | DOI | Download (ext.) | arXiv
 
[28]
2019 | Conference Paper | IST-REx-ID: 7542   OA
Powerset convolutional neural networks
C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.
View | Download (ext.) | arXiv
 
[27]
2018 | Conference Paper | IST-REx-ID: 5961
A brief tutorial on distributed and concurrent machine learning
D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–488.
View | DOI
 
[26]
2018 | Conference Paper | IST-REx-ID: 5966   OA
The transactional conflict problem
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–392.
View | DOI | Download (ext.) | arXiv
 
[25]
2018 | Conference Paper | IST-REx-ID: 6558   OA
Byzantine Stochastic Gradient Descent
D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, R. Garnett (Eds.), Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.
View | Download (ext.) | arXiv
 
[24]
2018 | Conference Paper | IST-REx-ID: 6589   OA
The convergence of sparsified gradient methods
D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural information processing systems, 2018, pp. 5973–5983.
View | Download (ext.) | arXiv
 
[23]
2018 | Journal Article | IST-REx-ID: 536   OA
Communication-efficient randomized consensus
D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.
View | Files available | DOI
 
[22]
2018 | Conference Paper | IST-REx-ID: 5962   OA
The convergence of stochastic gradient descent in asynchronous shared memory
D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–178.
View | DOI | Download (ext.) | arXiv
 
[21]
2018 | Conference Paper | IST-REx-ID: 7812   OA
Model compression via distillation and quantization
A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.
View | Files available | arXiv
 
[20]
2018 | Conference Paper | IST-REx-ID: 5963   OA
Relaxed schedulers can efficiently parallelize iterative algorithms
D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 377–386.
View | DOI | Download (ext.) | arXiv
 
[19]
2018 | Conference Paper | IST-REx-ID: 6031
Fast quantized arithmetic on x86: Trading compute for data movement
A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.
View | DOI
 
[18]
2018 | Conference Paper | IST-REx-ID: 7116   OA
Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study
D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156.
View | Files available | DOI
 
[17]
2018 | Conference Paper | IST-REx-ID: 7123   OA
Space-optimal majority in population protocols
D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.
View | DOI | Download (ext.) | arXiv
 
[16]
2018 | Journal Article | IST-REx-ID: 6001
ThreadScan: Automatic and scalable memory reclamation
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).
View | Files available | DOI
 
[15]
2018 | Conference Paper | IST-REx-ID: 5964   OA
Brief Announcement: Performance prediction for coarse-grained locking
V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 411–413.
View | DOI | Download (ext.)
 
[14]
2018 | Conference Paper | IST-REx-ID: 5965   OA
Distributionally linearizable data structures
D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–142.
View | DOI | Download (ext.) | arXiv
 
[13]
2017 | Conference Paper | IST-REx-ID: 787   OA
Time-space trade-offs in population protocols
D.-A. Alistarh, J. Aspnes, D. Eisenstat, R. Rivest, R. Gelashvili, in:, SIAM, 2017, pp. 2560–2579.
View | DOI | Download (ext.)
 
[12]
2017 | Conference Paper | IST-REx-ID: 788   OA
Robust detection in leak-prone population protocols
D.-A. Alistarh, B. Dudek, A. Kosowski, D. Soloveichik, P. Uznański, in:, Springer, 2017, pp. 155–171.
View | DOI | Download (ext.)
 
[11]
2017 | Conference Paper | IST-REx-ID: 790
FPGA-accelerated dense linear machine learning: A precision-convergence trade-off
K. Kara, D.-A. Alistarh, G. Alonso, O. Mutlu, C. Zhang, in:, IEEE, 2017, pp. 160–167.
View | DOI
 
[10]
2017 | Conference Paper | IST-REx-ID: 431   OA
QSGD: Communication-efficient SGD via gradient quantization and encoding
D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information Processing Systems Foundation, Inc., 2017, pp. 1710–1721.
View | Download (ext.)
 
[9]
2017 | Conference Paper | IST-REx-ID: 789
Forkscan: Conservative memory reclamation for modern operating systems
D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, in:, ACM, 2017, pp. 483–498.
View | DOI
 
[8]
2017 | Conference Paper | IST-REx-ID: 791   OA
The power of choice in priority scheduling
D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.
View | DOI | Download (ext.)
 
[7]
2017 | Conference Paper | IST-REx-ID: 432   OA
ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning
H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings of Machine Learning Research, PMLR, 2017, pp. 4035–4043.
View | Files available
 
[6]
2017 | Conference Paper | IST-REx-ID: 487
Towards unlicensed cellular networks in TV white spaces
G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.
View | DOI
 
[5]
2016 | Conference Paper | IST-REx-ID: 785
Lease/Release: Architectural support for scaling contended data structures
S. Haider, W. Hasenplaugh, D.-A. Alistarh, in:, ACM, 2016.
View | DOI
 
[4]
2016 | Journal Article | IST-REx-ID: 786   OA
Are lock free concurrent algorithms practically wait free
D.-A. Alistarh, K. Censor Hillel, N. Shavit, Journal of the ACM 63 (2016).
View | DOI | Download (ext.) | arXiv
 
[3]
2015 | Conference Paper | IST-REx-ID: 784
A high-radix, low-latency optical switch for data centers
D.-A. Alistarh, H. Ballani, P. Costa, A. Funnell, J. Benjamin, P. Watts, B. Thomsen, in:, ACM, 2015, pp. 367–368.
View | DOI
 
[2]
2015 | Conference Paper | IST-REx-ID: 778   OA
Inherent limitations of hybrid transactional memory
D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 185–199.
View | DOI | Download (ext.) | arXiv
 
[1]
2015 | Conference Paper | IST-REx-ID: 780   OA
Polylogarithmic-time leader election in population protocols
D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.
View | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed