- English only
Distributed Programming Laboratory LPD
Search LPD publications with Infoscience
Our publications
2012
The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit, in Siam Journal On Computing, vol. 41, num. 6, p. 1343-1379, 2012.
. Efficient graph planarization in sensor networks and local routing algorithm. [u'8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN', u'8th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN'], 2012.
Speculative Linearizability, in Acm Sigplan Notices, vol. 47, num. 6, p. 55-66, 2012.
A Speculation-Friendly Binary Search Tree, in Acm Sigplan Notices, vol. 47, num. 8, p. 161-170, 2012.
Generating Fast Indulgent Algorithms, in Theory Of Computing Systems, vol. 51, num. 4, p. 404-424, 2012.
. Randomized versus Deterministic Implementations of Concurrent Data Structures. EPFL, Lausanne, 2012.
. Scalable and Secure Polling in Dynamic Distributed Networks. 31st IEEE International Symposium on Reliable Distributed Systems, Irvine, California, 2012.
How to Allocate Tasks Asynchronously, 2012.
. On the liveness of transactional memory. 31st ACM Symposium on Principles of Distributed Computing, Madeira, Portugal, 2012.
On the efficiency of routing in sensor networks, in Journal Of Parallel And Distributed Computing, vol. 72, p. 889-901, 2012.
Obstruction degree: measuring concurrency in shared memory systems, 2012.
. On the Performance of Software Transactional Memory. EPFL, Lausanne, 2012.
A Distributed Algorithm for Computing the Node Search Number in Trees, in Algorithmica, vol. 63, p. 158-190, 2012.
. STM in the Small: Trading Generality for Performance in Software Transactional Memory. 6th ACM European conference on Computer systems, Bern, Switzerland, 2012.
A Pragmatic Approach for Predicting the Scalability of Parallel Applications, 2012.
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement, in Algorithmica, vol. 62, p. 595-629, 2012.
Decentralized polling with respectable participants, in Journal Of Parallel And Distributed Computing, vol. 72, p. 13-26, 2012.
. A High-Throughput Byzantine Fault-Tolerant Protocol. EPFL, Lausanne, 2012.
2011
Collaborative Personalized Top-k Processing, in Acm Transactions On Database Systems, vol. 36, p. -, 2011.
. Brief Announcement: Transaction Polymorphism. 23rd Annual Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, 2011.
Verification of STM on relaxed memory models, in Formal Methods In System Design, vol. 39, p. 297-331, 2011.
. Atomic boxes: coordinated exception handling with transactional memory. ECOOP, LNCS 6813, 2011.
Émulation de mémoire partagée en environnements distribués dynamiques, in Technique et Science Informatiques, vol. 30, num. 7, p. 809-839, 2011.
The Complexity Of Early Deciding Set Agreement, in Siam Journal On Computing, vol. 40, p. 63-78, 2011.
On the Liveness of Transactional Memory, 2011.
Speculative Linearizability, 2011.
. The Complexity of Renaming. FOCS, Annual IEEE Symposium on Foundations of Computer Science, 2011.
. Sub-Logarithmic Test-and-Set Against a Weak Adversary. DISC 2011, Lecture Notes in Computer Science, 2011.
. On The Power of Hardware Transactional Memory to Simplify Memory Management. 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, San Jose, California, USA, 2011.
The Complexity of Renaming, 2011.
. Optimal-Time Adaptive Strong Renaming, with Applications to Counting. PODC, 2011.
Local Model Checking, 2011.
Transaction Polymorphism, 2011.
. Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated . ACM POPL 2011, Austin, Texas, USA, 2011.
. Generating Fast Indulgent Algorithms. 12th International Conference on Distributed Computing and Networking (ICDCN 2011), Lecture Notes in Computer Science, 2011.
. Model Checking of Distributed Algorithm Implementations. EPFL, Lausanne, 2011.
Why STM can be more than a Research Toy, in Communications of the ACM, vol. 54, p. 70-77, 2011.
2010
The VELOX Transactional Memory Stack, in IEEE Micro, vol. 30, num. 5, p. 76-87, 2010.
Transactional memory, linking theory and practice, in ACM SIGACT News, vol. 41, num. 4, p. 107-111, 2010.
Model checking transactional memories, in Distributed Computing, vol. 22, p. 129-145, 2010.
. Distributed Agreement with Optimal Communication Complexity. 21st Annual ACM/SIAM Symposium on Discrete Algorithms, Austin, TX, Proceedings in Applied Mathematics, 2010.
Refined quorum systems, in Distributed Computing, vol. 23, p. 1-42, 2010.
. Foundations of Speculative Distributed Computing (Invited Lecture Extended Abstract). 24th International Symposium on Distributed Computing, Cambridge, MA, Lecture Notes in Computer Science, 2010.
. Computing in Social Networks. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, New York, NY, Lecture Notes in Computer Science, 2010.
. LiFTinG: Lightweight Freerider-Tracking in Gossip. 11th International Middleware Conference, Bangalore, India, Lecture Notes in Computer Science, 2010.
Trustful Cumulus Clouds, 2010.
PaxosInside, 2010.
. Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?. 6th Workshop on Hot Topics in System Dependability (HotDep), Vancouver, Canada, 2010.
Fast Access to Distributed Atomic Memory, in SIAM Journal on Computing, 2010.
Composing Relaxed Transactions, 2010.
. Composition vs Concurrency. 2nd Workshop on the Theory of Transactional Memory, Cambridge, Massachusetts, USA, 2010.
Extensible Transactional Memory Testbed, accepted in Journal of Parallel and Distributed Computing - Special Issue on Transactional Memory, 2010.
. A Provably Starvation-Free Distributed Directory Protocol. 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, New York, NY, USA, LNCS 6366, 2010.
Generalizing State Machine Replication, 2010.
Reflexes: Abstractions for Integrating Highly Responsive Tasks into Java Applications , in ACM Transactions on Embedded Computing Systems, vol. 10, num. 1, 2010.
The Impossibility of Boosting Distributed Service Resilience, in Information and Computation, 2010.
Throughput optimal total order broadcast for cluster environments, in ACM Transactions on Computer Systems, vol. 28, num. 2, 2010.
. Fast Randomized Test-and-Set and Renaming. International Symposium on Distributed Computing (DISC), Boston, Massachusetts, USA, Lecture Notes in Computer Science, 2010.
Fast Randomized Test-and-Set and Renaming, 2010.
. Independent Faults in the Cloud. The 4th ACM SIGOPS/SIGACT Workshop on Large Scale Distributed Systems and Middleware (LADIS'10), Zurich, Switzerland, 2010.
. Boosting Gossip for Live Streaming. , 2010.
. Transactions in the Jungle∗ . 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, 2010.
Tight Failure Detection Bounds on Atomic Object Implementations, in Journal of the ACM, vol. 57, num. 4, p. 21, 2010.
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement, accepted in Algorithmica, Lecture Notes in Computer Science, 2010.
Throughput Optimal Total Order Broadcast for Cluster Environments, accepted in ACM Transactions on Computer Systems, 2010.
. Live Streaming with Gossip. EPFL, Lausanne, 2010.
. Transactions in the Jungle. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, 2010.
. Collaborative Scoring with Dishonest Participants. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, 2010.
Stretching BFT, 2010.
. How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). 37th International Colloquium on Automata, Languages and Programming (ICALP), Bordeaux, France, Lecture Notes in Computer Science, 2010.
. Securing Every Bit: Authenticated Broadcast in Radio Networks. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, Santorini, Greece, 2010.
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange), 2010.
. Predicting the Scalability of an STM: A Pragmatic Approach. 5th ACM SIGPLAN Workshop on Transactional Computing, Paris, France, 2010.
. Theory of Transactional Memory. EPFL, Lausanne, 2010.
Model Checking Tools for Software System Implementations, 2010.
COMBINE: An Improved Directory-Based Consistency Protocol, 2010.
. Leveraging Parallel Nesting in Transactional Memory. 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Bangalore, India, 2010.
. Concurrent Multipath Transferring in IP Networks: Two IP-level solutions for TCP and UDP, : . VDM Verlag, 978-3-639-22466-5, 2010.
One Acceptor is Enough, 2010.
On the Input Acceptance of Transactional Memory, accepted in Parallel Processing Letters, vol. 20, num. 1, p. 31-50, 2010.
2009
. On the weakest failure detector ever. 26th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, 2009.
Self-Stabilizing Robot Formations over Unreliable Networks, in Acm Transactions On Autonomous And Adaptive Systems, vol. 4, p. -, 2009.
. Brief Announcement: Towards Secured Distributed Polling in Social Networks. 23rd International Symposium on Distributed Computing, Elche, SPAIN, Lecture Notes in Computer Science, 2009.
What Theory for Transactional Memory?, in ACM Sigact News - Distributed Computing Column, vol. 40, num. 4, p. 79-81, 2009.
. Optimizing Transactions for Captured Memory. 21st Annual Symposium on Parallelism in Algorithms and Architectures, Calgary, AB, Canada, 2009.
. The Disagreement Power of an Adversary. 23rd International Symposium on Distributed Computing, Elce, 2009.
. Decentralized Polling with Respectable Participants. , 2009.
. On Tracking Freeriders in Gossip Protocols. , 2009.
. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. The 20th International Symposium on Algorithms and Computation (ISAAC 2009), Hawaii, USA, Lecture Notes in Computer Science, 2009.
Why STM can be more than a Research Toy, 2009.
Reflexes: Abstractions for Integrating Highly Responsive Tasks into Java Applications, in ACM TECS Special Issue on Java Technologies for Real-Time and Embedded Systems (JTRES), 2009.
. Elastic Transactions. DISC, Elche, Spain, Lecture Notes in Computer Science 5805, 2009.
. Heterogeneous Gossip. , 2009.
Slicing Distributed Systems, accepted in IEEE Transactions on Computers, 2009.
. The Wireless Synchronization Problem. Twenty-Eighth Annual Symposium on Principles of Distributed Computing, Calgray, Canada, 2009.
The Theory of Transactional Memory, in Bulletin of the EATCS, num. 97, 2009.
. Transactional Memory: Glimmer of a Theory. 21st International Conference on Computer Aided Verification (CAV), Lecture Notes in Computer Science, 2009.
The Complexity of Obstruction-Free Implementations, accepted in Journal of the ACM, 2009.
. High-Performance Transactional Event Processing. 11th International Conference on Coordination Models and Languages (COORDINATION 2009), Lisbon, PORTUGAL, Lecture Notes in Computer Science, 2009.
. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. 36th International Colloquium on Automata, Languages and Programming, Rhodes, Greece, 2009.
. Stretching Gossip with Live Streaming. , 2009.
Elastic Transactions, 2009.
. Software Transactional Memory on Relaxed Memory Models. 21st International Conference on Computer Aided Verification, Grenoble, Lecture Notes in Computer Science, 2009.
. Preventing versus Curing: Avoiding Conflicts in Transactional Memories. Twenty-Eighth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, 2009.
. Stretching Transactional Memory. ACM SIGPLAN 2009 Conference on Programming Languages Design and Implementation, Dublin, Ireland, 2009.
How Live Can a Transactional Memory Be?, 2009.
. Interference-Resilient Information Exchange. IEEE InfoCom 2009, Rio de Janeiro, Brazil, Ieee Infocom, 2009.
. TMunit: Testing Transactional Memories. 4th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT'09), Raleigh, North Carolina, USA, 2009.
. The Semantics of Progress in Lock-Based Transactional Memory. 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Savannah, Georgia, USA, 2009.
. Online Topological Ordering. Symposium on Discrete Algorithms (SODA), New York, New York, 2009.
2008
. Failure detectors as type boosters. 17th International Conference on Distributed Computing, SORRENTO, ITALY, 2008.
. A scalable and oblivious atomicity assertion. 19th International Conference on Concurrency Theory, Toronto, CANADA, Lecture Notes In Computer Science, 2008.
A General Characterization of Indulgence, in Acm Transactions On Autonomous And Adaptive Systems, vol. 3, p. -, 2008.
. On Fault Tolerance and Wireless Networks. 27th Annual ACM Symposium on Principles of Distributed Computing, Toronto, CANADA, 2008.
. Dynamic Prediction based Scheduling for TM. , 2008.
The Semantics of Progress in Lock-Based Transactional Memory, 2008.
Reconfigurable Distributed Storage for Dynamic Networks, in Journal of Parallel and Distributed Computing, 2008.
. Toward a Theory of Input Acceptance for Transactional Memories. 12th International Conference On Principles Of DIstributed Systems, Luxour, Egypt, Lecture Notes in Computer Science, 2008.
. SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems . Seventh European Dependable Computing Conference, Kaunas, Lithuania, 2008.
. A Fast Distributed Slicing Algorithm. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, 2008.
. Distributed Churn Measurement for Arbitrary Networks. Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, 2008.
. Abstractions for asynchronous distributed computing with malicious players. EPFL, Lausanne, 2008.
. Self-Stabilizing Mobile Robot Formations with Virtual Nodes. 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Dearborn, Michigan, 2008.
. Reflexes: programming abstractions for highly responsive computing in Java. EPFL, Lausanne, 2008.
. How to solve consensus in the smallest window of synchrony. 22nd International Symposium on Distributed Computing, Arcachon, France, 2008.
. Permissiveness in Transactional Memories. DISC 2008, Arcachon, France, 2008.
. Optimistic Erasure-Coded Distributed Storage. DISC 2008, Arcachon, France, 2008.
. The Weakest Failure Detector for Message Passing Set-Agreement. DISC 2008, Arcachon, France, 2008.
. Completeness and Nondeterminism in Model Checking Transactional Memories. Concur 2008, 2008.
Stretching Transactional Memory, 2008.
A Topological Treatment of Early-Deciding Set-Agreement, in Theoretical Computer Science Journal, 2008.
. Sharing is Harder than Agreeing. ACM Conference on Principles of Distributed Computing, 2008.
On Obstruction-Free Transactions, 2008.
A Scalable and Oblivious Atomicity Assertion, 2008.
. On the Complexity of Asynchronous Gossip. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, 2008.
. Virtual Infrastructure for Collision-Prone Wireless Networks. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, 2008.
. Secure Communication Over Radio Channels. 27th Annual Symposium on Principles of Distributed Computing, Toronto, Canada, 2008.
The gap in circumventing the impossibility of consensus, in Journal of Computer and System Sciences, vol. 74, p. 823-830, 2008.
Gossiping Capabilities, 2008.
Toward a Theory of Input Acceptance for Transactional Memories, 2008.
The Next 700 BFT Protocols, 2008.
. On Obstruction-Free Transactions. 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, 2008.
. Partial Snapshot Objects. 20th ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, 2008.
. Flexible Task Graphs:Unified Restricted Thread Programming Model for Java. ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), 2008.
. Dividing Transactional Memories by Zero. Transact, Salt Lake City, Utah, USA, 2008.
. Model Checking Transactional Memories. ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI), 2008.
Optimistic Erasure Coded Distributed Storage, 2008.
. The complexity of reliable distributed storage. EPFL, Lausanne, 2008.
. On the Correctness of Transactional Memory. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'08), Salt Lake City, Utah, USA, 2008.
. Extensible Encoding of Type Hierarchies. ACM Symposium on Principles of Programming Languages (POPL), 2008.
2007
The Collective Memory of Amnesic Processes, accepted in ACM Transactions on Algorithms (TALG), 2007.
. From unreliable objects to reliable objects: The case of atomic registers and consensus. 9th International Conference on Parallel Computing Technologies, Pereslavl Zalessky, RUSSIA, Lecture Notes In Computer Science, 2007.
The Weakest Failure Detectors to Boost Obstruction-Freedom, in Distributed Computing, 2007.
. Secretive Birds: Privacy in Population Protocols. 11th International Conference On Principles Of Distributed Systems (OPODIS'07), 2007.
A Generic Theoretical Framework for Modeling Gossip-Based Algorithms, in ACM SIGOPS Operating Systems Review, vol. 41, num. 5, p. 19-27, 2007.
Even Small Birds are Unique: Population Protocols with Identifiers, 2007.
Anonymous and Fault-Tolerant Shared-Memory Computing, in Distributed Computing, 2007.
. Amnesic Distributed Storage. , 2007.
. On the Message Complexity of Indulgent Consensus. Symposium on Distributed Computing (DISC'07), Lemesos, Cyprus, Lecture Notes in Computer Science 4731, 2007.
. Gossiping in a Multi-Channel Radio Network (An Oblivious Approach to Coping With Malicious Interference). Symposium on Distributed Computing (DISC'07), Lemesos, Cyprus, Lecture Notes in Computer Science 4731, 2007.
How robust are gossip-based communication protocols?, in Operating Systems Review, 2007.
The Perfectly-Synchronized Round-based Model of Distributed Computing, in Information & Computation, vol. 205, num. 5, p. 783-815, 2007.
Gossip-Based Peer Sampling, in ACM Transactions on Computer Systems, 2007.
A Smooth Concurrency Revolution with Free Objects, in Internet Computing, vol. 11, num. 4, p. 84.87, 2007.
. On The Weakest Failure Detector Ever. 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, Oregon, USA, 2007.
. Efficient Distributed Subtyping Tests. ACM/IEEE/Usenix International Conference on Distributed Event-Based Systems (DEBS'07), Toronto, 2007.
. StreamFlex - High-throughput Stream Programming in Java. 2007 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Application (OOPSLA), 2007.
Opacity: A Correctness Condition for Transactional Memory, 2007.
The Time-Complexity of Local Decision in Distributed Agreement, in SIAM Journal on Computing, 2007.
. Refined Quorum Systems. 26th ACM Symposium on Principles of Distributed Computing (PODC'07), Portland, Oregon, USA, 2007.
. The Weight-Watcher Service and its Lightweight Implementation. , 2007.
. Towards Fair Event Dissemination. , 2007.
. Pervasive Computing with Frugal Objects. , 2007.
. Reflexes: Abstractions for Highly Responsive Systems. Third International ACM SIGPLAN/SIGOPS Conference on Virtual Execution Environments, San Diego, USA, 2007.
. STMBench7: A Benchmark for Software Transactional Memory. Second European Systems Conference EuroSys2007, Lisboa, Portugal, 2007.
. A High Throughput Atomic Storage Algorithm. The 27th IEEE International Conference on Distributed Computing Systems (ICDCS'07), Toronto, Canada, 2007.
Pervasive Computing with Frugal Objects, 2007.
Refined Quorum Systems, 2007.
2006
. Frugal Mobile Objects. , 2006.
. A Topological Treatment of Early-Deciding Set-Agreement. OPODIS 2006, Bordeaux, France, 2006.
. Of Malicious Motes and Suspicious Sensors. OPODIS 2006, Bordeaux, France, 2006.
The Overhead of Indulgent Failure Recovery, in Distributed Computing, 2006.
STMBench7: A Benchmark for Software Transactional Memory, 2006.
. The Weakest Failure Detectors to Boost Obstruction-Freedom. 20th International Symposium on Distributed Computing (DISC'06), Stockholm, Sweden, Lecture Notes in Computer Science LNCS 4167, 2006.
Community-Aware Event Dissemination, 2006.
. A General Characterization of Indulgence (Invited Paper). Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006), Dallas, Texas, USA, 2006.
. Unconscious Eventual Consistency with Gossips. Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006), Dallas, Texas, USA, 2006.
. Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems . ACM SIGOPS EuroSys Conference, Leuven , Belgium, 2006.
. GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists principles. IEEE International Conference on Peer-to-Peer Computing, Cambridge, UK, 2006.
Boosting Obstruction-Freedom with Low Overhead, 2006.
. Type-based event dissemination. EPFL, Lausanne, 2006.
. Transformations in distributed computations and applications to set agreement. EPFL, Lausanne, 2006.
. How Fast Can a Very Robust Read Be?. 25th ACM Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, USA, 2006.
. Synchronizing without Locks is Inherently Expensive. 25th ACM Symposium on Principles of Distributed Computing (PODC'06), Denver, Colorado, USA, 2006.
How Fast Can a Very Robust Read Be?, 2006.
. Looking Ahead in Open Multithreaded Transactions. , 2006.
. Lucky Read/Write Access to Robust Atomic Storage. IEEE International Conference on Dependable Systems and Networks (DSN '06), Philadelphia, PA, USA, 2006.
. High Throughput Total Order Broadcast for Cluster Environments. IEEE International Conference on Dependable Systems and Networks (DSN 2006), Philadelphia, PA, USA, 2006.
The Weakest Failure Detectors to Boost Obstruction-Freedom, 2006.
Distributed Subtyping, 2006.
. When Birds Die: Making Population Protocols Fault-tolerant. 2006 ACM/IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS '06), 2006.
. Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks. 10th International Conference on Principles of Distributed Systems, Bordeaux, FRANCE, 2006.
2005
. Frugal Event Dissemination in a Mobile Environment. Middleware, Grenoble, 2005.
. Dynamic and fault-tolerant cluster management. Fith IEEE International Conference on Peer-to-Peer Computing, Konstanz, 2005.
Frugal Mobile Objects, 2005.
Tolerating Arbitrary Failures with State Machine Replication, in Dependable Computing Systems, Wiley Series on Parallel and Distributed Computing, 2005.
. (Almost) All Objects are Universal in Message Passing Systems. 19th International Symposium on Distributed Computing (DISC'05), 2005.
. Robust Contention Management in Software Transactional Memory. , 2005.
. Polymorphic Contention Management. , Lecture Notes in Computer Science, 2005.
. Towards a Theory of Transactional Contention Managers. , 2005.
. From a Static Impossibility to an Adaptive Lower Bound: the Complexity of Early Deciding Set Agreement. , 2005.
Lucky Read/Write Access to Robust Atomic Storage, 2005.
How Fast can a Distributed Atomic Read be?, 2005.
. Computing with Reads and Writes in the Absence of Step Contention. 19th International Symposium on Distributed Computing (DISC'05), 2005.
. On the Impossibility of Boosting Distributed Service Resilience. IEEE International Conference on Distributed Computing Systems (ICDCS 2005), 2005.
. Reducing Fair Exchange to Atomic Commit. European Conference on Dependable Computing (EDCC 2005), 2005.
The Inherent Price of Indulgence, in Distributed Computing, vol. 18, num. 1, p. 85-98, 2005.
. Large scale selective event dissemination. EPFL, Lausanne, 2005.
. Synchronization using failure detectors. EPFL, Lausanne, 2005.
. Time-complexity bounds on agreement problems. EPFL, Lausanne, 2005.
2004
. Looking Ahead in Open Multithreaded Transactions. , 2004.
. How fast can a distributed atomic read be?. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC'04), St. John's, Newfoundland, Canada, 2004.
. Robust Emulations of Shared Memory in a Crash-Recovery Model . 24th IEEE International Conference on Distributed Computing Systems (ICDCS'04), Tokyo, Japan, 2004.
From Epidemics to Distributed Computing, in IEEE Computer, vol. 37, num. 5, p. 60-67, 2004.
Distributed programming with typed events, in IEEE Software, vol. 21, num. 2, p. 56 - 64, 2004.
. The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. PODC 04, 2004.
. Delta-Reliability: A Probabilistic Measure of Broadcast Reliability. ICDCS 2004, 2004.
. Linguistic Support for Distributed Programming Abstractions. ICDCS 2004, 2004.
. The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. ACM/IFIP/USENIX 5th International Middleware Conference, 2004.
The weakest failure detectors to solve Quittable Consensus and Non-Blocking Atomic Commit, 2004.
. Exploiting Semantic Clustering in the eDonkey P2P Network. ACM SIGOPS European Workshop 2004, 2004.
. BGP-based Clustering for Scalable and Reliable Gossip Broadcast. Global Computing 2004 workshop, 2004.
The Information Structure of Indulgent Consensus, in IEEE Transaction on Computers, vol. 53, num. 4, p. 453-466, 2004.
Fast non-blocking atomic commit: an inherent trade-off, in Information Processing Letter, vol. 91, num. 4, p. 195-200, 2004.
. The complexity of eary deciding set agreement: how can topology help?. , 2004.
. The Driving Philosophers. , 2004.
. Data-Aware Multicast. , 2004.
. The Driving Philosophers. , 2004.
The Complexity of Asynchronous Byzantine Consensus, 2004.
What Can Be Implemented Anonymously?, 2004.
GosSkip: a Gossip-based Structured Overlay Network for Efficient Content-based Filtering, 2004.
From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement, 2004.
Mobility Friendly Publish/Subscribe, 2004.
The Overhead of Consensus Failure Recovery, 2004.
The CHT Play, 2004.
Fast Non-Blocking Atomic Commit: An Inherent Trade-off, 2004.
The Gap in Circumventing the Consensus Impossibility, 2004.
Gracefully Degrading Fair Exchange with Security Modules, 2004.
2003
. Dealing with Uncertainty in Mobile Publish/Subscribe Middleware. Middleware for Pervasive and Ad-Hoc Computing 2003, 2003.
Fair Exchange, in The Computer Journal, vol. 46, num. 1, p. 55, 2003.
Supporting Fair Exchange in Mobile Environments, in Mobile Networks and Applications, vol. 8, num. 2, p. 127, 2003.
. Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks. Infocom 2003, 2003.
. Time-Efficient Self-Stabilizing Algorithms through Hierarchical Structures. Self-Stabilizing Systems 2003, 2003.
. PAN: Providing Reliable Storage in Mobile Ad Hoc Networks with Probabilistic Quorum Systems. MobicHoc 2003, 2003.
From Fault-Tolerance to Security and Back, in IEEE Distributed Systems Online, vol. 4, num. 9, 2003.
. Supporting Mobility in Content-Based Publish/Subscribe Middleware. Middleware 2003, Rio de Janeiro, Brazil, 2003.
. Dependability Issues of Pervasive Computing in a Healthcare Environment. SPC'03, Boppard, Germany, 2003.
. Mobile Databases: A Report on Open Issues and Research Directions. ACM SIGMOD, 2003.
A Note on Set Agreement with Omission Failures, in Electronic Notes in Theoretical Computing Science, vol. 81, 2003.
. Distributed Programming for Dummies: A Shifting Transformation Technique. , 2003.
. Using the Topological Characterization of Synchronous Models. , 2003.
. Tight Lower Bounds on Early Local Decisions in Uniform Consensus. , 2003.
. Pragmatic Type Interoperability. , 2003.
. An Equational Theory for Transactions. , 2003.
Finally the Weakest Failure Detector for Non-Blocking Atomic Commit, 2003.
Shared Memory vs Message Passing, 2003.
What Good are Probabilistic Specifications and What Probabilistic Specifications are Good?, , 2003.
Lazy Parameter Passing, 2003.
Data-Aware Multicast, 2003.
Distributed Reliable Object-Oriented Programming (DROOP), 2003.
Distributed Programming for Dummies: A Shifting Transformation Technique, 2003.
On Failure Detectors and Type Boosters, 2003.
The Weakest Failure Detector for Non-Blocking Atomic Commit, 2003.
Probabilistic Guarantees and Algorithms for Ad Hoc Networks, , 2003.
A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms, 2003.
Early Local Decisions in Distributed Agreement, 2003.
Automating the Addition of Fail-Safe Fault-Tolerance: Beyond Fusion-Closed Specifications, 2003.
Byzantine Failures and Security: Arbitrary is not (always) Random, 2003.
Dynamic Proxies for Classes: Towards Type-Safe and Decoupled Remote Object Interaction, 2003.
Supporting Mobility in Content-Based Publish/Subscribe Middleware, 2003.
Pragmatic Type Interoperability, 2003.
Atomic Probabilistic Broadcast, 2003.
Lightweight Probabilistic Broadcast, in ACM Transactions on Computer Systems, vol. 21, num. 4, p. 341-374, 2003.
. The many faces of publish/subscribe. , 2003.
2002
. On the Consistency Problem in Mobile Distributed Computing. POMC 2002, Toulouse, France, 2002.
. An Efficient Universal Construction for Message-Passing Systems. , 2002.
. Abstracting Remote Object Interaction in a Peer-2-Peer Environment. , 2002.
. OS Support for P2P: a Case for TPS. International Conference on Distributed Computing Systems, Vienna, 2002.
Revisiting Liveness Properties in the Context of Secure Systems, 2002.
On Systematic Design of Fast and Perfect Detectors, 2002.
The LEAF Platform: Incremental Enhancements for the J2EE, 2002.
Fast Indulgent Consensus with Zero Degradation, 2002.
Failure Detection Lower Bounds on Registers and Consensus<br />(Preliminary Version), 2002.
An Efficient Universal Construction for Message-Passing<br />Systems, 2002.
Mutual Exclusion in Asynchronous Systems with Failure<br />Detectors, 2002.
On the Weakest Failure Detector for Non-Blocking Atomic Commit., 2002.
Event Systems : How to Have Your Cake and Eat It Too, 2002.
AOP: Does it Make Sense ? The Case of Concurrency and Failures, 2002.
OS Support for P2P Programming: a Case for TPS, 2002.
2001
. Network Membership: A Partition Model for Reliable Mobile Communication. ICPADS'01, 2001.
Democratizing the Parliament, 2001.
Abstractions for Distributed Programming: Guests or Relatives?, 2001.
Hierarchical Probabilistic Multicast, 2001.
Reliable and Total Order Broadcast in the Crash-Recovery Model, 2001.
Asynchronous Leasing, 2001.
Linguistic Support for Large-Scale Distributed Programming, 2001.
Democratrizing the Parliament, 2001.
Deconstructing Paxos, 2001.
Open Consensus, 2001.
Effective Multicast Programming in Large Scale Distributed Systems, 2001.
Delta-Reliability, 2001.
X-ability: A Theory of Replication, in Distributed Computing, vol. 14, num. 4, p. 231-249, 2001.
. Type-based publish/subscribe. EPFL, Lausanne, 2001.
. Reliable and total order broadcast in the crash-recovery model. EPFL, Lausanne, 2001.
2000
. Modular Abstractions for Devising Byzantine-Resilient State Machine Replication. SRDS 2000, 2000.
Patterns in SNMP-Based Management, 2000.
Type-Based Publish/Subscribe, 2000.
Making Consensus Practical, 2000.
Implementing e-Transactions with Asynchronous Replication, 2000.
Exactly-Once Transactions, 2000.
On the Hardness of Failure-Sensitive Agreement Problems, 2000.
. Indulgent Algorithms. Symposium on Principles of Distributed Computing, 2000.
Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction, 2000.
. Abstractions for Byzantine-resilient state machine replication. EPFL, Lausanne, 2000.
1999
What object-oriented distributed programming does not have to be, and what it may be, in Informatik, 1999.
Unkown year
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.