Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarDan Alistarh
Person information
- affiliation: MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j13]Dan Alistarh:
Distributed Computing Column 77 Consensus Dynamics: An Overview. SIGACT News 51(1): 57 (2020)- [c64]Shigang Li, Tal Ben-Nun, Salvatore Di Girolamo, Dan Alistarh, Torsten Hoefler:
Taming unbalanced training workloads in deep learning with partial collective operations. PPoPP 2020: 45-61 - [c63]Trevor Brown, Aleksandar Prokopec, Dan Alistarh:
Non-blocking interpolation search trees with doubly-logarithmic running time. PPoPP 2020: 276-291 - [c62]Nikita Koval, Maria Sokolova, Alexander Fedorov, Dan Alistarh, Dmitry Tsitelov:
Testing concurrency on the JVM with lincheck. PPoPP 2020: 423-424 - [i39]Aleksandar Prokopec, Trevor Brown, Dan Alistarh:
Analysis and Evaluation of Non-Blocking Interpolation Search Trees. CoRR abs/2001.00413 (2020) - [i38]Dan Alistarh, Bapi Chatterjee, Vyacheslav Kungurtsev:
Elastic Consistency: A General Consistency Model for Distributed Stochastic Gradient Descent. CoRR abs/2001.05918 (2020) - [i37]Dan Alistarh, Saleh Ashkboos, Peter Davies:
Distributed Mean Estimation with Optimal Error Bounds. CoRR abs/2002.09268 (2020) - [i36]Nikola Konstantinov, Elias Frantar, Dan Alistarh, Christoph H. Lampert:
On the Sample Complexity of Adversarial Multi-Source PAC Learning. CoRR abs/2002.10384 (2020) - [i35]Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen:
Relaxed Scheduling for Scalable Belief Propagation. CoRR abs/2002.11505 (2020) - [i34]Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski:
Robust Comparison in Population Protocols. CoRR abs/2003.06485 (2020) - [i33]Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour:
Dynamic Averaging Load Balancing on Cycles. CoRR abs/2003.09297 (2020) - [i32]Dan Alistarh, Nikita Koval, Giorgi Nadiradze:
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. CoRR abs/2003.09363 (2020) - [i31]Sidak Pal Singh, Dan Alistarh:
WoodFisher: Efficient second-order approximations for model compression. CoRR abs/2004.14340 (2020) - [i30]Shigang Li, Tal Ben-Nun, Dan Alistarh, Salvatore Di Girolamo, Nikoli Dryden, Torsten Hoefler:
Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging. CoRR abs/2005.00124 (2020)
2010 – 2019
- 2019
- [j12]Dan Alistarh:
Distributed Computing Column 76: Annual Review 2019. SIGACT News 50(4): 31-32 (2019) - [c61]Nikita Koval, Dan Alistarh, Roman Elizarov:
Scalable FIFO Channels for Programming via Communicating Sequential Processes. Euro-Par 2019: 317-333 - [c60]Chen Yu, Hanlin Tang, Cédric Renggli, Simon Kassing, Ankit Singla, Dan Alistarh, Ce Zhang, Ji Liu:
Distributed Learning over Unreliable Networks. ICML 2019: 7202-7212 - [c59]Chris Wendler, Markus Püschel, Dan Alistarh:
Powerset Convolutional Neural Networks. NeurIPS 2019: 927-938 - [c58]Dan Alistarh, Alexander Fedorov, Nikita Koval:
In Search of the Fastest Concurrent Union-Find Algorithm. OPODIS 2019: 15:1-15:16 - [c57]Nikita Koval, Dan Alistarh, Roman Elizarov:
Lock-free channels for programming via communicating sequential processes: poster. PPoPP 2019: 417-418 - [c56]Cédric Renggli, Saleh Ashkboos, Mehdi Aghagolzadeh, Dan Alistarh, Torsten Hoefler:
SparCML: high-performance sparse communication for machine learning. SC 2019: 11:1-11:15 - [c55]Dan Alistarh, Giorgi Nadiradze, Nikita Koval:
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers. SPAA 2019: 145-154 - [c54]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why extension-based proofs fail. STOC 2019: 986-996 - [i29]Alexander Ratner, Dan Alistarh, Gustavo Alonso, David G. Andersen, Peter Bailis, Sarah Bird, Nicholas Carlini, Bryan Catanzaro, Eric Chung, Bill Dally, Jeff Dean, Inderjit S. Dhillon, Alexandros G. Dimakis, Pradeep Dubey, Charles Elkan, Grigori Fursin, Gregory R. Ganger, Lise Getoor, Phillip B. Gibbons, Garth A. Gibson, Joseph E. Gonzalez, Justin Gottschlich, Song Han, Kim M. Hazelwood, Furong Huang, Martin Jaggi, Kevin G. Jamieson, Michael I. Jordan, Gauri Joshi, Rania Khalaf, Jason Knight, Jakub Konecný, Tim Kraska, Arun Kumar, Anastasios Kyrillidis, Jing Li, Samuel Madden, H. Brendan McMahan, Erik Meijer, Ioannis Mitliagkas, Rajat Monga, Derek Gordon Murray, Dimitris S. Papailiopoulos, Gennady Pekhimenko, Theodoros Rekatsinas, Afshin Rostamizadeh, Christopher Ré, Christopher De Sa, Hanie Sedghi, Siddhartha Sen, Virginia Smith, Alex Smola, Dawn Song, Evan R. Sparks, Ion Stoica, Vivienne Sze, Madeleine Udell, Joaquin Vanschoren, Shivaram Venkataraman, Rashmi Vinayak, Markus Weimer, Andrew Gordon Wilson, Eric P. Xing, Matei Zaharia, Ce Zhang, Ameet Talwalkar:
SysML: The New Frontier of Machine Learning Systems. CoRR abs/1904.03257 (2019) - [i28]Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Performance Prediction for Coarse-Grained Locking. CoRR abs/1904.11323 (2019) - [i27]Shigang Li, Tal Ben-Nun, Salvatore Di Girolamo, Dan Alistarh, Torsten Hoefler:
Taming Unbalanced Training Workloads in Deep Learning with Partial Collective Operations. CoRR abs/1908.04207 (2019) - [i26]Chris Wendler, Dan Alistarh, Markus Püschel:
Powerset Convolutional Neural Networks. CoRR abs/1909.02253 (2019) - [i25]Giorgi Nadiradze, Amirmojtaba Sabour, Aditya Sharma, Ilia Markov, Vitaly Aksenov, Dan Alistarh:
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model. CoRR abs/1910.12308 (2019) - [i24]Dan Alistarh, Alexander Fedorov, Nikita Koval:
In Search of the Fastest Concurrent Union-Find Algorithm. CoRR abs/1911.06347 (2019) - 2018
- [j11]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent limitations of hybrid transactional memory. Distributed Comput. 31(3): 167-185 (2018) - [j10]Dan Alistarh, James Aspnes, Valerie King, Jared Saia:
Communication-efficient randomized consensus. Distributed Comput. 31(6): 489-501 (2018) - [j9]Dan Alistarh, Rati Gelashvili:
Recent Algorithmic Advances in Population Protocols. SIGACT News 49(3): 63-73 (2018) - [j8]Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
ThreadScan: Automatic and Scalable Memory Reclamation. ACM Trans. Parallel Comput. 4(4): 18:1-18:18 (2018) - [c53]Sarit Khirirat, Mikael Johansson, Dan Alistarh:
Gradient compression for communication-limited convex optimization. CDC 2018: 166-171 - [c52]Demjan Grubic, Leo Tam, Dan Alistarh, Ce Zhang:
Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study. EDBT 2018: 145-156 - [c51]Antonio Polino, Razvan Pascanu, Dan Alistarh:
Model compression via distillation and quantization. ICLR (Poster) 2018 - [c50]Dan Alistarh, Zeyuan Allen-Zhu, Jerry Li:
Byzantine Stochastic Gradient Descent. NeurIPS 2018: 4618-4628 - [c49]Dan Alistarh, Torsten Hoefler, Mikael Johansson, Nikola Konstantinov, Sarit Khirirat, Cédric Renggli:
The Convergence of Sparsified Gradient Methods. NeurIPS 2018: 5977-5987 - [c48]Dan Alistarh:
Session details: Session 1B: Shared Memory Theory. PODC 2018 - [c47]Dan Alistarh, Christopher De Sa, Nikola Konstantinov:
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory. PODC 2018: 169-178 - [c46]Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC 2018: 377-386 - [c45]Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov:
Brief Announcement: Performance Prediction for Coarse-Grained Locking. PODC 2018: 411-413 - [c44]Dan Alistarh:
A Brief Tutorial on Distributed and Concurrent Machine Learning. PODC 2018: 487-488 - [c43]Alen Stojanov, Tyler Michael Smith, Dan Alistarh, Markus Püschel:
Fast Quantized Arithmetic on x86: Trading Compute for Data Movement. SiPS 2018: 349-354 - [c42]Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. SODA 2018: 2221-2239 - [c41]Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. SPAA 2018: 133-142 - [c40]Dan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze:
The Transactional Conflict Problem. SPAA 2018: 383-392 - [e1]Dan Alistarh, Alex Delis, George Pallis:
Algorithmic Aspects of Cloud Computing - Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10739, Springer 2018, ISBN 978-3-319-74874-0 [contents] - [i23]David Dao, Dan Alistarh, Claudiu Musat, Ce Zhang:
DataBright: Towards a Global Exchange for Decentralized Data Ownership and Trusted Computation. CoRR abs/1802.04780 (2018) - [i22]Nezihe Merve Gürel, Kaan Kara, Dan Alistarh, Ce Zhang:
Compressive Sensing with Low Precision Data Representation: Radio Astronomy and Beyond. CoRR abs/1802.04907 (2018) - [i21]Antonio Polino, Razvan Pascanu, Dan Alistarh:
Model compression via distillation and quantization. CoRR abs/1802.05668 (2018) - [i20]Cédric Renggli, Dan Alistarh, Torsten Hoefler:
SparCML: High-Performance Sparse Communication for Machine Learning. CoRR abs/1802.08021 (2018) - [i19]Dan Alistarh, Christopher De Sa, Nikola Konstantinov:
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory. CoRR abs/1803.08841 (2018) - [i18]Dan Alistarh, Zeyuan Allen-Zhu, Jerry Li:
Byzantine Stochastic Gradient Descent. CoRR abs/1803.08917 (2018) - [i17]Dan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze:
The Transactional Conflict Problem. CoRR abs/1804.00947 (2018) - [i16]Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. CoRR abs/1804.01018 (2018) - [i15]Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. CoRR abs/1808.04155 (2018) - [i14]Dan Alistarh, Torsten Hoefler, Mikael Johansson, Sarit Khirirat, Nikola Konstantinov, Cédric Renggli:
The Convergence of Sparsified Gradient Methods. CoRR abs/1809.10505 (2018) - [i13]Hanlin Tang, Chen Yu, Cédric Renggli, Simon Kassing, Ankit Singla, Dan Alistarh, Ji Liu, Ce Zhang:
Distributed Learning over Unreliable Networks. CoRR abs/1810.07766 (2018) - [i12]Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why Extension-Based Proofs Fail. CoRR abs/1811.01421 (2018) - 2017
- [j7]Syed Kamran Haider, William Hasenplaugh, Dan Alistarh:
Lease/Release: Architectural Support for Scaling Contended Data Structures. ACM Trans. Parallel Comput. 4(2): 8:1-8:25 (2017) - [c39]Ghufran Baig, Dan Alistarh, Thomas Karagiannis, Bozidar Radunovic, Matthew Balkwill, Lili Qiu:
Towards unlicensed cellular networks in TV white spaces. CoNEXT 2017: 2-14 - [c38]Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski:
Robust Detection in Leak-Prone Population Protocols. DNA 2017: 155-171 - [c37]Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
Forkscan: Conservative Memory Reclamation for Modern Operating Systems. EuroSys 2017: 483-498 - [c36]Kaan Kara, Dan Alistarh, Gustavo Alonso, Onur Mutlu, Ce Zhang:
FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off. FCCM 2017: 160-167 - [c35]Hantian Zhang, Jerry Li, Kaan Kara, Dan Alistarh, Ji Liu, Ce Zhang:
ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning. ICML 2017: 4035-4043 - [c34]Dan Alistarh, Demjan Grubic, Jerry Li, Ryota Tomioka, Milan Vojnovic:
QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding. NIPS 2017: 1709-1720 - [c33]Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze:
The Power of Choice in Priority Scheduling. PODC 2017: 283-292 - [c32]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. SODA 2017: 2560-2579 - [i11]Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. CoRR abs/1704.04947 (2017) - [i10]Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze:
The Power of Choice in Priority Scheduling. CoRR abs/1706.04178 (2017) - [i9]Dan Alistarh, Bartlomiej Dudek, Adrian Kosowski, David Soloveichik, Przemyslaw Uznanski:
Robust Detection in Leak-Prone Population Protocols. CoRR abs/1706.09937 (2017) - 2016
- [j6]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? J. ACM 63(4): 31:1-31:20 (2016) - [c31]Syed Kamran Haider, William Hasenplaugh, Dan Alistarh:
Lease/release: architectural support for scaling contended data structures. PPOPP 2016: 17:1-17:12 - [i8]Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest:
Time-Space Trade-offs in Population Protocols. CoRR abs/1602.08032 (2016) - [i7]Dan Alistarh, Jerry Li, Ryota Tomioka, Milan Vojnovic:
QSGD: Randomized Quantization for Communication-Optimal Stochastic Gradient Descent. CoRR abs/1610.02132 (2016) - [i6]Hantian Zhang, Kaan Kara, Jerry Li, Dan Alistarh, Ji Liu, Ce Zhang:
ZipML: An End-to-end Bitwise Framework for Dense Generalized Linear Models. CoRR abs/1611.05402 (2016) - 2015
- [j5]Dan Alistarh, Hitesh Ballani, Paolo Costa, Adam C. Funnell, Joshua Benjamin, Philip M. Watts, Benn Thomsen:
A High-Radix, Low-Latency Optical Switch for Data Centers. Computer Communication Review 45(5): 367-368 (2015) - [j4]Dan Alistarh:
The Renaming Problem: Recent Developments and Open Questions. Bulletin of the EATCS 117 (2015) - [c30]Dan Alistarh, Rati Gelashvili:
Polylogarithmic-Time Leader Election in Population Protocols. ICALP (2) 2015: 479-491 - [c29]Dan Alistarh, Jennifer Iglesias, Milan Vojnovic:
Streaming Min-max Hypergraph Partitioning. NIPS 2015: 1900-1908 - [c28]Dan Alistarh, Rati Gelashvili, Milan Vojnovic:
Fast and Exact Majority in Population Protocols. PODC 2015: 47-56 - [c27]Dan Alistarh, Thomas Sauerwald, Milan Vojnovic:
Lock-Free Algorithms under Stochastic Schedulers. PODC 2015: 251-260 - [c26]Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How To Elect a Leader Faster than a Tournament. PODC 2015: 365-374 - [c25]Dan Alistarh, Justin Kopinsky, Jerry Li, Nir Shavit:
The SprayList: a scalable relaxed priority queue. PPOPP 2015: 11-20 - [c24]Dan Alistarh, Hitesh Ballani, Paolo Costa, Adam C. Funnell, Joshua Benjamin, Philip M. Watts, Benn Thomsen:
A High-Radix, Low-Latency Optical Switch for Data Centers. SIGCOMM 2015: 367-368 - [c23]Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
ThreadScan: Automatic and Scalable Memory Reclamation. SPAA 2015: 123-132 - [c22]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. DISC 2015: 185-199 - [i5]Dan Alistarh, Rati Gelashvili:
Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States. CoRR abs/1502.05745 (2015) - 2014
- [j3]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui:
Tight Bounds for Asynchronous Renaming. J. ACM 61(3): 18:1-18:51 (2014) - [c21]Dan Alistarh, Patrick Eugster, Maurice Herlihy, Alexander Matveev, Nir Shavit:
StackTrack: an automated transactional approach to concurrent memory reclamation. EuroSys 2014: 25:1-25:14 - [c20]Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit:
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. ICDCS 2014: 348-357 - [c19]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Brief announcement: are lock-free concurrent algorithms practically wait-free? PODC 2014: 50-52 - [c18]Dan Alistarh, Oksana Denysyuk, Luís E. T. Rodrigues, Nir Shavit:
Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems. PODC 2014: 232-241 - [c17]Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert:
Dynamic Task Allocation in Asynchronous Shared Memory. SODA 2014: 416-435 - [c16]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are lock-free concurrent algorithms practically wait-free? STOC 2014: 714-723 - [c15]Dan Alistarh, James Aspnes, Valerie King, Jared Saia:
Communication-Efficient Randomized Consensus. DISC 2014: 61-75 - [p1]Dan Alistarh, Rachid Guerraoui:
Distributed Algorithms. Computing Handbook, 3rd ed. (1) 2014: 16: 1-16 - [i4]Dan Alistarh, Justin Kopinsky, Alexander Matveev, Nir Shavit:
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm. CoRR abs/1405.5461 (2014) - [i3]Dan Alistarh, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, Nir Shavit:
Inherent Limitations of Hybrid Transactional Memory. CoRR abs/1405.5689 (2014) - [i2]Dan Alistarh, Rati Gelashvili, Adrian Vladu:
How to Elect a Leader Faster than a Tournament. CoRR abs/1411.1001 (2014) - 2013
- [c14]Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel:
Randomized loose renaming in O(log log n) time. PODC 2013: 200-209 - [i1]Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are Lock-Free Concurrent Algorithms Practically Wait-Free? CoRR abs/1311.3200 (2013) - 2012
- [j2]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Algorithmica 62(1-2): 595-629 (2012) - [j1]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Generating Fast Indulgent Algorithms. Theory Comput. Syst. 51(4): 404-424 (2012) - [c13]Dan Alistarh, Michael A. Bender, Seth Gilbert, Rachid Guerraoui:
How to Allocate Tasks Asynchronously. FOCS 2012: 331-340 - [c12]Dan Alistarh, Hagit Attiya
, Rachid Guerraoui, Corentin Travers:
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. SIROCCO 2012: 195-206 - [c11]Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa:
On the cost of composing shared-memory algorithms. SPAA 2012: 298-307 - 2011
- [c10]Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui:
The Complexity of Renaming. FOCS 2011: 718-727 - [c9]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Generating Fast Indulgent Algorithms. ICDCN 2011: 41-52 - [c8]Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam:
Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248 - [c7]Dan Alistarh, James Aspnes:
Sub-logarithmic Test-and-Set against a Weak Adversary. DISC 2011: 97-109 - 2010
- [c6]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam:
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). ICALP (2) 2010: 115-126 - [c5]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, Calvin C. Newport:
Securing every bit: authenticated broadcast in radio networks. SPAA 2010: 50-59 - [c4]Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, Rachid Guerraoui:
Fast Randomized Test-and-Set and Renaming. DISC 2010: 94-108 - [c3]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Brief Announcement: New Bounds for Partially Synchronous Set Agreement. DISC 2010: 404-405
2000 – 2009
- 2009
- [c2]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. ISAAC 2009: 943-953 - 2008
- [c1]Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers:
How to Solve Consensus in the Smallest Window of Synchrony. DISC 2008: 32-46