Search DCL publications with Infoscience
Our publications
Revisiting Ensembling in One-Shot Federated Learning
2024. 38th Annual Conference on Neural Information Processing Systems, Vancouver Convention Center, 2024-12-10 - 2024-12-15.PeerSwap: A Peer-Sampler with Randomness Guarantees
2024. The 43rd International Symposium on Reliable Distributed Systems, Charlotte, USA, 2024-09-30 - 2024-10-03.DSig: Breaking the Barrier of Signatures in Data Centers
2024. OSDI '24 - 18th USENIX Symposium on Operating Systems Design and Implementation, Santa Clara, California, USA, 2024-07-10 - 2024-07-12.Chop Chop: Byzantine Atomic Broadcast to the Network Limit
2024. 18th USENIX Symposium on Operating Systems Design and Implementation (OSDI'24), Santa Clara, CA, 2024-07-10 - 2024-07-12.Brief Announcement: A Case for Byzantine Machine Learning
2024. 43rd ACM Symposium on Principles of Distributed Computing, Nantes, France, 2024-06-17 - 2024-06-21. DOI : 10.1145/3662158.3662802.All Byzantine Agreement Problems Are Expensive
2024. 43rd ACM Symposium on Principles of Distributed Computing, Nantes, France, 2024-06-17 - 2024-06-21. p. 157 - 169. DOI : 10.1145/3662158.3662780.DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication
2024. 43rd ACM Symposium on Principles of Distributed Computing, Nantes, France, 2024-06-17 - 2024-06-21. p. 145 - 156. DOI : 10.1145/3662158.3662792.Generalized Bradley-Terry Models for Score Estimation from Paired Comparisons
2024. The 38th Annual AAAI Conference on Artificial Intelligence (AAAI-24), Vancouver, Canada, February 20-27, 2024. DOI : 10.1609/aaai.v38i18.30020.Planetary-Scale Byzantine Fault Tolerance
Lausanne, EPFL, 2024. DOI : 10.5075/epfl-thesis-9000.The Privacy Power of Correlated Noise in Decentralized Learning
2024. 41st International Conference on Machine Learning (ICML 2024), Vienna, Austria, July 21-27, 2024. DOI : 10.48550/arXiv.2405.01031.Robust Sparse Voting
2024. International Conference on Artificial Intelligence and Statistics (AISTATS), Valencia, Spain, 2024.Robust Machine Learning - Distributed Methods for Safe AI
Singapore: Springer.Robustness of gossip-based protocols
Lausanne, EPFL, 2024. DOI : 10.5075/epfl-thesis-10508.Epidemic Learning: Boosting Decentralized Learning with Randomized Communication
2023. 37th Conference on Neural Information Processing Systems (NeurIPS 2023), New Orleans, Louisiana, USA, December 10-16, 2023.Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!
Distributed Computing. 2023. DOI : 10.1007/s00446-023-00458-w.Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy
Ieee Transactions On Control Of Network Systems. 2023. DOI : 10.1109/TCNS.2023.3237489.Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity
2023. Thirty-seventh Conference on Neural Information Processing Systems, New Orleans, LA, USA, December 10-16, 2023.Efficacy of temporal and spatial abstraction for training accurate machine learning models: A case study in smart thermostats
Energy And Buildings. 2023. DOI : 10.1016/j.enbuild.2023.113377.PePTM: An Efficient and Accurate Personalized P2P Learning Algorithm for Home Thermal Modeling
Energies. 2023. DOI : 10.3390/en16186594.Byzantine Machine Learning: A Primer
Acm Computing Surveys. 2023. DOI : 10.1145/3616537.Robust Collaborative Learning with Linear Gradient Overhead
2023. International Conference on Machine Learning, Honolulu, Hawaii, USA, July 23-29, 2023. p. 9761 - 9813.Cross-chain payment protocols with success guarantees
Distributed Computing. 2023. DOI : 10.1007/s00446-023-00446-0.Leaderless consensus
Journal Of Parallel And Distributed Computing. 2023. DOI : 10.1016/j.jpdc.2023.01.009.Efficient and Accurate Peer-to-Peer Training of Machine Learning Based Home Thermal Models
2023. 14th ACM International Conference on Future Energy Systems (e-Energy), Orlando, FL, JUN 20-23, 2023. p. 524 - 529. DOI : 10.1145/3575813.3597453.DIABLO: A Benchmark Suite for Blockchains
2023. 18th European Conference on Computer Systems (EuroSys), Rome, ITALY, May 08-12, 2023. p. 540 - 556. DOI : 10.1145/3552326.3567482.uKharon: A Membership Service for Microsecond Applications
2023. 2022 USENIX Annual Technical Conference (USENIX ATC '22), Carlsbad, CA, USA, July 11–13, 2022.uBFT: Microsecond-Scale BFT using Disaggregated Memory
2023. 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2023), Vancouver, BC, Canada, March 25–29, 2023. p. 862 - 877. DOI : 10.1145/3575693.3575732.Reliable Microsecond-Scale Distributed Computing
Lausanne, EPFL, 2023. DOI : 10.5075/epfl-thesis-9909.Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity
2023.Impact of Redundancy on Resilience in Distributed Optimization and Learning
2023. 24th International Conference on Distributed Computing and Networking (ICDCN), Kharagpur, INDIA, JAN 04-07, 2023. p. 80 - 89. DOI : 10.1145/3571306.3571393.On the Strategyproofness of the Geometric Median
2023. 26th International Conference on Artificial Intelligence and Statistics (AISTATS), Valencia, Spain, April 25-27, 2023.On the Validity of Consensus
2023. 42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Orlando, FL, JUN 19-23, 2023. p. 332 - 343. DOI : 10.1145/3583668.3594567.Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search
2023. Genetic and Evolutionary Computation Conference (GECCO), Lisbon, PORTUGAL, JUL 15-19, 2023. p. 295 - 298. DOI : 10.1145/3583133.3590719.On the Privacy-Robustness-Utility Trilemma in Distributed Learning
Proceedings of the 40th International Conference on Machine Learning - Hawaii. 2023.Byzantine-Resilient Multi-Agent System
Ieee Transactions On Dependable And Secure Computing. 2022. DOI : 10.1109/TDSC.2021.3116488.Differentiated consistency for worldwide gossips
IEEE Transactions on Parallel and Distributed Systems. 2022. DOI : 10.1109/TPDS.2022.3209150.On the robustness of randomized classifiers to adversarial examples
Machine Learning. 2022. DOI : 10.1007/s10994-022-06216-6.An Equivalence Between Data Poisoning and Byzantine Gradient Attacks
2022. 38th International Conference on Machine Learning (ICML 2022), Baltimore, Maryland, USA, July 17-23, 2022. p. 6284 - 6323.Byzantine Machine Learning Made Easy By Resilient Averaging of Momentums
2022. 38th International Conference on Machine Learning (ICML 2022), Baltimore, Maryland, USA, July 17-23, 2022. p. 6246 - 6283.On the advantages of P2P ML on mobile devices
2022. 13th ACM International Conference on Future Energy Systems (e-Energy '22), Virtual Event, 28 June - 1 July, 2022. p. 338 - 353. DOI : 10.1145/3538637.3538863.On Preconditioning of Decentralized Gradient-Descent When Solving a System of Linear Equations
Ieee Transactions On Control Of Network Systems. 2022. DOI : 10.1109/TCNS.2022.3165089.The Universal Gossip Fighter
2022. 36th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2022), Online, May 30 – June 3, 2022. p. 1162 - 1172. DOI : 10.1109/IPDPS53621.2022.00116.Genuinely distributed Byzantine machine learning
Distributed Computing. 2022. DOI : 10.1007/s00446-022-00427-9.Removing Algorithmic Discrimination (With Minimal Individual Error)
Theoretical Computer Science. 2022. DOI : 10.1016/j.tcs.2022.04.051.Iterative pre-conditioning for expediting the distributed gradient-descent method: The case of linear least-squares problem
Automatica. 2022. DOI : 10.1016/j.automatica.2021.110095.The consensus number of a cryptocurrency (vol 35, pg 1, 2022)
Distributed Computing. 2022. DOI : 10.1007/s00446-022-00422-0.Democratizing Machine Learning
2022. 41st International Symposium on Reliable Distributed Systems (SRDS), Vienna, AUSTRIA, Sep 19-22, 2022. p. 94 - 120. DOI : 10.1109/SRDS55811.2022.00019.The consensus number of a cryptocurrency (extended version)
Distributed Computing. 2022. DOI : 10.1007/s00446-021-00399-2.Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use
2022. 2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks - Supplemental Volume (DSN-S), Baltimore, MD, USA, June 27-30, 2022. p. 11 - 14. DOI : 10.1109/DSN-S54099.2022.00014.The Road to a Universal Internet Machine
2022. 21st IEEE International Symposium on Parallel and Distributed Computing (ISPDC), Basel, SWITZERLAND, Jul 11-13, 2022. p. XIX - XIX.Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!
2022. 36th International Symposium on Distributed Computing (DISC 2022), Augusta, Georgia, USA, October 25-27, 2022. p. 1:11 - 1:19.As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
2022. 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Lyon, France, 30 May - 03 June, 2022. p. 560 - 570. DOI : 10.1109/IPDPS53621.2022.00061.Oracular Byzantine Reliable Broadcast
2022. 36th International Symposium on Distributed Computing (DISC 2022), Augusta, Georgia, USA, October 25-27, 2022. DOI : 10.4230/lipics.disc.2022.13.Crime and Punishment in Distributed Byzantine Decision Tasks
2022. 42nd IEEE International Conference on Distributed Computing Systems (ICDCS), Bologna, Italy, July 10-13, 2022. p. 34 - 44. DOI : 10.1109/ICDCS54860.2022.00013.Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)
2021. 35th Conference on Neural Information Processing Systems (NeurIPS 2021), Virtual, December 6-14, 2021.Probabilistic and temporal failure detectors for solving distributed problems
Journal Of Parallel And Distributed Computing. 2021. DOI : 10.1016/j.jpdc.2021.07.017.GARFIELD: System Support for Byzantine Machine Learning (Regular Paper)
2021. 2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Taipei, Taiwan, June 21-24, 2021. p. 39 - 51. DOI : 10.1109/DSN48987.2021.00021.Federated Learning Over Wireless Networks: Convergence Analysis and Resource Allocation
Ieee-Acm Transactions On Networking. 2021. DOI : 10.1109/TNET.2020.3035770.The Imitation Game: Algorithm Selection by Exploiting Black-Box Recommenders
2021. 8th International Conference (NETYS 2020), Marrakech, Morocco, June 3–5, 2020. p. 170 - 182. DOI : 10.1007/978-3-030-67087-0_11.Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?
2021. 40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), ELECTR NETWORK, Jul 26-30, 2021. p. 391 - 401. DOI : 10.1145/3465084.3467919.Leaderless Consensus
2021. 41st IEEE International Conference on Distributed Computing Systems (ICDCS), ELECTR NETWORK, Jul 07-10, 2021. p. 392 - 402. DOI : 10.1109/ICDCS51616.2021.00045.Further results on latent discourse models and word embeddings
Journal Of Machine Learning Research. 2021.Dynamic Byzantine Reliable Broadcast
2021. 24th International Conference on Principles of Distributed Systems (OPODIS 2020), Strasbourg, France (Virtual Conference), Decembre 14-16, 2020. DOI : 10.4230/lipics.opodis.2020.23.AKSEL: Fast Byzantine SGD
2021. 24th International Conference on Principles of Distributed Systems (OPODIS 2020), Strasbourg, France (Virtual Conference), Decembre 14-16, 2020. DOI : 10.4230/lipics.opodis.2020.8.Rational Agreement in the Presence of Crash Faults
2021. 4th IEEE International Conference on Blockchain (Blockchain), ELECTR NETWORK, Dec 06-08, 2021. p. 470 - 475. DOI : 10.1109/Blockchain53845.2021.00072.Distributed Momentum for Byzantine-resilient Stochastic Gradient Descent
2021. 9th International Conference on Learning Representations (ICLR), virtual conference, May 4-8, 2021.Differentially Private Stochastic Coordinate Descent
2021. 35th AAAI Conference on Artificial Intelligence / 33rd Conference on Innovative Applications of Artificial Intelligence / 11th Symposium on Educational Advances in Artificial Intelligence, Virtual Conference, February 2–9, 2021. p. 7176 - 7184. DOI : 10.1609/aaai.v35i8.16882.Mixed Nash Equilibria in the Adversarial Examples Game
2021. 38th International Conference on Machine Learning (ICML 2021), Online, July 18-24, 2021. p. 7677 - 7687.Byzantine Fault-Tolerance in Decentralized Optimization under 2f-Redundancy
2021. American Control Conference (ACC), ELECTR NETWORK, May 25-28, 2021. p. 3632 - 3637. DOI : 10.23919/ACC50511.2021.9483067.Byzantine Fault-Tolerant Distributed Machine Learning with Norm-Based Comparative Gradient Elimination
2021. 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), ELECTR NETWORK, Jun 21-24, 2021. p. 175 - 181. DOI : 10.1109/DSN-W52860.2021.00037.NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization
Journal Of Machine Learning Research. 2021.Science Communication Desperately Needs More Aligned Recommendation Algorithms
Frontiers In Communication. 2020. DOI : 10.3389/fcomm.2020.598454.FeGAN: Scaling Distributed GANs
2020. 21st International Middleware Conference, Delft, Netherlands, December 7-11, 2020. p. 193 - 206. DOI : 10.1145/3423211.3425688.Efficient Multi-Word Compare and Swap
2020. 34th International Symposium on Distributed Computing (DISC 2020), October 12-16, 2020. DOI : 10.4230/LIPIcs.DISC.2020.4.Fast and Robust Distributed Learning in High Dimension
2020. IEEE 39th International Symposium on Reliable Distributed Systems (SRDS 2020), Shanghai, China, September 21-24, 2020. p. 71 - 80. DOI : 10.1109/SRDS51746.2020.00015.The Cost of Scaling a Reliable Interconnection Topology
Ieee Transactions On Dependable And Secure Computing. 2020. DOI : 10.1109/TDSC.2018.2845402.Genuinely Distributed Byzantine Machine Learning
2020. The ACM Symposium on Principles of Distributed Computing (PODC), Salerno, Italy, August 3–7, 2020. DOI : 10.1145/3382734.3405695.DELF: Safeguarding deletion correctness in Online Social Networks
2020. 29th USENIX Security Symposium, ELECTR NETWORK, Aug 12-14, 2020. p. 1057 - 1074.Robust Distributed Learning
Lausanne, EPFL, 2020. DOI : 10.5075/epfl-thesis-7218.Private and Secure Distributed Learning
Lausanne, EPFL, 2020. DOI : 10.5075/epfl-thesis-7096.The Impossibility of Fast Transactions
2020. 34th IEEE International Parallel and Distributed Processing Symposium (IPDPS), ELECTR NETWORK, May 18-22, 2020. p. 1143 - 1154. DOI : 10.1109/IPDPS47924.2020.00120.Robust P2P Personalized Learning
2020. 39th International Symposium on Reliable Distributed Systems (SRDS), Shanghai, PEOPLES R CHINA, Sep 21-24, 2020. p. 299 - 308. DOI : 10.1109/SRDS51746.2020.00037.Microsecond Consensus for Microsecond Applications
2020. 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI), ELECTR NETWORK, Nov 04-06, 2020. p. 599 - 616.Byzantine machine learning
WO2020011361 . 2020.The Hidden Complexity of Distributed Systems
Lausanne, EPFL, 2020. DOI : 10.5075/epfl-thesis-8271.Distributed Computing with Modern Shared Memory
Lausanne, EPFL, 2020. DOI : 10.5075/epfl-thesis-7141.Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols
2020. 34th International Symposium on Distributed Computing (DISC 2020), October 15, 2020. DOI : 10.4230/lipics.disc.2020.8.The Performance of Byzantine Fault Tolerant Blockchains
2020. IEEE 19th International Symposium on Network Computing and Applications (NCA), ELECTR NETWORK, Nov 24-27, 2020. DOI : 10.1109/NCA51143.2020.9306742.Online Payments by Merely Broadcasting Messages
2020. 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Valencia, Spain, June 29th, July 2nd 2020. DOI : 10.1109/DSN48063.2020.00023.Thread-Placement Learning
2020. 40th IEEE International Conference on Distributed Computing Systems (ICDCS), ELECTR NETWORK, Nov 29-Dec 01, 2020. p. 877 - 887. DOI : 10.1109/ICDCS47774.2020.00050.Smaller, Faster & Lighter KNN Graph Constructions
2020. The Web Conference 2020, April 2020. p. 1060 - 1070. DOI : 10.1145/3366423.3380184.FLeet: Online Federated Learning via Staleness Awareness and Performance Prediction
2020. Middleware '20: 21st International Middleware Conference, Delft, Netherlands (online), December, 2020. p. 163 - 177. DOI : 10.1145/3423211.3425685.The weakest failure detector for eventual consistency
Distributed Computing. 2019. DOI : 10.1007/s00446-016-0292-9.Le fabuleux chantier: Rendre l’intelligence artificielle robustement bénéfique
EDP Sciences.Exploring The Borderlands Of The Gathering Problem
Bulletin of The European Association for Theoretical Computer Science. 2019.A hybrid niobium-based oxide with bio-based porous carbon as an efficient electrocatalyst in photovoltaics: a general strategy for understanding the catalytic mechanism
Journal Of Materials Chemistry A. 2019. DOI : 10.1039/c9ta03540k.AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation
2019. The Conference on Systems and Machine Learning (SysML), 2019, Stanford, CA, USA, March 31 - April 2, 2019.Adaptive and Scalable Communication Networks
Proceedings of the IEEE. 2019. DOI : 10.1109/JPROC.2019.2904751.Lock-Unlock: Is That All? A Pragmatic Analysis of Locking in Software Systems
Acm Transactions On Computer Systems. 2019. DOI : 10.1145/3301501.Scalable Byzantine Reliable Broadcast
2019. 33rd International Symposium on Distributed Computing (DISC 2019), Budapest, Hungary, October 14-18, 2019. p. 22:1 - 22:16. DOI : 10.4230/LIPIcs.DISC.2019.22.SBFT: a Scalable and Decentralized Trust Infrastructure
2019. 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Portland, OR, Jun 24-27, 2019. p. 568 - 580. DOI : 10.1109/DSN.2019.00063.Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores
2019. 16th USENIX Symposium on Networked Systems Design and Implementation, Boston, MA, Feb 26-28, 2019. p. 79 - 93.Fast General Distributed Transactions with Opacity
2019. ACM SIGMOD International Conference on Management of Data (SIGMOD), Amsterdam, NETHERLANDS, Jun 30-Jul 05, 2019. p. 433 - 448. DOI : 10.1145/3299869.3300069.System Support for Efficient Replication in Distributed Systems
Lausanne, EPFL, 2019. DOI : 10.5075/epfl-thesis-9548.Scaling Byzantine Fault Tolerance
Lausanne, EPFL, 2019. DOI : 10.5075/epfl-thesis-9605.Utility and privacy effects of a user action in a communication system
EP3435314 . 2019.The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live
Journal Of The Acm. 2019. DOI : 10.1145/3266141.Unified and Scalable Incremental Recommenders with Consumed Item Packs
2019. Euro-Par 2019 : European Conference on Parallel Processing, Göttingen, Germany, August 26–30, 2019. p. 227 - 240. DOI : 10.1007/978-3-030-29400-7_17.The Impact of RDMA on Agreement
2019. PODC '19: ACM Symposium on Principles of Distributed Computing, Toronto, Canada, July, 2019. p. 409 - 418. DOI : 10.1145/3293611.3331601.Byzantine tolerant gradient descent for distributed machine learning with adversaries
US2020380340 ; WO2019105543 . 2019.The Consensus Number of a Cryptocurrency
2019. 38th ACM Symposium on Principles of Distributed Computing (PODC), Toronto, CANADA, Jul 29-Aug 02, 2019. p. 307 - 316. DOI : 10.1145/3293611.3331589.Distributed Transactional Systems Cannot Be Fast
2019. The 31st ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '19, Phoenix, AZ, USA, June 22 - 24, 2019. p. 369 - 380. DOI : 10.1145/3323165.3323189.Fingerprinting Big Data: The Case of KNN Graph Construction
2019. 2019 IEEE 35th International Conference on Data Engineering (ICDE), Macao, Macao, Macao, April 8-11 2019. p. 1738 - 1741. DOI : 10.1109/ICDE.2019.00186.The Fake News Vaccine
2019. 7th International Conference on Networked Systems. NETYS 2019, Marrakech, Morocco, June 19–21, 2019. p. 347 - 364. DOI : 10.1007/978-3-030-31277-0_23.Virtuously Safe Reinforcement Learning (Master Thesis version)
2018Causal Consistency and Latency Optimality: Friend or Foe?
Proceedings Of The Vldb Endowment. 2018. DOI : 10.14778/3236187.3236210.Monotonic Prefix Consistency in Distributed Systems
2018. 38th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Madrid, Spain, June 18-20, 2018. DOI : 10.1007/978-3-319-92612-4_3.Personalized and Private Peer-to-Peer Machine Learning
2018. AISTATS.Giant multiphoton absorption for THz resonances in silicon hydrogenic donors
Nature Photonics. 2018. DOI : 10.1038/s41566-018-0111-x.Passing Messages while Sharing Memory
2018. 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Egham, ENGLAND, Jul 23-27, 2018. p. 51 - 60. DOI : 10.1145/3212734.3212741.The Complexity of Reliable and Secure Distributed Transactions
Lausanne, EPFL, 2018. DOI : 10.5075/epfl-thesis-8761.Closing the Performance Gap Between Volatile and Persistent Key-Value Stores Using Cross-Referencing Logs
2018. USENIX Annual Technical Conference (ATC), Boston, MA, Jul 11-13, 2018. p. 967 - 979.Deep Learning Works in Practice. But Does it Work in Theory?
2018On the Unfairness of Blockchain
2018. NETYS 2018, Essaouira, Morocco, May 9, 2018 - May 11, 2018. p. 36 - 50. DOI : 10.1007/978-3-030-05529-5_3.The Hidden Vulnerability of Distributed Learning in Byzantium
2018. International Conference on Machine Learning, Stockholm, Sweden, July 10-15, 2018.Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning
Lausanne, EPFL, 2018. DOI : 10.5075/epfl-thesis-8843.Log-Free Concurrent Data Structures
2018. USENIX Annual Technical Conference (ATC), Boston, MA, Jul 11-13, 2018. p. 373 - 385.The Inherent Cost of Remembering Consistently
2018. 30th ACM Symposium on Parallelism in Algorithms and Architectures, Vienna, Austria, July 16 - 18, 2018. p. 259 - 269. DOI : 10.1145/3210377.3210400.Brief Announcement: Persistent Multi-Word Compare-and-Swap
2018. 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Egham, ENGLAND, Jul 23-27, 2018. p. 37 - 39. DOI : 10.1145/3212734.3212783.Asynchronous Byzantine Machine Learning (the case of SGD)
2018. 35th International Conference on Machine Learning, Stockholm, SWEDEN, July 10-15, 2018. p. 1145 - 1154.SPADE: Tuning scale-out OLTP on modern RDMA clusters
2018. 19th International Middleware Conference on - Middleware '18, Rennes, France, December, 2018. p. 80 - 93. DOI : 10.1145/3274808.3274815.Locking Timestamps versus Locking Objects
2018. 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Egham, ENGLAND, Jul 23-27, 2018. p. 367 - 376. DOI : 10.1145/3212734.3212742.TM 2 C: a software transactional memory for many-cores
Distributed Computing. 2018. DOI : 10.1007/s00446-017-0310-6.Log-Free Concurrent Data Structures
2018. 2018 USENIX Annual Technical Conference, BOSTON, MA, USA, JULY 11–13, 2018.Privacy in Recommender Systems
Lausanne, EPFL, 2018. DOI : 10.5075/epfl-thesis-8797.Towards Scalable Personalization
Lausanne, EPFL, 2018. DOI : 10.5075/epfl-thesis-8299.The entropy of a distributed computation random number generation from memory interleaving
DISTRIBUTED COMPUTING. 2018. DOI : 10.1007/s00446-017-0311-5.Collaborative Filtering Under a Sybil Attack: Similarity Metrics do Matter!
2018. 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Luxembourg City, LUXEMBOURG, Jun 25-28, 2018. p. 466 - 477. DOI : 10.1109/DSN.2018.00055.The Utility and Privacy Effects of a Click
2017. SIGIR, Shinjuku, Tokyo, Japan, August 7-11, 2017. p. 665 - 674. DOI : 10.1145/3077136.3080783.TRIAD: creating synergies between memory, disk and log in log structured key-value stores
2017. USENIX ATC, Santa Clara, CA, USA, July 12-14, 2017.FloDB: Unlocking Memory in Persistent Key-Value Stores
2017. EuroSys, Belgrade, Serbia, April 23-26, 2017. DOI : 10.1145/3064176.3064193.Universally Scalable Concurrent Data Structures
Lausanne, EPFL, 2017. DOI : 10.5075/epfl-thesis-7993.How Fast can a Distributed Transaction Commit?
2017. the 36th ACM SIGMOD-SIGACT-SIGAI Symposium, Chicago, Illinois, USA, May 14-19, 2017. p. 107 - 122. DOI : 10.1145/3034786.3034799.On The Robustness of a Neural Network
2017. 36th IEEE International Symposium on Reliable Distributed Systems, Hong Kong, September 26-29, 2017. p. 84 - 93. DOI : 10.1109/SRDS.2017.21.On verifying causal consistency
2017. 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017), Paris, France, January, 15-21, 2017. p. 626 - 638. DOI : 10.1145/3009837.3009888.Brief Announcement: Byzantine-Tolerant Machine Learning
2017. Principles Of Distributed Computing, Washington D.C, USA, July, 2017. DOI : 10.1145/3087801.3087861.Sequential Proximity: Towards Provably Scalable Concurrent Search Algorithms
2017. Networked Systems: 5th International Conference, Marrakech, Morocco, May 17-19, 2017. p. 405 - 420. DOI : 10.1007/978-3-319-59647-1_30.ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications
ACM Transactions on Parallel Computing. 2017. DOI : 10.1145/3108137.Abstracting Multi-Core Topologies with MCTOP
2017. Twelfth European Conference on Computer Systems (EuroSys '17), Belgrade, Serbia, April 23-26, 2017. p. 544 - 559. DOI : 10.1145/3064176.3064194.Elastic transactions
Journal Of Parallel And Distributed Computing. 2017. DOI : 10.1016/j.jpdc.2016.10.010.Capturing the Moment: Lightweight Similarity Computations
2017. 2017 IEEE 33rd International Conference on Data Engineering (ICDE), San Diego, CA, USA, 19-22 April 2017. p. 747 - 758. DOI : 10.1109/ICDE.2017.126.The Disclosure Power of Shared Objects
2017. NETYS 2017, Marrakech, Morocco, May 17-19, 2017. DOI : 10.1007/978-3-319-59647-1_17.Heterogeneous Recommendations: What You Might Like To Read After Watching Interstellar
2017. PVLDB, Munich, Germany, August 28 - 31, 2017. p. 1070 - 1081. DOI : 10.14778/3115404.3115412.Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
2016. 28th ACM Symposium on Parallelism in Algorithms and Architectures, Pacific Grove, California, USA, SPAA’16, July 11–13, 2016. p. 337 - 348. DOI : 10.1145/2935764.2935774.Optimistic Concurrency with OPTIK
2016. 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16, Barcelona, Spain, 12-16 03 2016. DOI : 10.1145/2851141.2851146.Reliable and Real-Time Distributed Abstractions
Lausanne, EPFL, 2016. DOI : 10.5075/epfl-thesis-7289.Frugal Topology Construction for Stream Aggregation in the Cloud
2016. 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, USA. DOI : 10.1109/INFOCOM.2016.7524534.Collision-Free Pattern Formation
2016. OPODIS 2016.Optimal Fair Computation
2016. 30th International Symposium on Distributed Computing, DISC 2016, Paris, France, September 27-29, 2016. p. 143 - 157. DOI : 10.1007/978-3-662-53426-7_11.ESTIMA: Extrapolating ScalabiliTy of In-Memory Applications
2016. 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Barcelona, Spain, March 12-16, 2016. p. 27:1 - . DOI : 10.1145/2851141.2851159.Locking Made Easy
2016. 17th ACM/IFIP/USENIX International Middleware Conference (Middleware '16), Trento, Italy, December 12-16, 2016. p. 1 - 14. DOI : 10.1145/2988336.2988357.Right On Time Distributed Shared Memory
2016. IEEE Real-Time Systems Symposium, Porto, 2016. p. 315 - 326. DOI : 10.1109/RTSS.2016.038.Incremental Consistency Guarantees for Replicated Objects
2016. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI ’16), Savannah, GA, USA, November 2–4, 2016. p. 169 - 184.Trade-offs in Replicated Systems
IEEE Data Engineering Bulletin. 2016.Fast and Robust Memory Reclamation for Concurrent Data Structures
2016. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '16), Pacific Grove, California, USA, July 11 - 13, 2016. DOI : 10.1145/2935764.2935790.Unlocking Energy
2016. 2016 USENIX Annual Technical Conference, Denver, Colorado, USA, June 22-24, 2016. p. 393 - 406.Towards Scalable Synchronization on Multi-Cores
Lausanne, EPFL, 2016. DOI : 10.5075/epfl-thesis-7246.WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems
2016. 35th IEEE International Symposium on Reliable Distributed Systems Workshops (SRDSW), Budapest, HUNGARY, SEP 26-29, 2016. p. 167 - 176. DOI : 10.1109/Srds.2016.27.Never Say Never Probabilistic & Temporal Failure Detectors
2016. 30th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Illinois Inst Technol, Chicago, IL, MAY 23-27, 2016. p. 679 - 688. DOI : 10.1109/Ipdps.2016.92.Atum: Scalable Group Communication Using Volatile Groups
2016. 17th International Middleware Conference, Trento, Italy, 12-16 December 2016. p. 1 - 14. DOI : 10.1145/2988336.2988356.ProteusTM: Abstraction Meets Performance in Transactional Memory
2016. 21st International Conference on Architectural Support for Programming Languages and Operating Systems, Atlanta, GA, APR 02-06, 2016. p. 757 - 771. DOI : 10.1145/2872362.2872385.Privacy-preserving distributed collaborative filtering
Computing. 2016. DOI : 10.1007/s00607-015-0451-z.Byzantine Fireflies
2015. 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015. p. 47 - 59. DOI : 10.1007/978-3-662-48653-5_4.Byzantine Fireflies
2015. Distributed computing (DISC), Tokyo, Japan, October 7-9, 2015. p. 47 - 59. DOI : 10.1007/978-3-662-48653-5_4.Safety, Liveness and Parallelism in Concurrent Computing
Lausanne, EPFL, 2015. DOI : 10.5075/epfl-thesis-6758.Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures
2015. Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Istanbul, Turkey, March 14–18, 2015. DOI : 10.1145/2694344.2694359.Special issue on NETYS selected papers
Computing. 2015. DOI : 10.1007/s00607-015-0466-5.The Weakest Failure Detector for Eventual Consistency
2015. the 2015 ACM Symposium, Donostia-San Sebastian, Spain, July 21-23, 2015. p. 375 - 384. DOI : 10.1145/2767386.2767404.Making BFT Protocols Really Adaptive
2015. 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Hyderabad, May 25-29, 2015. p. 904 - 913. DOI : 10.1109/IPDPS.2015.21.To Transmit Now or Not to Transmit Now
2015. 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS). p. 246 - 255. DOI : 10.1109/SRDS.2015.26.Techniques for Identifying Elusive Corner-Case Bugs in Systems Software
Lausanne, EPFL, 2015. DOI : 10.5075/epfl-thesis-6735.Safety-Liveness Exclusion in Distributed Computing
2015. ACM Symposium on Principles of Distributed Computing. DOI : 10.1145/2767386.2767401.D2P: Distance-Based Differential Privacy in Recommenders
VLDB Endowment. 2015. DOI : 10.14778/2757807.2757811.The Next 700 BFT Protocols
ACM Transactions on Computer Systems. 2015. DOI : 10.1145/2658994.A Thrifty Universal Construction
2015. NETYS, Agadir, Morocco. p. 444 - 455. DOI : 10.1007/978-3-319-26850-7_30.Distributed Algorithms
Computing Handbook, Third Edition; CRC Press, 2014.Tight Bounds for Asynchronous Renaming
Journal of The ACM. 2014. DOI : 10.1145/2597630.Systematic Approach to Multi-layer Parallelisation of Time-based Stream Aggregation under Ingest Constraints in the Cloud
2014Modularity in the design of robust distributed algorithms
EPFL, 2014. DOI : 10.5075/epfl-thesis-6085.Inferring Scalability from Program Pseudocode
Lausanne, EPFL, 2014. DOI : 10.5075/epfl-thesis-6219.The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.
2014. 26th ACM Symposium on Parallelism in Algorithms and Architectures, Prague, Czech Republic, June 23 - 25, 2014. DOI : 10.1145/2612669.2612690.A paradox of eventual linearizability in shared memory
2014. the 2014 ACM symposium, Paris, France, 15-18 07 2014. p. 40 - 49. DOI : 10.1145/2611462.2611484.Consensus inside
2014. the 15th International Middleware Conference, Bordeaux, France, 08-12 December 2014. p. 145 - 156. DOI : 10.1145/2663165.2663321.Linearizability Is Not Always a Safety Property
2014. Second International Conference, NETYS, Marrakech, Morocco, May 15-17, 2014. p. 57 - 69. DOI : 10.1007/978-3-319-09581-3_5.Finding Trojan Message Vulnerabilities in Distributed Systems
2014. 19th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Salt Lake City, Utah, USA, March 1-5, 2014. DOI : 10.1145/2541940.2541984.Reusable Concurrent Data Types
2014. 28th European Conference on Object-Oriented Programming (ECOOP), Uppsala, Sweden, July 28 – August 1, 2014. DOI : 10.1007/978-3-662-44202-9_8.Disjoint-Access Parallelism Does Not Entail Scalability
2014. Second International Conference, NETYS, Marrakech, Morocco, May 15-17, 2014. p. 41 - 56. DOI : 10.1007/978-3-319-09581-3_4.Democratizing Transactional Programming
Communications Of The Acm. 2014. DOI : 10.1145/2541883.2541900.Computing in social networks
Information And Computation. 2014. DOI : 10.1016/j.ic.2013.11.001.Tracking freeriders in gossip-based content dissemination systems
Computer Networks. 2014. DOI : 10.1016/j.comnet.2014.02.023.Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network
Acm Transactions On Internet Technology. 2014. DOI : 10.1145/2602572.HyRec: leveraging browsers for scalable recommenders
2014. 15th International Middleware Conference, Bordeaux, France, December 8-18, 2014. p. 85 - 96. DOI : 10.1145/2663165.2663315.Privacy-Preserving Distributed Collaborative Filtering
2014. Second International Conference, NETYS, Marrakech, Morocco, May 15-17, 2014. p. 169 - 184. DOI : 10.1007/978-3-319-09581-3_12.Asynchronous Gossip
Journal of The ACM. 2013. DOI : 10.1145/2450142.2450147.A Distributed Polling with Probabilistic Privacy
2013. IEEE 32nd International Symposium on Reliable Distributed Systems, Braga, Portugal, September 30-October 03, 2013. DOI : 10.1109/SRDS.2013.13.Fast Byzantine Agreement
2013. 2013 ACM symposium on Principles of distributed computing, Montreal, Canada, July 22-24, 2013. p. 57 - 64. DOI : 10.1145/2484239.2484243.Implementation of a Distributed Computation Framework
IC Research Days 2015, EPFL, Lausanne, Switzerland, June 30, 2015.Composing Relaxed Transactions
2013. 27th IEEE International Parallel & Distributed Processing Symposium (IPDPS'13), Boston, Massachusetts USA, May 20-24, 2013. p. 1171 - 1182. DOI : 10.1109/IPDPS.2013.42.Introducing Speculation in Self-Stabilization: An Application to Mutual Exclusion
2013. p. 290 - 298. DOI : 10.1145/2484239.2484246.Everything You Always Wanted to Know about Synchronization but Were Afraid to Ask
2013. p. 33 - 48. DOI : 10.1145/2517349.2522714.Highly Dynamic Distributed Computing with Byzantine Failures
2013. p. 176 - 183. DOI : 10.1145/2484239.2484263.Byzantine Agreement with Homonyms
2013. 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC). p. 321 - 340. DOI : 10.1007/s00446-013-0190-3.WHATSUP: A Decentralized Instant News Recommender
2013. p. 741 - 752. DOI : 10.1109/IPDPS.2013.47.STM in the Small: Trading Generality for Performance in Software Transactional Memory
2012. 7th ACM European conference on Computer systems, Bern, Switzerland, April 11-13, 2012. p. 1 - 14. DOI : 10.1145/2168836.2168838.On the liveness of transactional memory
2012. 31st ACM Symposium on Principles of Distributed Computing, Madeira, Portugal, 16-18 07 2012. DOI : 10.1145/2332432.2332435.A High-Throughput Byzantine Fault-Tolerant Protocol
Lausanne, EPFL, 2012. DOI : 10.5075/epfl-thesis-5242.Generating Fast Indulgent Algorithms
Theory Of Computing Systems. 2012. DOI : 10.1007/s00224-012-9407-2.Speculative Linearizability
Acm Sigplan Notices. 2012. DOI : 10.1145/2254064.2254072.Efficient graph planarization in sensor networks and local routing algorithm
2012. 8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN. p. 140 - 149. DOI : 10.1109/Dcoss.2012.64.Abortable Linearizable Modules
Archive of Formal Proofs. 2012.Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Algorithmica. 2012. DOI : 10.1007/s00453-011-9581-7.On the Performance of Software Transactional Memory
Lausanne, EPFL, 2012. DOI : 10.5075/epfl-thesis-5386.A Distributed Algorithm for Computing the Node Search Number in Trees
Algorithmica. 2012. DOI : 10.1007/s00453-011-9524-3.Randomized versus Deterministic Implementations of Concurrent Data Structures
Lausanne, EPFL, 2012. DOI : 10.5075/epfl-thesis-5447.Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Algorithmica. 2012. DOI : 10.1007/s00453-011-9581-7.On the efficiency of routing in sensor networks
Journal Of Parallel And Distributed Computing. 2012. DOI : 10.1016/j.jpdc.2012.02.021.A Speculation-Friendly Binary Search Tree
Acm Sigplan Notices. 2012. DOI : 10.1145/2370036.2145837.The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit
Siam Journal On Computing. 2012. DOI : 10.1137/070698877.On the cost of composing shared-memory algorithms
2012. Proceedinbgs of the 24th ACM symposium, Pittsburgh, Pennsylvania, USA, 25-27 06 2012. DOI : 10.1145/2312005.2312057.Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
2012. 19th International Colloquium, SIROCCO, Reykjavik, Iceland, June 30-July 2, 2012. p. 195 - 206. DOI : 10.1007/978-3-642-31104-8_17.Special section with selected papers from PODC 2010
2012. 29th Annual ACM Symposium on Principles of Distributed Computing, PODC, Zurich, Switzerland, July 25-28, 2010. p. 163 - 163. DOI : 10.1007/s00446-012-0166-8.Unifying Thread-Level Speculation and Transactional Memory
2012. p. 187 - 207. DOI : 10.1007/978-3-642-35170-9_10.How to Allocate Tasks Asynchronously
2012. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), New Brunswick, NJ, USA, October 20-23, 2012. p. 331 - 340. DOI : 10.1109/FOCS.2012.41.TM2C: A software transactional memory for many-cores
2012. EuroSys, Bern, Switzerland, April 10-13, 2012. p. 351 - 364. DOI : 10.1145/2168836.2168872.Scalable and Secure Polling in Dynamic Distributed Networks
2012. 31st IEEE International Symposium on Reliable Distributed Systems, Irvine, California, October 8-11, 2012. DOI : 10.1109/SRDS.2012.63.Decentralized polling with respectable participants
Journal Of Parallel And Distributed Computing. 2012. DOI : 10.1016/j.jpdc.2011.09.003.The impossibility of boosting distributed service resilience
Information and Computation. 2011. DOI : 10.1016/j.ic.2010.07.005.Brief Announcement: Transaction Polymorphism
2011. 23rd Annual Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, Jun 04-06, 2011. p. 311 - 312. DOI : 10.1145/1989493.1989544.Émulation de mémoire partagée en environnements distribués dynamiques
Technique et Science Informatiques. 2011. DOI : 10.3166/tsi.30.809-839.Model Checking of Distributed Algorithm Implementations
Lausanne, EPFL, 2011. DOI : 10.5075/epfl-thesis-4858.The Complexity of Renaming
2011. Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, Palm Springs, CA, USA, 22-25 Oct. 2011. DOI : 10.1109/FOCS.2011.66.The Complexity Of Early Deciding Set Agreement
Siam Journal On Computing. 2011. DOI : 10.1137/050640746.On The Power of Hardware Transactional Memory to Simplify Memory Management
2011. 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, San Jose, California, USA, June 6-8, 2011. p. 99 - 108. DOI : 10.1145/1993806.1993821.Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated
2011. ACM POPL 2011, Austin, Texas, USA, January 26–28, 2011. DOI : 10.1145/1925844.1926442.The Failure Detector Abstraction
ACM Computing Surveys. 2011. DOI : 10.1145/1883612.1883616.Why STM can be more than a Research Toy
Communications of the ACM. 2011. DOI : 10.1145/1924421.1924440.Sub-Logarithmic Test-and-Set Against a Weak Adversary
2011. 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. p. 97 - 109. DOI : 10.1007/978-3-642-24100-0_7.Automated Vulnerability Discovery in Distributed Systems
2011. 7th Workshop on Hot Topics in System Dependability (HotDep), Hong Kong, China, 2011.The disagreement power of an adversary
Distributed Computing. 2011. DOI : 10.1007/s00446-010-0122-4.Verification of STM on relaxed memory models
Formal Methods In System Design. 2011. DOI : 10.1007/s10703-011-0131-3.Optimal-Time Adaptive Strong Renaming, with Applications to Counting
2011. p. 239 - 248. DOI : 10.1145/1993806.1993850.Atomic boxes: coordinated exception handling with transactional memory
2011. ECOOP, Lancaster, Uk, July 25-29, 2011. p. 634 - 657. DOI : 10.1007/978-3-642-22655-7_29.Model Checking a Networked System Without the Network
2011. 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11), Boston, Massachusetts, USA, March 30-April 1, 2011. p. 225 - 238.Introduction to Reliable and Secure Distributed Programming
Springer.Generalized Universality
2011. 22nd International Conference, CONCUR, Aachen, Germany, September 6-9, 2011. p. 17 - 27. DOI : 10.1007/978-3-642-23217-6_2.The complexity of robust atomic storage
2011. the 30th annual ACM SIGACT-SIGOPS symposium, San Jose, California, USA, 06-08 06 2011. DOI : 10.1145/1993806.1993816.Laws of order
2011. 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Austin, USA, January 26-28, 2011. DOI : 10.1145/1925844.1926442.Generating Fast Indulgent Algorithms
2011. 12th International Conference on Distributed Computing and Networking (ICDCN 2011). DOI : 10.1007/978-3-642-17679-1_4.Democratizing Transactional Programming
2011. Middleware 11, Lisbon, Dec. 12-16, 2011. p. 1 - 19. DOI : 10.1007/978-3-642-25821-3_1.Collaborative Personalized Top-k Processing
ACM Transactions on Database Systems. 2011. DOI : 10.1145/2043652.2043659.Byzantine agreement with homonyms
2011. the 30th annual ACM SIGACT-SIGOPS symposium, San Jose, California, USA, 06-08 06 2011. DOI : 10.1145/1993806.1993810.Fast Access to Distributed Atomic Memory
SIAM Journal on Computing. 2010. DOI : 10.1137/090757010.The Next 700 BFT Protocols
2010. 5th ACM EuroSys Conference, Paris, France, April 13-16, 2010. p. 363 - 376. DOI : 10.1145/1755913.1755950.Throughput Optimal Total Order Broadcast for Cluster Environments
ACM Transactions on Computer Systems. 2010. DOI : 10.1145/1813654.1813656.How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
2010. 37th International Colloquium on Automata, Languages and Programming (ICALP), Bordeaux, France, July 5-10, 2010. p. 115 - 126. DOI : 10.1007/978-3-642-14162-1_10.Collaborative Scoring with Dishonest Participants
2010. 22nd ACM Symposium on Parallelism in Algorithms and Architectures. p. 41 - 49. DOI : 10.1145/1810479.1810488.Foundations of Speculative Distributed Computing (Invited Lecture Extended Abstract)
2010. 24th International Symposium on Distributed Computing, Cambridge, MA, Sep 13-15, 2010. p. 204 - 205. DOI : 10.1007/978-3-642-15763-9_21.Concurrent Multipath Transferring in IP Networks: Two IP-level solutions for TCP and UDP
VDM Verlag.Reflexes: Abstractions for Integrating Highly Responsive Tasks into Java Applications
ACM Transactions on Embedded Computing Systems. 2010. DOI : 10.1145/1814539.1814543.Tight Failure Detection Bounds on Atomic Object Implementations
Journal of the ACM. 2010. DOI : 10.1145/1734213.1734216.Composition vs Concurrency
2nd Workshop on the Theory of Transactional Memory, Cambridge, Massachusetts, USA, September 16, 2010.On the Input Acceptance of Transactional Memory
Parallel Processing Letters. 2010. DOI : 10.1142/S0129626410000041.Extensible Transactional Memory Testbed
Journal of Parallel and Distributed Computing - Special Issue on Transactional Memory. 2010. DOI : 10.1016/j.jpdc.2010.02.008.Independent Faults in the Cloud
The 4th ACM SIGOPS/SIGACT Workshop on Large Scale Distributed Systems and Middleware (LADIS'10), Zurich, Switzerland, July 28-29, 2010.Transactional memory, linking theory and practice
ACM SIGACT News. 2010. DOI : 10.1145/1907450.1907546.Securing Every Bit: Authenticated Broadcast in Radio Networks
2010. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Santorini, Greece, 13-15 June, 2010. p. 50 - 59. DOI : 10.1145/1810479.1810489.Model checking transactional memories
Distributed Computing. 2010. DOI : 10.1007/s00446-009-0092-6.Transactions in the Jungle
2010. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13–15, 2010. p. 263 - 272. DOI : 10.1145/1810479.1810529.A Provably Starvation-Free Distributed Directory Protocol
2010. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, New York, NY, USA, September 20-22, 2010. p. 405 - 419. DOI : 10.1007/978-3-642-16023-3_33.Refined quorum systems
Distributed Computing. 2010. DOI : 10.1007/s00446-010-0103-7.Fast Randomized Test-and-Set and Renaming
2010. International Symposium on Distributed Computing (DISC), Boston, Massachusetts, USA, September 13-15. p. 94 - 108. DOI : 10.1007/978-3-642-15763-9_9.Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?
6th Workshop on Hot Topics in System Dependability (HotDep), Vancouver, Canada, October 2010.Leveraging Parallel Nesting in Transactional Memory
2010. 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Bangalore, India, January 9-14, 2010. p. 91 - 100. DOI : 10.1145/1693453.1693466.The VELOX Transactional Memory Stack
IEEE Micro. 2010. DOI : 10.1109/MM.2010.80.Live Streaming with Gossip
Lausanne, EPFL, 2010. DOI : 10.5075/epfl-thesis-4777.Theory of Transactional Memory
Lausanne, EPFL, 2010. DOI : 10.5075/epfl-thesis-4664.Predicting the Scalability of an STM: A Pragmatic Approach
5th ACM SIGPLAN Workshop on Transactional Computing, Paris, France, April 13, 2010.Distributed Agreement with Optimal Communication Complexity
2010. 21st Annual ACM/SIAM Symposium on Discrete Algorithms, Austin, TX, Jan 17-19, 2010. p. 965 - 977. DOI : 10.1137/1.9781611973075.78.Boosting Gossip for Live Streaming
2010. DOI : 10.1109/P2P.2010.5569962.Computing in Social Networks
2010. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, New York, NY, Sep 20-22, 2010. p. 332 - 346. DOI : 10.1007/978-3-642-16023-3_28.LiFTinG: Lightweight Freerider-Tracking in Gossip
2010. 11th International Middleware Conference, Bangalore, India, Nov 29-Dec 03, 2010. p. 313 - 333. DOI : 10.1007/978-3-642-16955-7_16.Stretching Transactional Memory
2009. ACM SIGPLAN 2009 Conference on Programming Languages Design and Implementation, Dublin, Ireland, June 15-20, 2009. p. 155 - 165. DOI : 10.1145/1542476.1542494.Interference-Resilient Information Exchange
2009. IEEE InfoCom 2009, Rio de Janeiro, Brazil, April 19-25, 2009. p. 2249 - 2257. DOI : 10.1109/INFCOM.2009.5062150.TMunit: Testing Transactional Memories
4th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT'09), Raleigh, North Carolina, USA, February 15 2009.Reconfigurable Distributed Storage for Dynamic Networks
Journal of Parallel and Distributed Computing. 2009. DOI : 10.1016/j.jpdc.2008.07.007.Preventing versus Curing: Avoiding Conflicts in Transactional Memories
2009. Twenty-Eighth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 10-12, 2009. p. 7 - 16. DOI : 10.1145/1582716.1582725.High-Performance Transactional Event Processing
2009. 11th International Conference on Coordination Models and Languages (COORDINATION 2009), Lisbon, PORTUGAL, Jun 09-12, 2009. p. 27 - 46. DOI : 10.1007/978-3-642-02053-7_2.The Complexity of Obstruction-Free Implementations
Journal of the ACM. 2009. DOI : 10.1145/1538902.1538908.The Wireless Synchronization Problem
2009. Twenty-Eighth Annual Symposium on Principles of Distributed Computing, Calgary, Canada, August 10-12, 2009. p. 190 - 199. DOI : 10.1145/1582716.1582749.The Disagreement Power of an Adversary
2009. 23rd International Symposium on Distributed Computing, Elce, September 2009. p. 8 - 21. DOI : 10.1007/978-3-642-04355-0_6.Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
2009. The 20th International Symposium on Algorithms and Computation (ISAAC 2009), Hawaii, USA, December 16-18, 2009. p. 943 - 953. DOI : 10.1007/978-3-642-10631-6_95.Optimizing Transactions for Captured Memory
2009. 21st Annual Symposium on Parallelism in Algorithms and Architectures, Calgary, AB, Canada, August 11-13,2009. p. 214 - 222. DOI : 10.1145/1583991.1584049.Elastic Transactions
2009. 23rd International Symposium on Distributed Computing, DISC, Elche, Spain, Sepetmber 22-25, 2009. p. 93 - 107. DOI : 10.1007/978-3-642-04355-0_12.Transactional Memory: Glimmer of a Theory
2009. 21st International Conference on Computer Aided Verification (CAV), Grenoble, France, June 26 - July 2, 2009.. p. 1 - 15. DOI : 10.1007/978-3-642-02658-4_1.The Semantics of Progress in Lock-Based Transactional Memory
2009. 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Savannah, Georgia, USA, January 21-23, 2009. p. 404 - 415. DOI : 10.1145/1480881.1480931.Online Topological Ordering
2009. Symposium on Discrete Algorithms (SODA), New York, New York, January 20-22, 2009. p. 443 - 450.Software Transactional Memory on Relaxed Memory Models
2009. 21st International Conference on Computer Aided Verification, Grenoble, June 26 - July 2, 2009. p. 321 - 336. DOI : 10.1007/978-3-642-02658-4_26.What Theory for Transactional Memory?
ACM Sigact News - Distributed Computing Column. 2009. DOI : 10.1145/1711475.1711493.The Theory of Transactional Memory
Bulletinof the European Association for Theoretical Computer Science. 2009.Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
2009. 36th International Colloquium on Automata, Languages and Programming, Rhodes, Greece, July 5-12, 2009. p. 484 - 495. DOI : 10.1007/978-3-642-02930-1_40.On the weakest failure detector ever
2009. 26th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, 2007. p. 353 - 366. DOI : 10.1007/s00446-009-0079-3.Self-Stabilizing Robot Formations over Unreliable Networks
Acm Transactions On Autonomous And Adaptive Systems. 2009. DOI : 10.1145/1552297.1552300.A Topological Treatment of Early-Deciding Set-Agreement
Theoretical Computer Science. 2009. DOI : 10.1016/j.tcs.2008.10.002.Reliable Distributed Storage
IEEE Computer. 2009. DOI : 10.1109/MC.2009.126.Decentralized Polling with Respectable Participants
2009.Brief Announcement: Towards Secured Distributed Polling in Social Networks
2009. 23rd International Symposium on Distributed Computing, Elche, SPAIN, Sep 23-25, 2009. p. 241 - 242. DOI : 10.1007/978-3-642-04355-0_25.Heterogeneous Gossip
2009. ACM/IFIP/USENIX, 10th International Middleware Conference, Urbana, IL, USA, November 30 – December 4, 2009. p. 42 - 61. DOI : 10.1007/978-3-642-10445-9_3.On Tracking Freeriders in Gossip Protocols
2009. p. 139 - 142. DOI : 10.1109/P2P.2009.5284543.Stretching Gossip with Live Streaming
2009. p. 259 - 264. DOI : 10.1109/DSN.2009.5270330.Slicing Distributed Systems
IEEE Transactions on Computers. 2009. DOI : 10.1109/TC.2009.111.The Collective Memory of Amnesic Processes
ACM Transactions on Algorithms (TALG). 2008. DOI : 10.1145/1328911.1328923.On the Correctness of Transactional Memory
2008. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'08), Salt Lake City, Utah, USA, February 20-23, 2008. p. 175 - 184. DOI : 10.1145/1345206.1345233.Virtual Infrastructure for Collision-Prone Wireless Networks
2008. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008.On the Complexity of Asynchronous Gossip
2008. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008.Completeness and Nondeterminism in Model Checking Transactional Memories
2008. Concur 2008, 19th International Conference on Concurrency Theory, August 19-22 2008. p. 21 - 35. DOI : 10.1007/978-3-540-85361-9_6.Optimistic Erasure-Coded Distributed Storage
2008. DISC 2008, Arcachon, France, September 22-24, 2008. p. 182 - 196. DOI : 10.1007/978-3-540-87779-0_13.Model Checking Transactional Memories
2008. ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI). p. 372 - 382. DOI : 10.1145/1375581.1375626.On Fault Tolerance and Wireless Networks
2008. 27th Annual ACM Symposium on Principles of Distributed Computing, Toronto, CANADA, Aug 18-21, 2008. p. 463 - 463. DOI : 10.1145/1400751.1400861.How to solve consensus in the smallest window of synchrony
2008. 22nd International Symposium on Distributed Computing, Arcachon, France, September 22-24, 2008. p. 32 - 46. DOI : 10.1007/978-3-540-87779-0_3.Dynamic Prediction based Scheduling for TM
2008Reflexes: programming abstractions for highly responsive computing in Java
Lausanne, EPFL, 2008. DOI : 10.5075/epfl-thesis-4228.Dividing Transactional Memories by Zero
Transact, Salt Lake City, Utah, USA, 23.02.2008.On Obstruction-Free Transactions
2008. 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008. p. 304 - 313. DOI : 10.1145/1378533.1378587.Sharing is Harder than Agreeing
2008. ACM Conference on Principles of Distributed Computing. p. 85 - 94. DOI : 10.1145/1400751.1400764.Partial Snapshot Objects
2008. 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008. p. 336 - 343. DOI : 10.1145/1378533.1378591.Secure Communication Over Radio Channels
2008. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008.Permissiveness in Transactional Memories
2008. DISC 2008, Arcachon, France, September 22-24, 2008. p. 305 - 319. DOI : 10.1007/978-3-540-87779-0_21.Toward a Theory of Input Acceptance for Transactional Memories
2008. 12th International Conference On Principles Of DIstributed Systems, Luxor, Egypt, December 15-18, 2008. p. 527 - 533. DOI : 10.1007/978-3-540-92221-6_33.The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences. 2008. DOI : 10.1016/j.jcss.2007.10.002.Abstractions for asynchronous distributed computing with malicious players
Lausanne, EPFL, 2008. DOI : 10.5075/epfl-thesis-4241.Failure detectors as type boosters
2008. 17th International Conference on Distributed Computing, SORRENTO, ITALY, Oct 01-03, 2003. p. 343 - 358. DOI : 10.1007/s00446-007-0043-z.The complexity of reliable distributed storage
Lausanne, EPFL, 2008. DOI : 10.5075/epfl-thesis-3999.A General Characterization of Indulgence
Acm Transactions On Autonomous And Adaptive Systems. 2008. DOI : 10.1145/1452001.1452010.Self-Stabilizing Mobile Robot Formations with Virtual Nodes
2008. 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Dearborn, Michigan, November 21-24, 2008. p. 188 - 202. DOI : 10.1007/978-3-540-89335-6_16.The Weakest Failure Detector for Message Passing Set-Agreement
2008. DISC 2008, Arcachon, France, September 22-24, 2008. p. 109 - 120. DOI : 10.1007/978-3-540-87779-0_8.Flexible Task Graphs:Unified Restricted Thread Programming Model for Java
2008. ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), 2008. p. 1 - 11. DOI : 10.1145/1375657.1375659.The Weakest Failure Detectors to Boost Obstruction-Freedom
Distributed Computing. 2008. DOI : 10.1007/s00446-007-0046-9.A scalable and oblivious atomicity assertion
2008. 19th International Conference on Concurrency Theory, Toronto, CANADA, Aug 19-22, 2008. p. 52 - 66. DOI : 10.1007/978-3-540-85361-9_8.Extensible Encoding of Type Hierarchies
2008. ACM Symposium on Principles of Programming Languages (POPL). p. 349 - 358. DOI : 10.1145/1328438.1328480.SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems
2008. Seventh European Dependable Computing Conference, Kaunas, Lithuania, May 7-9. p. 157 - 166. DOI : 10.1109/EDCC-7.2008.17.Distributed Churn Measurement for Arbitrary Networks
2008. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, August 18-21, 2008. DOI : 10.1145/1400751.1400824.A Fast Distributed Slicing Algorithm
2008. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, August 18-21, 2008. DOI : 10.1145/1400751.1400820.Amnesic Distributed Storage
2007.A High Throughput Atomic Storage Algorithm
2007. The 27th IEEE International Conference on Distributed Computing Systems (ICDCS'07), Toronto, Canada, June 25-29, 2007. p. 19 - 19. DOI : 10.1109/ICDCS.2007.80.The Overhead of Consensus Failure Recovery
Distributed Computing. 2007. DOI : 10.1007/s00446-006-0017-6.STMBench7: A Benchmark for Software Transactional Memory
2007. Second European Systems Conference EuroSys2007, Lisboa, Portugal, March 21-23, 2007.Efficient Distributed Subtyping Tests
2007. ACM/IEEE/Usenix International Conference on Distributed Event-Based Systems (DEBS'07), Toronto, June 20-22, 2007. p. 214 - 225. DOI : 10.1145/1266894.1266937.StreamFlex - High-throughput Stream Programming in Java
2007. 2007 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Application (OOPSLA). p. 211 - 228. DOI : 10.1145/1297027.1297043.Gossiping in a Multi-Channel Radio Network (An Oblivious Approach to Coping With Malicious Interference)
2007. Symposium on Distributed Computing (DISC'07), Lemesos, Cyprus, September 24-26. p. 208 - 222. DOI : 10.1007/978-3-540-75142-7_18.Anonymous and fault-tolerant shared-memory computing
Distributed Computing. 2007. DOI : 10.1007/s00446-007-0042-0.On the Message Complexity of Indulgent Consensus
2007. Symposium on Distributed Computing (DISC'07), Lemesos, Cyprus, September 24-26. p. 283 - 297. DOI : 10.1007/978-3-540-75142-7_23.From unreliable objects to reliable objects: The case of atomic registers and consensus
2007. 9th International Conference on Parallel Computing Technologies, Pereslavl Zalessky, RUSSIA, Sep 03-07, 2007. p. 47 - 61. DOI : 10.1007/978-3-540-73940-1_5.Towards Fair Event Dissemination
2007. p. 63 - 63. DOI : 10.1109/ICDCSW.2007.83.The Alpha of Indulgent Consensus
The Computer Journal. 2007. DOI : 10.1093/comjnl/bxl046.A Smooth Concurrency Revolution with Free Objects
IEEE Internet Computing. 2007. DOI : 10.1109/MIC.2007.76.On The Weakest Failure Detector Ever
2007. 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, Oregon, USA, August, 12-15 2007. p. 235 - 243. DOI : 10.1145/1281100.1281135.The Perfectly-Synchronized Round-based Model of Distributed Computing
Information & Computation. 2007. DOI : 10.1016/j.ic.2006.11.003.How robust are gossip-based communication protocols?
ACM SIGOPS Operating Systems Review. 2007. DOI : 10.1145/1317379.1317383.A Generic Theoretical Framework for Modeling Gossip-Based Algorithms
ACM SIGOPS Operating Systems Review. 2007. DOI : 10.1145/1317379.1317384.Secretive Birds: Privacy in Population Protocols
2007. 11th International Conference On Principles Of Distributed Systems (OPODIS'07).Reflexes: Abstractions for Highly Responsive Systems
2007. Third International ACM SIGPLAN/SIGOPS Conference on Virtual Execution Environments, San Diego, USA, June 13-15, 2007. p. 191 - 201. DOI : 10.1145/1254810.1254837.Pervasive Computing with Frugal Objects
2007.The Weight-Watcher Service and its Lightweight Implementation
2007. p. 118 - 127.Refined Quorum Systems
2007. 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, Oregon, USA, August, 12-15 2007. p. 119 - 128. DOI : 10.1145/1281100.1281120.The Time-Complexity of Local Decision in Distributed Agreement
SIAM Journal on Computing. 2007. DOI : 10.1137/S0097539704446220.Gossip-Based Peer Sampling
ACM Transactions on Computer Systems. 2007. DOI : 10.1145/1275517.1275520.Frugal Mobile Objects
2006. p. 41 - 52.A Topological Treatment of Early-Deciding Set-Agreement
2006. 10th International Conference On Principles Of Distributed Systems (OPODIS '06), Bordeaux, France, December 12-15, 2006. p. 20 - 35. DOI : 10.1007/11945529_3.Of Malicious Motes and Suspicious Sensors
2006. 10th International Conference On Principles Of Distributed Systems (OPODIS '06), Bordeaux, France, December 12-15, 2006. p. 215 - 229. DOI : 10.1007/11945529_16.When Birds Die: Making Population Protocols Fault-tolerant
2006. 2006 ACM/IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS '06), San Francisco, CA, USA, June 18-20, 2006. p. 51 - 66. DOI : 10.1007/11776178_4.Transformations in distributed computations and applications to set agreement
Lausanne, EPFL, 2006. DOI : 10.5075/epfl-thesis-3587.Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks
2006. 10th International Conference on Principles of Distributed Systems, Bordeaux, FRANCE, Dec 12-15, 2006. p. 546 - 569. DOI : 10.1016/j.tcs.2008.10.008.Unconscious Eventual Consistency with Gossips
2006. Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006), Dallas, Texas, USA, November 17th-19th, 2006. p. 65 - 81. DOI : 10.1007/978-3-540-49823-0_5.Lucky Read/Write Access to Robust Atomic Storage
2006. IEEE International Conference on Dependable Systems and Networks (DSN '06), Philadelphia, PA, USA, June 25-28, 2006.. p. 125 - 136. DOI : 10.1109/DSN.2006.50.High Throughput Total Order Broadcast for Cluster Environments
2006. IEEE International Conference on Dependable Systems and Networks (DSN 2006), Philadelphia, PA, USA, June 28, 2006. p. 549 - 557. DOI : 10.1109/DSN.2006.37.The Weakest Failure Detectors to Boost Obstruction-Freedom
2006. 20th International Symposium on Distributed Computing (DISC'06), Stockholm, Sweden, September 2006. p. 399 - 412. DOI : 10.1007/11864219_28.Type-based event dissemination
Lausanne, EPFL, 2006. DOI : 10.5075/epfl-thesis-3595.Synchronizing without Locks is Inherently Expensive
2006. 25th ACM Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, USA, July 23-26, 2006. p. 300 - 307. DOI : 10.1145/1146381.1146427.How Fast Can a Very Robust Read Be?
2006. 25th ACM Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, USA, July 23-26, 2006. p. 248 - 257. DOI : 10.1145/1146381.1146419.A General Characterization of Indulgence (Invited Paper)
2006. Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006), Dallas, Texas, USA, November 17th-19th, 2006. p. 16 - 34. DOI : 10.1007/978-3-540-49823-0_2.Looking Ahead in Open Multithreaded Transactions
2006. p. 53 - 63. DOI : 10.1109/ISORC.2006.49.Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems
2006. ACM SIGOPS EuroSys Conference, Leuven , Belgium, April 18-21 2006. p. 359 - 371. DOI : 10.1145/1217935.1217970.GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists principles
2006. IEEE International Conference on Peer-to-Peer Computing, Cambridge, UK, September 6-8, 2006. p. 12 - 22. DOI : 10.1109/P2P.2006.19.Toward a Theory of Transactional Contention Managers
2005. p. 258 - 264. DOI : 10.1145/1073814.1073863.Synchronization using failure detectors
Lausanne, EPFL, 2005. DOI : 10.5075/epfl-thesis-3262.Reducing Fair Exchange to Atomic Commit
2005. European Conference on Dependable Computing (EDCC 2005).The Inherent Price of Indulgence
Distributed Computing. 2005. DOI : 10.1007/s00446-005-0124-9.Time-complexity bounds on agreement problems
Lausanne, EPFL, 2005. DOI : 10.5075/epfl-thesis-3261.Etude et réalisation de cristaux photoniques pour l'optique intégrée
Lausanne, EPFL, 2005. DOI : 10.5075/epfl-thesis-3254.Polymorphic Contention Management
2005. Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005. p. 303 - 323. DOI : 10.1007/11561927_23.How Fast Can Eventual Synchrony Lead to Consensus?
2005. DSN '05. p. 22 - 27. DOI : 10.1109/DSN.2005.54.Computing with Reads and Writes in the Absence of Step Contention
2005. 19th International Symposium on Distributed Computing (DISC'05). p. 122 - 136. DOI : 10.1007/11561927_11.(Almost) All Objects are Universal in Message Passing Systems
2005. 19th International Symposium on Distributed Computing (DISC'05). p. 184 - 198. DOI : 10.1007/11561927_15.Robust Contention Management in Software Transactional Memory
2005.Large scale selective event dissemination
Lausanne, EPFL, 2005. DOI : 10.5075/epfl-thesis-3264.Tolerating Arbitrary Failures with State Machine Replication
Dependable Computing Systems; John Wiley & Sons, Inc, 2005.On the Impossibility of Boosting Distributed Service Resilience
2005. IEEE International Conference on Distributed Computing Systems (ICDCS 2005). p. 39 - 48. DOI : 10.1109/ICDCS.2005.79.What Can Be Implemented Anonymously?
2005. DISC'05. p. 244 - 259. DOI : 10.1007/11561927_19.From a Static Impossibility to an Adaptive Lower Bound: the Complexity of Early Deciding Set Agreement
2005. p. 714 - 722. DOI : 10.1145/1060590.1060696.Dynamic and fault-tolerant cluster management
2005. Fith IEEE International Conference on Peer-to-Peer Computing, Konstanz, 31 August - 2 September 2005. p. 237 - 244. DOI : 10.1109/P2P.2005.6.Frugal Event Dissemination in a Mobile Environment
2005. ACM/IFIP/USENIX 6th International Middleware Conference, Grenoble, November 28 - December 2. p. 205 - 224. DOI : 10.1007/11587552_11.Robust Emulations of Shared Memory in a Crash-Recovery Model
2004. 24th IEEE International Conference on Distributed Computing Systems (ICDCS'04), Tokyo, Japan, March 23-26, 2004. p. 400 - 407. DOI : 10.1109/ICDCS.2004.1281605.Fast non-blocking atomic commit: an inherent trade-off
Information Processing Letter. 2004. DOI : 10.1016/j.ipl.2004.04.006.The complexity of eary deciding set agreement: how can topology help?
2004.The Driving Philosophers
2004.Distributed programming with typed events
IEEE Software. 2004. DOI : 10.1109/MS.2004.1270763.The Driving Philosophers
2004. DOI : 10.1007/1-4020-8141-3_16.Looking Ahead in Open Multithreaded Transactions
2004The Information Structure of Indulgent Consensus
IEEE Transactions on Computers. 2004. DOI : 10.1109/TC.2004.1268403.Dependability Issues of Pervasive Computing in a Healthcare Environment
2004. SPC'03, first International Conference on Security in Pervasive Computing, Boppard, Germany, March 12-14, 2003. p. 53 - 70. DOI : 10.1007/978-3-540-39881-3_8.BGP-based Clustering for Scalable and Reliable Gossip Broadcast
2004. Global Computing 2004 workshop. p. 273 - 290. DOI : 10.1007/978-3-540-31794-4_15.How fast can a distributed atomic read be?
2004. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), St. John's, Newfoundland, Canada, July 25-28, 2004. p. 236 - 245. DOI : 10.1145/1011767.1011802.Linguistic Support for Distributed Programming Abstractions
2004. ICDCS 2004, March 2004. p. 244 - 251. DOI : 10.1109/ICDCS.2004.1281589.Delta-Reliabie Broadcast_ A Probabilistic Measure of Broadcast Reliability
2004. ICDCS 2004, March 2004. p. 636 - 643. DOI : 10.1109/ICDCS.2004.1281631.Data-Aware Multicast
2004. p. 233 - 242. DOI : 10.1109/DSN.2004.1311893.Towards Safe Distributed Application Development
2004. ICSE'04, 2004. p. 347 - 356. DOI : 10.1109/ICSE.2004.1317457.The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing
2004. PODC 04, July 2004. p. 338 - 346. DOI : 10.1145/1011767.1011818.Epidemic Information Dissemination in Distributed Systems
IEEE Computer. 2004. DOI : 10.1109/MC.2004.1297243.Exploiting Semantic Clustering in the eDonkey P2P Network
2004. ACM SIGOPS European Workshop 2004. DOI : 10.1145/1133572.1133612.Clustering in Peer-to-Peer File Sharing Workloads
2004. IPTPS'04.The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
2004. ACM/IFIP/USENIX 5th International Middleware Conference, October 2004. p. 79 - 98. DOI : 10.1007/978-3-540-30229-2_5.Supporting Mobility in Content-Based Publish/Subscribe Middleware
2003. Middleware 2003, Rio de Janeiro, Brazil. p. 103 - 122. DOI : 10.1007/3-540-44892-6_6.From Fault-Tolerance to Security and Back
IEEE Distributed Systems Online. 2003.PAN: Providing Reliable Storage in Mobile Ad Hoc Networks with Probabilistic Quorum Systems
2003. MobicHoc 2003, June 2003. p. 1 - 12. DOI : 10.1145/778415.778417.Pragmatic Type Interoperability
2003. p. 404 - 411. DOI : 10.1109/ICDCS.2003.1203490.Dealing with Uncertainty in Mobile Publish/Subscribe Middleware
2003. Middleware for Pervasive and Ad-Hoc Computing 2003.Distributed Programming for Dummies: A Shifting Transformation Technique
2003. p. 349 - 358. DOI : 10.1109/RELDIS.2003.1238088.An Equational Theory for Transactions
2003. p. 38 - 49. DOI : 10.1007/978-3-540-24597-1_4.A Note on Set Agreement with Omission Failures
Electronic Notes in Theoretical Computing Science. 2003.Supporting Fair Exchange in Mobile Environments
Mobile Networks and Applications. 2003. DOI : 10.1023/A:1022276913209.Lightweight Probabilistic Broadcast
ACM Transactions on Computer Systems. 2003. DOI : 10.1145/945506.945507.Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks
2003. Infocom 2003, March 2003. p. 2229 - 2239. DOI : 10.1109/INFCOM.2003.1209243.Using the Topological Characterization of Synchronous Models
2003. GEometry and Topology in COncurrency and distributed systems theory (Satellite workshop of DISC'02), Toulouse, France. p. 36 - 47. DOI : 10.1016/S1571-0661(04)80834-X.Time-Efficient Self-Stabilizing Algorithms through Hierarchical Structures
2003. Self-Stabilizing Systems 2003, June 2003.Mobile Databases: A Selection of Open Issues and Research Directions
ACM SIGMOD Record. 2003. DOI : 10.1145/1024694.1024708.Tight Lower Bounds on Early Local Decisions in Uniform Consensus
2003. p. 264 - 278. DOI : 10.1007/978-3-540-39989-6_19.Fair Exchange
The Computer Journal. 2003. DOI : 10.1093/comjnl/46.1.55.The many faces of publish/subscribe
Acm Computing Surveys. 2003. DOI : 10.1145/857076.857078.Adaptive Gossip-Based Broadcast
2003. DSN 2003.Abstracting Remote Object Interaction in a Peer-2-Peer Environment
2002. p. 46 - 55. DOI : 10.1145/583810.583816.An Efficient Universal Construction for Message-Passing Systems
2002. 16th International Symposium on Distributed Computing (DISC'02), Toulouse, France, October 28-30, 2002. p. 133 - 147. DOI : 10.1007/3-540-36108-1_9.OS Support for P2P: a Case for TPS
2002. International Conference on Distributed Computing Systems, Vienna, July. p. 355 - 362. DOI : 10.1109/ICDCS.2002.1022273.On the Consistency Problem in Mobile Distributed Computing
2002. POMC 2002, Toulouse, France, October 2002. p. 51 - 57. DOI : 10.1145/584490.584501.A Realistic Look At Failure Detectors
2002. DSN 2002, Washington DC, June 2002. p. 345 - 353. DOI : 10.1109/DSN.2002.1028919.Probabilistic Multicast
2002. DSN 2002, Washington DC, June 2002. p. 313 - 322. DOI : 10.1109/DSN.2002.1028915.Network Membership: A Partition Model for Reliable Mobile Communication
2001. ICPADS'01. p. 45 - 52. DOI : 10.1109/ICPADS.2001.93480.Type-based publish/subscribe
Lausanne, EPFL, 2001. DOI : 10.5075/epfl-thesis-2503.X-ability: A Theory of Replication
Distributed Computing. 2001. DOI : 10.1007/s004460100065.Implementing E-transactions with asynchronous replication
IEEE Transactions on Parallel and Distributed Systems. 2001. DOI : 10.1109/71.910869.On Objects and Events
2001. OOPSLA 2001, January 2001. p. 254 - 269. DOI : 10.1145/504282.504301.Reliable and total order broadcast in the crash-recovery model
Lausanne, EPFL, 2001. DOI : 10.5075/epfl-thesis-2472.Abstractions for Byzantine-resilient state machine replication
Lausanne, EPFL, 2000. DOI : 10.5075/epfl-thesis-2224.Modular Abstractions for Devising Byzantine-Resilient State Machine Replication
2000. SRDS 2000. p. 144 - 153. DOI : 10.1109/RELDI.2000.885402.Indulgent Algorithms
2000. Symposium on Principles of Distributed Computing, Portland, Oregon, USA, July 16-19, 2000. p. 289 - 297. DOI : 10.1145/343477.343630.What object-oriented distributed programming does not have to be, and what it may be
Informatik. 1999.
IEEE publications are copyright © of the Institute of Electrical and Electronics Engineers
LNCS publications are copyright © of Springer
TCS publications are copyright © of Elsevier Science B.V.