Search DCL publications with Infoscience
Genuinely Distributed Byzantine Machine Learning2020-08-03. The ACM Symposium on Principles of Distributed Computing (PODC), Salerno, Italy, August 3–7, 2020. DOI : 10.1145/3382734.3405695.
The weakest failure detector for eventual consistencyDistributed Computing. 2019-12-01. DOI : 10.1007/s00446-016-0292-9.
Le fabuleux chantier: Rendre l’intelligence artificielle robustement bénéfiqueEDP Sciences.
Exploring The Borderlands Of The Gathering ProblemBulletin of The European Association for Theoretical Computer Science. 2019-10-01.
A hybrid niobium-based oxide with bio-based porous carbon as an efficient electrocatalyst in photovoltaics: a general strategy for understanding the catalytic mechanismJournal Of Materials Chemistry A. 2019-06-28. DOI : 10.1039/c9ta03540k.
Adaptive and Scalable Communication NetworksProceedings of the IEEE. 2019-04-01. DOI : 10.1109/JPROC.2019.2904751.
AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation2019-04-01. The Conference on Systems and Machine Learning (SysML), 2019, Stanford, CA, USA, March 31 - April 2, 2019 .
Lock-Unlock: Is That All? A Pragmatic Analysis of Locking in Software SystemsAcm Transactions On Computer Systems. 2019-03-01. DOI : 10.1145/3301501.
Fast General Distributed Transactions with Opacity2019-01-01. ACM SIGMOD International Conference on Management of Data (SIGMOD), Amsterdam, NETHERLANDS, Jun 30-Jul 05, 2019. p. 433-448. DOI : 10.1145/3299869.3300069.
Utility and privacy effects of a user action in a communication systemEP3435314 . 2019.
Byzantine tolerant gradient descent for distributed machine learning with adversariesWO2019105543 . 2019.
Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores2019-01-01. 16th USENIX Symposium on Networked Systems Design and Implementation, Boston, MA, Feb 26-28, 2019. p. 79-93.
The PCL Theorem: Transactions cannot be Parallel, Consistent, and LiveJournal Of The Acm. 2019-01-01. DOI : 10.1145/3266141.
Causal Consistency and Latency Optimality: Friend or Foe?Proceedings Of The Vldb Endowment. 2018-07-01. DOI : 10.14778/3236187.3236210.
Monotonic Prefix Consistency in Distributed Systems2018-05-30. 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 Learning2018-04-09. AISTATS.
Giant multiphoton absorption for THz resonances in silicon hydrogenic donorsNature Photonics. 2018-03-01. DOI : 10.1038/s41566-018-0111-x.
Closing the Performance Gap Between Volatile and Persistent Key-Value Stores Using Cross-Referencing Logs2018-01-01. USENIX Annual Technical Conference (ATC), Boston, MA, Jul 11-13, 2018. p. 967-979.
Log-Free Concurrent Data Structures2018-01-01. USENIX Annual Technical Conference (ATC), Boston, MA, Jul 11-13, 2018. p. 373-385.
Collaborative Filtering Under a Sybil Attack: Similarity Metrics do Matter!2018-01-01. 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.
Asynchronous Byzantine Machine Learning (the case of SGD)2018. 35th International Conference on Machine Learning, Stockholm, SWEDEN, July 10-15, 2018. p. 1145-1154.
Passing Messages while Sharing Memory2018-01-01. 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.
Locking Timestamps versus Locking Objects2018-01-01. 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.
Brief Announcement: Persistent Multi-Word Compare-and-Swap2018-01-01. 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.
On the Unfairness of Blockchain2018. NETYS 2018 , Essaouira, Morocco, May 9, 2018 - May 11, 2018.
The entropy of a distributed computation random number generation from memory interleavingDISTRIBUTED COMPUTING. 2018. DOI : 10.1007/s00446-017-0311-5.
TM 2 C: a software transactional memory for many-coresDistributed Computing. 2018. DOI : 10.1007/s00446-017-0310-6.
Deep Learning Works in Practice. But Does it Work in Theory?ArXiv. 2018.
The Hidden Vulnerability of Distributed Learning in Byzantium2018. International Conference on Machine Learning, Stockholm, Sweden, July 10-15, 2018.
Log-Free Concurrent Data Structures2018. 2018 USENIX Annual Technical Conference, BOSTON, MA, USA, JULY 11–13, 2018.
The Utility and Privacy Effects of a Click2017-08-07. SIGIR, Shinjuku, Tokyo, Japan, August 7-11, 2017.
TRIAD: creating synergies between memory, disk and log in log structured key-value stores2017-07-12. USENIX ATC, Santa Clara, CA, USA, July 12-14, 2017.
On The Robustness of a Neural Network2017. 36th IEEE International Symposium on Reliable Distributed Systems, Hong Kong, September 26-29, 2017.
On verifying causal consistency2017. 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.
Heterogeneous Recommendations: What You Might Like To Read After Watching Interstellar2017. PVLDB, Munich, Germany, August 28 - 31, 2017. p. 1070-1081.
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.
Elastic transactionsJournal Of Parallel And Distributed Computing. 2017. DOI : 10.1016/j.jpdc.2016.10.010.
Collision-Free Pattern Formation2016. OPODIS 2016.
WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems2016. 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 Detectors2016. 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.
Optimal Fair Computation2016. 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.
Trade-offs in Replicated SystemsIEEE Data Engineering Bulletin. 2016.
Frugal Topology Construction for Stream Aggregation in the Cloud2016. 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, USA.
Right On Time Distributed Shared Memory2016. IEEE Real-Time Systems Symposium, Porto, 2016.
Incremental Consistency Guarantees for Replicated Objects2016. 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI ’16), Savannah, GA, USA, November 2–4, 2016. p. 169-184.
Privacy-preserving distributed collaborative filteringComputing. 2016. DOI : 10.1007/s00607-015-0451-z.
ProteusTM: Abstraction Meets Performance in Transactional Memory2016. 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.
Unlocking Energy2016. 2016 USENIX Annual Technical Conference, Denver, Colorado, USA, June 22-24, 2016. p. 393-406.
Byzantine Fireflies2015. Distributed computing (DISC), Tokyo, Japan, October 7-9, 2015.
Safety-Liveness Exclusion in Distributed Computing2015. ACM Symposium on Principles of Distributed Computing. DOI : 10.1145/2767386.2767401.
Special issue on NETYS selected papersComputing. 2015. DOI : 10.1007/s00607-015-0466-5.
A Thrifty Universal Construction2015. NETYS, Agadir, Morocco.
Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures2015. Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Istanbul, Turkey, March 14–18, 2015. DOI : 10.1145/2694344.2694359.
Distributed AlgorithmsComputing Handbook, Third Edition; CRC Press, 2014. p. 16.
Composing Relaxed Transactions2013. 27th IEEE International Parallel & Distributed Processing Symposium (IPDPS'13), Boston, Massachusetts USA, May 20-24, 2013. p. 1171-1182.
Abortable Linearizable ModulesArchive of Formal Proofs (AFP). 2012.
Efficient graph planarization in sensor networks and local routing algorithm2012. 8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN. p. 140-149. DOI : 10.1109/Dcoss.2012.64.
A Speculation-Friendly Binary Search TreeAcm Sigplan Notices. 2012. DOI : 10.1145/2370036.2145837.
On the efficiency of routing in sensor networksJournal Of Parallel And Distributed Computing. 2012. DOI : 10.1016/j.jpdc.2012.02.021.
A Distributed Algorithm for Computing the Node Search Number in TreesAlgorithmica. 2012. DOI : 10.1007/s00453-011-9524-3.
STM in the Small: Trading Generality for Performance in Software Transactional Memory2012. 6th ACM European conference on Computer systems, Bern, Switzerland, April 11-13, 2012. p. 1-14.
Model Checking a Networked System Without the Network2011. 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI '11), Boston, Massachusetts, USA, March 30-April 1, 2011.
Introduction to Reliable and Secure Distributed ProgrammingSpringer.
Atomic boxes: coordinated exception handling with transactional memory2011. ECOOP. p. 634-657.
Émulation de mémoire partagée en environnements distribués dynamiquesTechnique et Science Informatiques. 2011. DOI : 10.3166/tsi.30.809-839.
Sub-Logarithmic Test-and-Set Against a Weak Adversary2011. DISC 2011.
Automated Vulnerability Discovery in Distributed Systems2011. 7th Workshop on Hot Topics in System Dependability (HotDep), Hong Kong, China, 2011.
Optimal-Time Adaptive Strong Renaming, with Applications to Counting2011. PODC .
The VELOX Transactional Memory StackIEEE Micro. 2010. DOI : 10.1109/MM.2010.80.
Transactional memory, linking theory and practiceACM SIGACT News. 2010. DOI : 10.1145/1907450.1907546.
Distributed Agreement with Optimal Communication Complexity2010. 21st Annual ACM/SIAM Symposium on Discrete Algorithms, Austin, TX, Jan 17-19, 2010. p. 965-977.
Refined quorum systemsDistributed Computing. 2010. DOI : 10.1007/s00446-010-0103-7.
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.
Computing in Social Networks2010. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, New York, NY, Sep 20-22, 2010. p. 332-346.
LiFTinG: Lightweight Freerider-Tracking in Gossip2010. 11th International Middleware Conference, Bangalore, India, Nov 29-Dec 03, 2010. p. 313-333.
Composition vs Concurrency2nd Workshop on the Theory of Transactional Memory, Cambridge, Massachusetts, USA, September 16, 2010.
A Provably Starvation-Free Distributed Directory Protocol2010. 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.
Fast Randomized Test-and-Set and Renaming2010. International Symposium on Distributed Computing (DISC), Boston, Massachusetts, USA, September 13-15.
Independent Faults in the CloudThe 4th ACM SIGOPS/SIGACT Workshop on Large Scale Distributed Systems and Middleware (LADIS'10), Zurich, Switzerland, July 28-29, 2010.
Boosting Gossip for Live Streaming2010.
Collaborative Scoring with Dishonest Participants2010. 22nd ACM Symposium on Parallelism in Algorithms and Architectures.
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.
Securing Every Bit: Authenticated Broadcast in Radio Networks2010. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Santorini, Greece, 13-15 June, 2010.
Predicting the Scalability of an STM: A Pragmatic Approach5th ACM SIGPLAN Workshop on Transactional Computing, Paris, France, April 13, 2010.
The Next 700 BFT Protocols2010. 5th ACM EuroSys Conference, Paris, France, April 13-16, 2010.
Concurrent Multipath Transferring in IP Networks: Two IP-level solutions for TCP and UDPVDM Verlag.
On the Input Acceptance of Transactional MemoryParallel Processing Letters. 2010.
Self-Stabilizing Robot Formations over Unreliable NetworksAcm Transactions On Autonomous And Adaptive Systems. 2009. DOI : 10.1145/1552297.1552300.
Brief Announcement: Towards Secured Distributed Polling in Social Networks2009. 23rd International Symposium on Distributed Computing, Elche, SPAIN, Sep 23-25, 2009. p. 241-242.
What Theory for Transactional Memory?ACM Sigact News - Distributed Computing Column. 2009. DOI : 10.1145/1711475.1711493.
Decentralized Polling with Respectable Participants2009.
On Tracking Freeriders in Gossip Protocols2009.
Elastic Transactions2009. DISC, Elche, Spain, Sepetmber 22-25, 2009. p. 93-107.
Slicing Distributed SystemsIEEE Transactions on Computers. 2009. DOI : 10.1109/TC.2009.111.
The Wireless Synchronization Problem2009. Twenty-Eighth Annual Symposium on Principles of Distributed Computing, Calgray, Canada, August 10-12, 2009.
The Theory of Transactional MemoryBulletin of the EATCS. 2009.
Transactional Memory: Glimmer of a Theory2009. 21st International Conference on Computer Aided Verification (CAV).
High-Performance Transactional Event Processing2009. 11th International Conference on Coordination Models and Languages (COORDINATION 2009), Lisbon, PORTUGAL, Jun 09-12, 2009.
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures2009. 36th International Colloquium on Automata, Languages and Programming, Rhodes, Greece, July 5-12, 2009.
Stretching Gossip with Live Streaming2009.
Software Transactional Memory on Relaxed Memory Models2009. 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.
Preventing versus Curing: Avoiding Conflicts in Transactional Memories2009. Twenty-Eighth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 10-12, 2009.
Stretching Transactional Memory2009. ACM SIGPLAN 2009 Conference on Programming Languages Design and Implementation, Dublin, Ireland, June 15-20, 2009.
Interference-Resilient Information Exchange2009. IEEE InfoCom 2009, Rio de Janeiro, Brazil, April 19-25, 2009.
TMunit: Testing Transactional Memories4th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT'09), Raleigh, North Carolina, USA, February 15 2009.
The Semantics of Progress in Lock-Based Transactional Memory2009. 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Savannah, Georgia, USA, January 21-23, 2009.
Online Topological Ordering2009. Symposium on Discrete Algorithms (SODA), New York, New York, January 20-22, 2009.
A scalable and oblivious atomicity assertion2008. 19th International Conference on Concurrency Theory, Toronto, CANADA, Aug 19-22, 2008. p. 52-66.
A General Characterization of IndulgenceAcm Transactions On Autonomous And Adaptive Systems. 2008. DOI : 10.1145/1452001.1452010.
On Fault Tolerance and Wireless Networks2008. 27th Annual ACM Symposium on Principles of Distributed Computing, Toronto, CANADA, Aug 18-21, 2008. p. 463-463.
Reconfigurable Distributed Storage for Dynamic NetworksJournal of Parallel and Distributed Computing. 2008. DOI : 10.1016/j.jpdc.2008.07.007.
Toward a Theory of Input Acceptance for Transactional Memories2008. 12th International Conference On Principles Of DIstributed Systems, Luxour, Egypt, December 15-18, 2008.
SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems2008. Seventh European Dependable Computing Conference, Kaunas, Lithuania, May 7-9. p. 157-166.
A Fast Distributed Slicing Algorithm2008. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, August 18-21, 2008. p. 429.
Distributed Churn Measurement for Arbitrary Networks2008. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, August 18-21, 2008. p. 431.
Self-Stabilizing Mobile Robot Formations with Virtual Nodes2008. 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Dearborn, Michigan, November 21-24, 2008.
How to solve consensus in the smallest window of synchrony2008. 22nd International Symposium on Distributed Computing, Arcachon, France, September 22-24, 2008.
Permissiveness in Transactional Memories2008. DISC 2008, Arcachon, France, September 22-24, 2008.
Optimistic Erasure-Coded Distributed Storage2008. DISC 2008, Arcachon, France, September 22-24, 2008.
The Weakest Failure Detector for Message Passing Set-Agreement2008. DISC 2008, Arcachon, France, September 22-24, 2008.
Completeness and Nondeterminism in Model Checking Transactional Memories2008. Concur 2008, August 19-22 2008.
Sharing is Harder than Agreeing2008. ACM Conference on Principles of Distributed Computing.
On the Complexity of Asynchronous Gossip2008. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008.
Virtual Infrastructure for Collision-Prone Wireless Networks2008. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008.
Secure Communication Over Radio Channels2008. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, August, 2008.
On Obstruction-Free Transactions2008. 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008. p. 304-313.
Partial Snapshot Objects2008. 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany , June 14-16, 2008.
Reliable Distributed StorageIEEE Computer. 2008.
Dividing Transactional Memories by ZeroTransact, Salt Lake City, Utah, USA, 23.02.2008.
Model Checking Transactional Memories2008. ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI).
On the Correctness of Transactional Memory2008. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'08), Salt Lake City, Utah, USA, February 20-23, 2008.
Extensible Encoding of Type Hierarchies2008. ACM Symposium on Principles of Programming Languages (POPL).
From unreliable objects to reliable objects: The case of atomic registers and consensus2007. 9th International Conference on Parallel Computing Technologies, Pereslavl Zalessky, RUSSIA, Sep 03-07, 2007. p. 47-61.
The Weakest Failure Detectors to Boost Obstruction-FreedomDistributed Computing. 2007.
Secretive Birds: Privacy in Population Protocols2007. 11th International Conference On Principles Of Distributed Systems (OPODIS'07).
A Generic Theoretical Framework for Modeling Gossip-Based AlgorithmsACM SIGOPS Operating Systems Review. 2007.
Amnesic Distributed Storage2007.
On the Message Complexity of Indulgent Consensus2007. Symposium on Distributed Computing (DISC'07), Lemesos, Cyprus, September 24-26. p. 283-297.
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.
How robust are gossip-based communication protocols?Operating Systems Review. 2007.
The Perfectly-Synchronized Round-based Model of Distributed ComputingInformation & Computation. 2007.
Gossip-Based Peer SamplingACM Transactions on Computer Systems. 2007.
A Smooth Concurrency Revolution with Free ObjectsInternet Computing. 2007.
On The Weakest Failure Detector Ever2007. 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, Oregon, USA, August, 12-15 2007.
Efficient Distributed Subtyping Tests2007. ACM/IEEE/Usenix International Conference on Distributed Event-Based Systems (DEBS'07), Toronto, June 20-22, 2007.
StreamFlex - High-throughput Stream Programming in Java2007. 2007 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Application (OOPSLA).
Refined Quorum Systems2007. 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, Oregon, USA, August, 12-15 2007.
The Weight-Watcher Service and its Lightweight Implementation2007. p. 118-127.
Towards Fair Event Dissemination2007.
Pervasive Computing with Frugal Objects2007.
Reflexes: Abstractions for Highly Responsive Systems2007. Third International ACM SIGPLAN/SIGOPS Conference on Virtual Execution Environments, San Diego, USA, June 13-15, 2007.
STMBench7: A Benchmark for Software Transactional Memory2007. Second European Systems Conference EuroSys2007, Lisboa, Portugal, March 21-23, 2007.
A High Throughput Atomic Storage Algorithm2007. The 27th IEEE International Conference on Distributed Computing Systems (ICDCS'07), Toronto, Canada, June 25-29, 2007.
Frugal Mobile Objects2006. p. 41-52.
A Topological Treatment of Early-Deciding Set-Agreement2006. OPODIS 2006, Bordeaux, France, December 12-15, 2006.
Of Malicious Motes and Suspicious Sensors2006. OPODIS 2006, Bordeaux, France, December 12-15, 2006.
The Overhead of Indulgent Failure RecoveryDistributed Computing. 2006.
The Alpha of Indulgent ConsensusThe Computer Journal. 2006.
The Weakest Failure Detectors to Boost Obstruction-Freedom2006. 20th International Symposium on Distributed Computing (DISC'06), Stockholm, Sweden, September 2006. p. 399-412.
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.
Unconscious Eventual Consistency with Gossips2006. Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006), Dallas, Texas, USA, November 17th-19th, 2006.
Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems2006. ACM SIGOPS EuroSys Conference, Leuven , Belgium, April 18-21 2006.
GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists principles2006. IEEE International Conference on Peer-to-Peer Computing, Cambridge, UK, September 6-8, 2006.
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.
Synchronizing without Locks is Inherently Expensive2006. 25th ACM Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, USA, July 23-26, 2006.
Looking Ahead in Open Multithreaded Transactions2006. p. 53-63.
Lucky Read/Write Access to Robust Atomic Storage2006. IEEE International Conference on Dependable Systems and Networks (DSN '06), Philadelphia, PA, USA, June 25-28, 2006..
High Throughput Total Order Broadcast for Cluster Environments2006. IEEE International Conference on Dependable Systems and Networks (DSN 2006), Philadelphia, PA, USA, June 28, 2006.
When Birds Die: Making Population Protocols Fault-tolerant2006. 2006 ACM/IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS '06).
What Can Be Implemented Anonymously?2005. DISC'05.
Frugal Event Dissemination in a Mobile Environment2005. Middleware, Grenoble, November 28 - December 2. p. 205-224.
Dynamic and fault-tolerant cluster management2005. Fith IEEE International Conference on Peer-to-Peer Computing, Konstanz, 31 August - 2 September 2005. p. 237-244.
How Fast Can Eventual Synchrony Lead to Consensus?2005. DSN '05.
Tolerating Arbitrary Failures with State Machine ReplicationDependable Computing Systems; John Wiley & Sons, Inc, 2005.
(Almost) All Objects are Universal in Message Passing Systems2005. 19th International Symposium on Distributed Computing (DISC'05).
Robust Contention Management in Software Transactional Memory2005.
Polymorphic Contention Management2005. p. 303-323.
Towards a Theory of Transactional Contention Managers2005. p. 258-264.
From a Static Impossibility to an Adaptive Lower Bound: the Complexity of Early Deciding Set Agreement2005. p. 714-722.
Computing with Reads and Writes in the Absence of Step Contention2005. 19th International Symposium on Distributed Computing (DISC'05).
On the Impossibility of Boosting Distributed Service Resilience2005. IEEE International Conference on Distributed Computing Systems (ICDCS 2005).
Reducing Fair Exchange to Atomic Commit2005. European Conference on Dependable Computing (EDCC 2005).
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.
Robust Emulations of Shared Memory in a Crash-Recovery Model2004. 24th IEEE International Conference on Distributed Computing Systems (ICDCS'04), Tokyo, Japan, March 23-26, 2004. p. 400-407.
From Epidemics to Distributed ComputingIEEE Computer. 2004.
Clustering in Peer-to-Peer File Sharing Workloads2004. IPTPS'04.
The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing2004. PODC 04, July 2004.
Delta-Reliability: A Probabilistic Measure of Broadcast Reliability2004. ICDCS 2004, March 2004.
Towards Safe Distributed Application Development2004. ICSE'04, 2004.
Linguistic Support for Distributed Programming Abstractions2004. ICDCS 2004, March 2004.
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations2004. ACM/IFIP/USENIX 5th International Middleware Conference, October 2004.
Exploiting Semantic Clustering in the eDonkey P2P Network2004. ACM SIGOPS European Workshop 2004.
BGP-based Clustering for Scalable and Reliable Gossip Broadcast2004. Global Computing 2004 workshop.
The Information Structure of Indulgent ConsensusIEEE Transactions on Computers. 2004.
Fast non-blocking atomic commit: an inherent trade-offInformation Processing Letter. 2004.
The complexity of eary deciding set agreement: how can topology help?2004.
Data-Aware Multicast2004. p. 1-12.
The many faces of publish/subscribe2003. p. 114-131.
Adaptive Gossip-Based Broadcast2003. DSN 2003.
Dealing with Uncertainty in Mobile Publish/Subscribe Middleware2003. Middleware for Pervasive and Ad-Hoc Computing 2003.
Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks2003. Infocom 2003, March 2003.
Time-Efficient Self-Stabilizing Algorithms through Hierarchical Structures2003. Self-Stabilizing Systems 2003, June 2003.
PAN: Providing Reliable Storage in Mobile Ad Hoc Networks with Probabilistic Quorum Systems2003. MobicHoc 2003, June 2003.
From Fault-Tolerance to Security and BackIEEE Distributed Systems Online. 2003.
Supporting Mobility in Content-Based Publish/Subscribe Middleware2003. Middleware 2003, Rio de Janeiro, Brazil.
Dependability Issues of Pervasive Computing in a Healthcare Environment2003. SPC'03, Boppard, Germany.
Mobile Databases: A Report on Open Issues and Research Directions2003. ACM SIGMOD.
A Note on Set Agreement with Omission FailuresElectronic Notes in Theoretical Computing Science. 2003.
Distributed Programming for Dummies: A Shifting Transformation Technique2003.
Using the Topological Characterization of Synchronous Models2003.
Tight Lower Bounds on Early Local Decisions in Uniform Consensus2003. p. 264-278.
Pragmatic Type Interoperability2003. p. 404-411.
An Equational Theory for Transactions2003.
Lightweight Probabilistic BroadcastACM Transactions on Computer Systems. 2003.
A Realistic Look At Failure Detectors2002. DSN 2002, Washington DC, June 2002.
Probabilistic Multicast2002. DSN 2002, Washington DC, June 2002.
On the Consistency Problem in Mobile Distributed Computing2002. POMC 2002, Toulouse, France, October 2002.
An Efficient Universal Construction for Message-Passing Systems2002. p. 133-147.
Abstracting Remote Object Interaction in a Peer-2-Peer Environment2002.
OS Support for P2P: a Case for TPS2002. International Conference on Distributed Computing Systems, Vienna, July. p. 355-362.
Network Membership: A Partition Model for Reliable Mobile Communication2001. ICPADS'01.
On Objects and Events2001. OOPSLA 2001, January 2001.
X-ability: A Theory of ReplicationDistributed Computing. 2001.
Modular Abstractions for Devising Byzantine-Resilient State Machine Replication2000. SRDS 2000.
Indulgent Algorithms2000. Symposium on Principles of Distributed Computing, Portland, Oregon, USA, July 16-19, 2000.
What object-oriented distributed programming does not have to be, and what it may beInformatik. 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.