No abstract available.
Cited By
- Allaoui T, Gasmi K and Ezzedine T (2024). Reinforcement learning based task offloading of IoT applications in fog computing: algorithms and optimization techniques, Cluster Computing, 27:8, (10299-10324), Online publication date: 1-Nov-2024.
- Guerraoui R, Gupta N and Pinot R (2024). Byzantine Machine Learning: A Primer, ACM Computing Surveys, 56:7, (1-39), Online publication date: 31-Jul-2024.
- Hajiaghayi M, Kowalski D and Olkowski J Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, (321-331)
- Zhang G, Pan F, Mao Y, Tijanic S, Dang’ana M, Motepalli S, Zhang S and Jacobsen H (2023). Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms, ACM Computing Surveys, 56:5, (1-41), Online publication date: 31-May-2024.
- Hajiaghayi M, Kowalski D and Olkowski J Brief Announcement: Improved Consensus in Quantum Networks Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, (286-289)
- Tseng L, Zhou N, Dumas C, Bantikyan T and Palmieri R Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and Write Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, (479-488)
- Tseng L and Zhang Q Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, (265-267)
- Fraigniaud P, Paz A and Rajsbaum S A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, (460-470)
- Hajiaghayi M, Kowalski D and Olkowski J Improved communication complexity of fault-tolerant consensus Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, (488-501)
- Kettaneh I, Alquraan A, Takruri H, Mashtizadeh A and Al-Kiswany S (2021). Accelerating Reads With In-Network Consistency-Aware Load Balancing, IEEE/ACM Transactions on Networking, 30:3, (954-968), Online publication date: 1-Jun-2022.
- Raynal M (2021). Distributed Computability, ACM SIGACT News, 52:2, (92-110), Online publication date: 14-Jun-2021.
- Gąsieniec L and Stachowiak G (2020). Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election, Journal of the ACM, 68:1, (1-21), Online publication date: 28-Feb-2021.
- Fatourou P and Kallimanis N (2020). The RedBlue family of universal constructions, Distributed Computing, 33:6, (485-513), Online publication date: 1-Dec-2020.
- Ghosh R, Hsieh C, Misailovic S and Mitra S (2020). Koord: a language for programming and verifying distributed robotics application, Proceedings of the ACM on Programming Languages, 4:OOPSLA, (1-30), Online publication date: 13-Nov-2020.
- Khanchandani P and Wattenhofer R Brief Announcement: Byzantine Agreement with Unknown Participants and Failures Proceedings of the 39th Symposium on Principles of Distributed Computing, (178-180)
- Gilbert S, Pandurangan G, Robinson P and Trehan A DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead Proceedings of the 39th Symposium on Principles of Distributed Computing, (438-447)
- Huang K, Huang Y and Wei H Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers Proceedings of the 39th Symposium on Principles of Distributed Computing, (200-209)
- Bangalore L, Choudhury A and Patra A (2020). The Power of Shunning, Journal of the ACM, 67:3, (1-59), Online publication date: 30-Jun-2020.
- Buchnik Y and Friedman R (2020). FireLedger, Proceedings of the VLDB Endowment, 13:9, (1525-1539), Online publication date: 1-May-2020.
- Becchetti L, Clementi A and Natale E (2020). Consensus Dynamics, ACM SIGACT News, 51:1, (58-104), Online publication date: 12-Mar-2020.
- Takruri H, Kettaneh I, Alquraan A and Al-Kiswany S FLAIR Proceedings of the 17th Usenix Conference on Networked Systems Design and Implementation, (723-738)
- Castañeda A, Lefévre J and Trehan A Fully Compact Routing in Low Memory Self-Healing Trees Proceedings of the 21st International Conference on Distributed Computing and Networking, (1-10)
- Buchnik Y and Friedman R A Generic Efficient Biased Optimizer for Consensus Protocols Proceedings of the 21st International Conference on Distributed Computing and Networking, (1-10)
- Rajsbaum S and Raynal M (2019). Mastering concurrent computing through sequential thinking, Communications of the ACM, 63:1, (78-87), Online publication date: 20-Dec-2019.
- Konnov I, Kukovec J and Tran T (2019). TLA+ model checking made symbolic, Proceedings of the ACM on Programming Languages, 3:OOPSLA, (1-30), Online publication date: 10-Oct-2019.
- Goubault É, Lazić M, Ledent J and Rajsbaum S A Dynamic Epistemic Logic Analysis of the Equality Negation Task Dynamic Logic. New Trends and Applications, (53-70)
- Abraham I, Chan T, Dolev D, Nayak K, Pass R, Ren L and Shi E Communication Complexity of Byzantine Agreement, Revisited Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, (317-326)
- Khan M, Naqvi S and Vaidya N Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, (327-336)
- Hussak W and Trehan A On Termination of a Flooding Process Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, (153-155)
- Didona D, Fatourou P, Guerraoui R, Wang J and Zwaenepoel W Distributed Transactional Systems Cannot Be Fast The 31st ACM Symposium on Parallelism in Algorithms and Architectures, (369-380)
- Gąsieniec L, Stachowiak G and Uznanski P Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols The 31st ACM Symposium on Parallelism in Algorithms and Architectures, (93-102)
- Alcántara M, Castañeda A, Flores-Peñaloza D and Rajsbaum S (2019). The topology of look-compute-move robot wait-free algorithms with hard termination, Distributed Computing, 32:3, (235-255), Online publication date: 1-Jun-2019.
- Casteigts A, Métivier Y, Robson J and Zemmari A (2019). Deterministic Leader Election Takes $$\Theta (D + \log n)$$?(D+logn) Bit Rounds, Algorithmica, 81:5, (1901-1920), Online publication date: 1-May-2019.
- Pereira P, Dotti F, Meinhardt C and Mendizabal O A library for services transparent replication Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, (268-275)
- Küttler M, Planeta M, Bierbaum J, Weinhold C, Härtig H, Barak A and Hoefler T Corrected trees for reliable group communication Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, (287-299)
- Herlihy M (2019). Blockchains from a distributed computing perspective, Communications of the ACM, 62:2, (78-85), Online publication date: 28-Jan-2019.
- Bushkov V, Dziuma D, Fatourou P and Guerraoui R (2018). The PCL Theorem, Journal of the ACM, 66:1, (1-66), Online publication date: 12-Jan-2019.
- Bangalore L, Choudhury A and Garimella G Round efficient computationally secure multi-party computation revisited Proceedings of the 20th International Conference on Distributed Computing and Networking, (292-301)
- Mostéfaoui A, Raynal M and Roy M (2019). Time-efficient read/write register in crash-prone asynchronous message-passing systems, Computing, 101:1, (3-17), Online publication date: 1-Jan-2019.
- Castañeda A, Rajsbaum S and Raynal M (2018). Unifying Concurrent Objects and Distributed Tasks, Journal of the ACM, 65:6, (1-42), Online publication date: 26-Nov-2018.
- Michail O and Spirakis P (2018). How many cooks spoil the soup?, Distributed Computing, 31:6, (455-469), Online publication date: 1-Nov-2018.
- Michail O (2018). Terminating distributed construction of shapes and patterns in a fair solution of automata, Distributed Computing, 31:5, (343-365), Online publication date: 1-Oct-2018.
- Alistarh D A Brief Tutorial on Distributed and Concurrent Machine Learning Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (487-488)
- Bhadauria R and Choudhury A Brief Announcement Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (265-267)
- Alistarh D, De Sa C and Konstantinov N The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (169-178)
- Gilbert S, Robinson P and Sourav S Leader Election in Well-Connected Graphs Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (227-236)
- Augustine J, Molla A and Pandurangan G Sublinear Message Bounds for Randomized Agreement Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (315-324)
- Ellen F, Gelashvili R and Zhu L Revisionist Simulations Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (61-70)
- Bangalore L, Choudhury A and Patra A Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (295-304)
- Alistarh D, Brown T, Kopinsky J, Li J and Nadiradze G Distributionally Linearizable Data Structures Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, (133-142)
- Robinson P, Scheideler C and Setzer A Breaking the $ilde$Omega($sqrt{n})$ Barrier Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, (173-182)
- Anta A, Konwar K, Georgiou C and Nicolaou N (2018). Formalizing and Implementing Distributed Ledger Objects, ACM SIGACT News, 49:2, (58-76), Online publication date: 13-Jun-2018.
- Athanasopoulos D Digital ecclesia Proceedings of the 40th International Conference on Software Engineering: Software Engineering in Society, (91-94)
- Gαsieniec L and Stachowiak G Fast space optimal leader election in population protocols Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (265-266)
- Imbs D, Mostéfaoui A, Perrin M and Raynal M Set-Constrained Delivery Broadcast Proceedings of the 19th International Conference on Distributed Computing and Networking, (1-10)
- Liu Y, Stoller S and Lin B (2017). From Clarity to Efficiency for Distributed Algorithms, ACM Transactions on Programming Languages and Systems, 39:3, (1-41), Online publication date: 30-Sep-2017.
- Ha P, Tsigas P and Anshus O (2017). Wait-Free Programming for General Purpose Computations on Graphics Processors, IEEE Transactions on Computers, 66:8, (1407-1420), Online publication date: 1-Aug-2017.
- Mostéfaoui A and Raynal M (2017). Signature-free asynchronous Byzantine systems, Acta Informatica, 54:5, (501-520), Online publication date: 1-Aug-2017.
- Poke M, Hoefler T and Glass C AllConcur Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing, (205-218)
- Zhou F, Trajcevski G, Tamassia R, Avci B, Khokhar A and Scheuermann P (2017). Bypassing holes in sensor networks, Ad Hoc Networks, 61:C, (16-32), Online publication date: 1-Jun-2017.
- Dani V, King V, Movahedi M, Saia J and Zamani M (2017). Secure multi-party computation in large networks, Distributed Computing, 30:3, (193-229), Online publication date: 1-Jun-2017.
- Singh J, Khilar P and Mohapatra D (2017). Dynamic slicing of distributed Aspect-Oriented Programs, Computer Standards & Interfaces, 52:C, (71-84), Online publication date: 1-May-2017.
- Mostéfaoui A, Petrolia M, Raynal M and Jard C (2017). Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems, Theory of Computing Systems, 60:4, (677-694), Online publication date: 1-May-2017.
- Gilbert S, Newport C and Zheng C (2017). Who are you? Secure identities in single hop ad hoc networks, Distributed Computing, 30:2, (103-125), Online publication date: 1-Apr-2017.
- Wei H, Huang Y and Lu J (2017). Probabilistically-Atomic 2-Atomicity, IEEE Transactions on Computers, 66:3, (502-514), Online publication date: 1-Mar-2017.
- Choudhury A Multi-valued Asynchronous Reliable Broadcast with a Strict Honest Majority Proceedings of the 18th International Conference on Distributed Computing and Networking, (1-9)
- Raynal M, Stainer J and Taubenfeld G (2016). Distributed Universality, Algorithmica, 76:2, (502-535), Online publication date: 1-Oct-2016.
- Bienkowski M, Klonowski M, Korzeniowski M and Kowalski D (2016). Randomized mutual exclusion on a multiple access channel, Distributed Computing, 29:5, (341-359), Online publication date: 1-Oct-2016.
- Tseng L and Vaidya N (2016). A Note on Fault-tolerant Consensus in Directed Networks, ACM SIGACT News, 47:3, (70-91), Online publication date: 31-Aug-2016.
- Bailis P, Fekete A, Ghodsi A, Hellerstein J and Stoica I (2016). Scalable Atomic Visibility with RAMP Transactions, ACM Transactions on Database Systems, 41:3, (1-45), Online publication date: 8-Aug-2016.
- Adhikari K, Street J, Wang C, Liu Y and Zhang S (2016). Verifying a quantitative relaxation of linearizability via refinement, International Journal on Software Tools for Technology Transfer (STTT), 18:4, (393-407), Online publication date: 1-Aug-2016.
- Mostefaoui A and Raynal M Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, (381-389)
- Castañeda A, Fraigniaud P, Gafni E, Rajsbaum S and Roy M Brief Announcement Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, (299-301)
- Kulkarni A, Dalessandro L, Kissel E, Lumsdaine A, Sterling T and Swany M Network-Managed Virtual Global Address Space for Message-driven Runtimes Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, (15-18)
- Singh J, Panda S, Khilar P and Mohapatra D (2016). A Graph-Based Dynamic Slicing of Distributed Aspect-Oriented Software, ACM SIGSOFT Software Engineering Notes, 41:2, (1-8), Online publication date: 11-May-2016.
- King V and Saia J (2016). Byzantine Agreement in Expected Polynomial Time, Journal of the ACM, 63:2, (1-21), Online publication date: 4-May-2016.
- Augustine J, Pandurangan G and Robinson P (2016). Distributed Algorithmic Foundations of Dynamic Networks, ACM SIGACT News, 47:1, (69-98), Online publication date: 10-Mar-2016.
- Castañeda A, Dolev D and Trehan A Compact routing messages in self-healing trees Proceedings of the 17th International Conference on Distributed Computing and Networking, (1-10)
- Mostéfaoui A, Moumen H and Raynal M Modular randomized byzantine k-set agreement in asynchronous message-passing systems Proceedings of the 17th International Conference on Distributed Computing and Networking, (1-10)
- Jiménez E, Arévalo S and Tang J (2015). Fault-tolerant broadcast in anonymous systems, The Journal of Supercomputing, 71:11, (4172-4191), Online publication date: 1-Nov-2015.
- Lev-Ari K, Chockler G and Keidar I A Constructive Approach for Proving Data Structures' Linearizability Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363, (356-370)
- Seidel J, Uitto J and Wattenhofer R Randomness vs. Time in Anonymous Networks Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363, (263-275)
- Mostéfaoui A, Moumen H and Raynal M (2015). Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time, Journal of the ACM, 62:4, (1-21), Online publication date: 11-Sep-2015.
- Dubois S, Kaaouachi M and Petit F Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 9212, (51-66)
- Imbs D, Rajsbaum S and Valle A Untangling Partial Agreement Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 9212, (139-155)
- Bouzid Z, Mostfaoui A and Raynal M Minimal Synchrony for Byzantine Consensus Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, (461-470)
- Censor-Hillel K, Petrank E and Timnat S Help! Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, (241-250)
- Bushkov V and Guerraoui R Safety-Liveness Exclusion in Distributed Computing Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, (227-236)
- Tseng L and Vaidya N Fault-Tolerant Consensus in Directed Graphs Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, (451-460)
- Moses Y and Patkin K Under the Hood of the Bakery Algorithm Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 9439, (399-413)
- Mostéfaoui A and Raynal M Signature-Free Asynchronous Byzantine Systems Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 9439, (194-208)
- Ameloot T (2015). Deciding Determinism with Fairness for Simple Transducer Networks, ACM Transactions on Database Systems, 40:2, (1-39), Online publication date: 30-Jun-2015.
- Brandenburger M, Cachin C and Knežević N Don't trust the cloud, verify Proceedings of the 8th ACM International Systems and Storage Conference, (1-11)
- Kutten S, Pandurangan G, Peleg D, Robinson P and Trehan A (2015). On the Complexity of Universal Leader Election, Journal of the ACM, 62:1, (1-27), Online publication date: 2-Mar-2015.
- Shuhang Wu , Shuangqing Wei , Yue Wang , Vaidyanathan R and Jian Yuan (2015). Partition Information and its Transmission Over Boolean Multi-Access Channels, IEEE Transactions on Information Theory, 61:2, (1010-1027), Online publication date: 1-Feb-2015.
- Benz S, Marandi P, Pedone F and Garbinato B Building global and scalable systems with atomic multicast Proceedings of the 15th International Middleware Conference, (169-180)
- Awerbuch B, Richa A, Scheideler C, Schmid S and Zhang J (2014). Principles of Robust Medium Access and an Application to Leader Election, ACM Transactions on Algorithms, 10:4, (1-26), Online publication date: 1-Aug-2014.
- Tseng L and Vaidya N Asynchronous convex hull consensus in the presence of crash faults Proceedings of the 2014 ACM symposium on Principles of distributed computing, (396-405)
- Mostefaoui A, Moumen H and Raynal M Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages Proceedings of the 2014 ACM symposium on Principles of distributed computing, (2-9)
- Bortnikov E, Hillel E and Sharov A Reconciling Transactional and Non-Transactional Operations in Distributed Key-Value Stores Proceedings of International Conference on Systems and Storage, (1-10)
- Bailis P, Fekete A, Hellerstein J, Ghodsi A and Stoica I Scalable atomic visibility with RAMP transactions Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, (27-38)
- Mendes H, Tasson C and Herlihy M Distributed computability in Byzantine asynchronous systems Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (704-713)
- Patra A, Choudhury A and Rangan C (2014). Asynchronous Byzantine Agreement with optimal resilience, Distributed Computing, 27:2, (111-146), Online publication date: 1-Apr-2014.
- King V and Saia J Faster agreement via a spectral method for detecting malicious behavior Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (785-800)
- Dani V, King V, Movahedi M and Saia J Quorums Quicken Queries Proceedings of the 15th International Conference on Distributed Computing and Networking - Volume 8314, (242-256)
- Friedman R, Kliot G and Kogan A Hybrid Distributed Consensus Proceedings of the 17th International Conference on Principles of Distributed Systems - Volume 8304, (145-159)
- Michail O, Chatzigiannakis I and Spirakis P Naming and Counting in Anonymous Unknown Dynamic Networks 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 8255, (281-295)
- Athanasiadis I and Villa F A roadmap to domain specific programming languages for environmental modeling Proceedings of the 2013 ACM workshop on Domain-specific modeling, (27-32)
- Dice D, Hendler D and Mirsky I Lightweight contention management for efficient compare-and-swap operations Proceedings of the 19th international conference on Parallel Processing, (595-606)
- Fraigniaud P, Rajsbaum S and Travers C (2013). Locality and checkability in wait-free computing, Distributed Computing, 26:4, (223-242), Online publication date: 1-Aug-2013.
- King V and Saia J Brief announcement Proceedings of the 2013 ACM symposium on Principles of distributed computing, (187-189)
- Augustine J, Pandurangan G and Robinson P Fast byzantine agreement in dynamic networks Proceedings of the 2013 ACM symposium on Principles of distributed computing, (74-83)
- Agathangelou C, Georgiou C and Mavronicolas M A distributed algorithm for gathering many fat mobile robots in the plane Proceedings of the 2013 ACM symposium on Principles of distributed computing, (250-259)
- King V and Saia J Byzantine agreement in polynomial expected time Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, (401-410)
- Mendes H and Herlihy M Multidimensional approximate agreement in Byzantine asynchronous systems Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, (391-400)
- Herlihy M and Rajsbaum S (2013). The topology of distributed adversaries, Distributed Computing, 26:3, (173-192), Online publication date: 1-Jun-2013.
- Bonnet F and Raynal M (2013). Anonymous asynchronous systems, Distributed Computing, 26:3, (141-158), Online publication date: 1-Jun-2013.
- Delporte-Gallet C, Fauconnier H, Gafni E and Rajsbaum S Black Art Revised Selected Papers of the First International Conference on Networked Systems - Volume 7853, (28-41)
- Ameloot T, Neven F and Van Den Bussche J (2013). Relational transducers for declarative networking, Journal of the ACM, 60:2, (1-38), Online publication date: 1-Apr-2013.
- Georgiou C, Gilbert S, Guerraoui R and Kowalski D (2013). Asynchronous gossip, Journal of the ACM, 60:2, (1-42), Online publication date: 1-Apr-2013.
- Ba M, Flauzac O, Haggar B, Nolot F and Niang I Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, (1-10)
- Dutta C, Pandurangan G, Rajaraman R, Sun Z and Viola E On the complexity of information spreading in dynamic networks Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (717-736)
- Brandes P and auf der Heide F Distributed computing in fault-prone dynamic networks Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems, (9-14)
- Liu Y, Stoller S, Lin B and Gorbovitski M (2012). From clarity to efficiency for distributed algorithms, ACM SIGPLAN Notices, 47:10, (395-410), Online publication date: 15-Nov-2012.
- Wang T, Song S, Sun J, Liu Y, Dong J, Wang X and Li S More anti-chain based refinement checking Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering, (364-380)
- Liu Y, Stoller S, Lin B and Gorbovitski M From clarity to efficiency for distributed algorithms Proceedings of the ACM international conference on Object oriented programming systems languages and applications, (395-410)
- Attiya H and Paz A Counting-based impossibility proofs for renaming and set agreement Proceedings of the 26th international conference on Distributed Computing, (356-370)
- Sarma A, Lall A, Nanongkai D and Trehan A Dense subgraphs on dynamic networks Proceedings of the 26th international conference on Distributed Computing, (151-165)
- Ateniese G, Baldoni R, Bonomi S and Di Luna G Oblivious assignment with m slots Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems, (187-201)
- Ameloot T and Van den Bussche J On the CRON conjecture Proceedings of the Second international conference on Datalog in Academia and Industry, (44-55)
- Herlihy M, Rajsbaum S and Raynal M (2012). Computability in distributed computing, ACM SIGACT News, 43:3, (88-110), Online publication date: 27-Aug-2012.
- Lynch N, Radeva T and Sastry S Asynchronous leader election and MIS using abstract MAC layer Proceedings of the 8th International Workshop on Foundations of Mobile Computing, (1-10)
- Delporte-Gallet C, Fauconnier H, Gafni E and Kuznetsov P Wait-freedom with advice Proceedings of the 2012 ACM symposium on Principles of distributed computing, (105-114)
- Wu S, Chen Y, Fu X and Li J NCShield Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service, (1-9)
- Aspnes J, Attiya H and Censor-Hillel K (2012). Polylogarithmic concurrent data structures from monotone circuits, Journal of the ACM, 59:1, (1-24), Online publication date: 1-Feb-2012.
- Kulkarni A, Thirunavukkarasu J, Pillai P, Sulegai S and Rao S Insertion and querying mechanism for a distributed XML database system Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies, (1-8)
- Augustine J, Pandurangan G, Robinson P and Upfal E Towards robust and efficient computation in dynamic peer-to-peer networks Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (551-569)
- Herlihy M and Shavit N On the nature of progress Proceedings of the 15th international conference on Principles of Distributed Systems, (313-328)
- Imbs D and Raynal M The weakest failure detector to implement a register in asynchronous systems with hybrid communication Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (268-282)
- Alon N, Attiya H, Dolev S, Dubois S, Potop-Butucaru M and Tixeuil S Pragmatic self-stabilization of atomic memory in message-passing systems Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (19-31)
- Bonnet F and Raynal M (2011). The Price of Anonymity, ACM Transactions on Autonomous and Adaptive Systems, 6:4, (1-28), Online publication date: 1-Oct-2011.
- Attiya H, Borran F, Hutle M, Milosevic Z and Schiper A Structured derivation of semi-synchronous algorithms Proceedings of the 25th international conference on Distributed computing, (374-388)
- Aspnes J Randomized consensus in expected O(n2) total work using single-writer registers Proceedings of the 25th international conference on Distributed computing, (363-373)
- Fraigniaud P, Rajsbaum S and Travers C Locality and checkability in wait-free computing Proceedings of the 25th international conference on Distributed computing, (333-347)
- Chandy K, Go B, Mitra S, Pilotto C and White J (2011). Verification of distributed systems with local–global predicates, Formal Aspects of Computing, 23:5, (649-679), Online publication date: 1-Sep-2011.
- Nowak T, Függer M and Kößler A On the performance of a retransmission-based synchronizer Proceedings of the 18th international conference on Structural information and communication complexity, (234-245)
- Ameloot T, Neven F and Van den Bussche J Relational transducers for declarative networking Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (283-292)
- Doerr B, Goldberg L, Minder L, Sauerwald T and Scheideler C Stabilizing consensus with the power of two choices Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, (149-158)
- Zhang S Scalable automatic linearizability checking Proceedings of the 33rd International Conference on Software Engineering, (1185-1187)
- Richa A, Scheideler C, Schmid S and Zhang J Self-stabilizing leader election for single-hop wireless networks despite jamming Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing, (1-10)
- Censor-Hillel K and Shachnai H Fast information spreading in graphs with large weak conductance Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (440-448)
- Baldellon O, Mostéfaoui A and Raynal M A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks Proceedings of the 12th international conference on Distributed computing and networking, (215-226)
- King V, Lonargan S, Saia J and Trehan A Load balanced scalable Byzantine agreement through quorum building, with full information Proceedings of the 12th international conference on Distributed computing and networking, (203-214)
- Attiya H Invited paper Proceedings of the 12th international conference on Distributed computing and networking, (1-11)
- Raynal M On the implementation of concurrent objects Dependable and Historic Computing, (453-478)
- Pukdesree S, Lacharoj V and Sirisang P (2011). Performance evaluation of distributed database on PC cluster computers, WSEAS Transactions on Computers, 10:1, (21-30), Online publication date: 1-Jan-2011.
- Freiling F, Guerraoui R and Kuznetsov P (2011). The failure detector abstraction, ACM Computing Surveys, 43:2, (1-40), Online publication date: 1-Jan-2011.
- Georgiou C, Hadjiprocopiou P and Musial P On the automated implementation of time-based paxos using the IOA compiler Proceedings of the 14th international conference on Principles of distributed systems, (235-252)
- Imbs D and Raynal M On adaptive renaming under eventually limited contention Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems, (377-387)
- Israeli A, McCubbins M, Paturi R and Vattani A Low memory distributed protocols for 2-coloring Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems, (303-318)
- Hoch E, Ben-Or M and Dolev D A fault-resistant asynchronous clock function Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems, (19-34)
- Abraham I, Aguilera M and Malkhi D Fast asynchronous consensus with optimal resilience Proceedings of the 24th international conference on Distributed computing, (4-19)
- Imbs D and Raynal M The x-wait-freedom progress condition Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I, (584-595)
- Beauquier J, Burman J, Clement J and Kutten S On utilizing speed in networks of mobile agents Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (305-314)
- Serafini M, Dobre D, Majuntke M, Bokor P and Suri N Eventually linearizable shared objects Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (95-104)
- Imbs D, Raynal M and Taubenfeld G On asymmetric progress conditions Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (55-64)
- Imbs D and Raynal M The multiplicative power of consensus numbers Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (26-35)
- Attiya H The inherent complexity of transactional memory and what to do about it Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (1-5)
- Delporte-Gallet C, Fauconnier H, Guerraoui R and Kermarrec A Brief announcement Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, (74-75)
- Censor Hillel K Multi-sided shared coins and randomized set-agreement Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, (60-68)
- Kuhn F, Lynch N and Oshman R Distributed computation in dynamic networks Proceedings of the forty-second ACM symposium on Theory of computing, (513-522)
- Ye Y and Megson G Distributed acceleration of mobile radio network optimisation algorithms Proceedings of the 9th conference on Wireless telecommunications symposium, (124-131)
- Rajsbaum S Iterated shared memory models Proceedings of the 9th Latin American conference on Theoretical Informatics, (407-416)
- Li C and Dai H Towards efficient designs for in-network computing with noisy wireless channels Proceedings of the 29th conference on Information communications, (2008-2015)
- Afek Y, Gafni E, Rajsbaum S, Raynal M and Travers C (2010). The k-simultaneous consensus problem, Distributed Computing, 22:3, (185-195), Online publication date: 1-Mar-2010.
- Borran F and Schiper A A leader-free Byzantine consensus algorithm Proceedings of the 11th international conference on Distributed computing and networking, (67-78)
- Imbs D and Raynal M Visiting Gafni's Reduction Land Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, (369-383)
- Liu Y, Chen W, Liu Y and Sun J Model Checking Linearizability via Refinement Proceedings of the 2nd World Congress on Formal Methods, (321-337)
- Attiya H, Guerraoui R, Hendler D and Kuznetsov P (2009). The complexity of obstruction-free implementations, Journal of the ACM, 56:4, (1-33), Online publication date: 1-Jun-2009.
- Moses Y and Raynal M (2009). Revisiting simultaneous consensus with crash failures, Journal of Parallel and Distributed Computing, 69:4, (400-409), Online publication date: 1-Apr-2009.
- Hendler D (2009). Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006), ACM SIGACT News, 40:1, (47-50), Online publication date: 28-Feb-2009.
- Ha P, Tsigas P and Anshus O (2009). Non-blocking programming on multi-core graphics processors, ACM SIGARCH Computer Architecture News, 36:5, (19-28), Online publication date: 20-Dec-2008.
- Boulinier C, Datta A, Larmore L and Petit F (2008). Space efficient and time optimal distributed BFS tree construction, Information Processing Letters, 108:5, (273-278), Online publication date: 1-Nov-2008.
- Attiya H and Censor K (2008). Tight bounds for asynchronous randomized consensus, Journal of the ACM, 55:5, (1-26), Online publication date: 1-Oct-2008.
- Singh A, Fonseca P, Kuznetsov P, Rodrigues R and Maniatis P Defining weakly consistent Byzantine fault-tolerant services Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware, (1-5)
- Dolev D and Hoch E OCD Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (395-404)
- Bortnikov E, Gurevich M, Keidar I, Kliot G and Shraer A Brahms Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (145-154)
- Georgiou C, Gilbert S, Guerraoui R and Kowalski D On the complexity of asynchronous gossip Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (135-144)
- Rajsbaum S, Raynal M and Travers C The Iterated Restricted Immediate Snapshot Model Proceedings of the 14th annual international conference on Computing and Combinatorics, (487-497)
- Attiya H and Hillel E Highly-concurrent multi-word synchronization Proceedings of the 9th international conference on Distributed computing and networking, (112-123)
- Gafni E and Kuznetsov P N-consensus is the second strongest object for N + 1 processes Proceedings of the 11th international conference on Principles of distributed systems, (260-273)
- Ellen F, Fatourou P and Ruppert E (2007). Time lower bounds for implementations of multi-writer snapshots, Journal of the ACM, 54:6, (30-es), Online publication date: 1-Dec-2007.
- Dinitz Y and Solomon N (2007). Two absolute bounds for distributed bit complexity, Theoretical Computer Science, 384:2-3, (168-183), Online publication date: 1-Oct-2007.
- Chlebus B and Rokicki M (2007). Centralized asynchronous broadcast in radio networks, Theoretical Computer Science, 383:1, (5-22), Online publication date: 2-Sep-2007.
- Cachin C, Shelat A and Shraer A Efficient fork-linearizable access to untrusted shared memory Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, (129-138)
- Busch C, LaFortune R and Tirthapura S Improved sparse covers for graphs excluding a fixed minor Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, (61-70)
- Mittal N, Venkatesan S and Peri S (2007). A family of optimal termination detection algorithms, Distributed Computing, 20:2, (141-162), Online publication date: 1-Aug-2007.
- Friedman R, Mostefaoui A, Rajsbaum S and Raynal M (2007). Asynchronous Agreement and Its Relation with Error-Correcting Codes, IEEE Transactions on Computers, 56:7, (865-875), Online publication date: 1-Jul-2007.
- Attiya H and Censor K Tight bounds for asynchronous randomized consensus Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (155-164)
- Mostefaoui A, Raynal M and Travers C From renaming to set agreement Proceedings of the 14th international conference on Structural information and communication complexity, (66-80)
- Chalopin J, Godard E, Métivier Y and Tel G About the Termination Detection in the Asynchronous Message Passing Model Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (200-211)
- Attiya H, Ellen F and Fatourou P The complexity of updating multi-writer snapshot objects Proceedings of the 8th international conference on Distributed Computing and Networking, (319-330)
- Dolev S, Kat R and Schiller E When consensus meets self-stabilization Proceedings of the 10th international conference on Principles of Distributed Systems, (45-63)
- Hendler D and Kutten S Constructing shared objects that are both robust and high-throughput Proceedings of the 20th international conference on Distributed Computing, (428-442)
- Attiya H and Hillel E Built-in coloring for highly-concurrent doubly-linked lists Proceedings of the 20th international conference on Distributed Computing, (31-45)
- Brodsky A, Ellen F and Woelfel P Fully-adaptive algorithms for long-lived renaming Proceedings of the 20th international conference on Distributed Computing, (413-427)
- Guerraoui R, Kapałka M and Kouznetsov P The weakest failure detectors to boost obstruction-freedom Proceedings of the 20th international conference on Distributed Computing, (399-412)
- Mostefaoui A, Raynal M and Travers C Exploring gafni's reduction land Proceedings of the 20th international conference on Distributed Computing, (1-15)
- Fatourou P and Kallimanis N Single-scanner multi-writer snapshot implementations are fast! Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, (228-237)
- Parvédy P, Raynal M and Travers C Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures Proceedings of the 13th international conference on Structural Information and Communication Complexity, (182-196)
- Chlebus B, Kowalski D and Lingas A (2006). Performing work in broadcast networks, Distributed Computing, 18:6, (435-451), Online publication date: 1-Jun-2006.
- Fatourou P, Fich F and Ruppert E Time-space tradeoffs for implementations of snapshots Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (169-178)
- Bessani A, da Silva Fraga J and Lung L BTS Proceedings of the 2006 ACM symposium on Applied computing, (429-433)
- Attiya H, Hay D and Welch J Optimal clock synchronization under energy constraints in wireless ad-hoc networks Proceedings of the 9th international conference on Principles of Distributed Systems, (221-234)
- Bravetti M, Gorrieri R, Lucchi R and Zavattaro G (2005). Quantitative information in the tuple space coordination model, Theoretical Computer Science, 346:1, (28-57), Online publication date: 23-Nov-2005.
- Attiya H, Guerraoui R and Kouznetsov P Computing with reads and writes in the absence of step contention Proceedings of the 19th international conference on Distributed Computing, (122-136)
Index Terms
- Distributed Computing: Fundamentals, Simulations and Advanced Topics
Recommendations
Distributed Computing Education, Part 4: Training Infrastructure
Teaching distributed computing requires environments that provide adequate training infrastructure, or t-infrastructure. In practice, t-infrastructure includes the computing equipment, digital communications, software, data, and support staff necessary ...
Distributed computing research issues in grid computing
Ensembles of distributed, heterogeneous resources, or Computational Grids, have emerged as popular platforms for deploying large-scale and resource-intensive applications. Large collaborative efforts are currently underway to provide the necessary ...
Distributed Computing Education, Part 3: The Winter School Online Experience
The International Summer Schools in Grid Computing (ISSGC) have provided numerous international students with the opportunity to learn grid systems, as detailed in part 2 of this series (http://doi.ieeecomputersociety.org/10.1109/MDSO.2008.20). The ...