Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The proactive security toolkit and applications
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Stability of long-lived consensus (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Phase Clocks for Transient Fault Repair
IEEE Transactions on Parallel and Distributed Systems
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
Distributed probabilistic polling and applications to proportionate agreement
Information and Computation
Distributed computation of web queries using automata
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space-optimal multi-writer snapshot objects are slow
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Collaborative Group Membership
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
On Group Communication Systems: Insight, a Primer, and a Snapshot
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
ATOM - Active Totally Ordered Multicast
IWAN '00 Proceedings of the Second International Working Conference on Active Networks
Parallel and Distributed Solutions for the Optimal Binary Search Tree Problem
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Measurement Based Modeling of Quality of Service in the Internet: A Methodological Approach
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The Agreement Problem Protocol Verification Environment
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Transformations of Self-Stabilizing Algorithms
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Distributed Probabilistic Polling and Applications to Proportionate Agreement
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Revisiting Safety and Liveness in the Context of Failures
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Integrating Optimistic Virtual Synchrony to a CORBA Object Group Service
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Issues in the Refinement of Distributed Programs
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Bounding Lamport's Bakery Algorithm
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Membrane Systems and Distributed Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Adaptive and efficient mutual exclusion
Distributed Computing
A tight time lower bound for space-optimal implementations of multi-writer snapshots
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Synchronous Consensus for Dependent Process Failures
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Stability of long-lived consensus
Journal of Computer and System Sciences
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Deterministic computations on a PRAM with static processor and memory faults
Fundamenta Informaticae
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Mathematical Structures in Computer Science
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
A weakest failure detector-based asynchronous consensus protocol for f
Information Processing Letters
How fast can a distributed atomic read be?
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Formalization and strictness of simulation event orderings
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Leader election in plane cellular automata, only with left-right global convention
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
Resilient-optimal interactive consistency in constant time
Distributed Computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
An object replication algorithm for real-time distributed databases
Distributed and Parallel Databases
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Sharing Variables in Distributed Memory
Fundamenta Informaticae
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Transformations of self-stabilizing algorithms
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
IEEE Transactions on Parallel and Distributed Systems
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
The collective memory of amnesic processes
ACM Transactions on Algorithms (TALG)
On the interconnection of message passing systems
Information Processing Letters
Message and time efficient consensus protocols for synchronous distributed systems
Journal of Parallel and Distributed Computing
RFID-based networks: exploiting diversity and redundancy
ACM SIGMOBILE Mobile Computing and Communications Review
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
Design and analysis of an adaptive object replication algorithm in distributed network systems
Computer Communications
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A Scalable and Oblivious Atomicity Assertion
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Optimizing Threshold Protocols in Adversarial Structures
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A self-stabilizing autonomic recoverer for eventual Byzantine software
Journal of Systems and Software
Gossiping by processors prone to omission failures
Information Processing Letters
Electronic Notes in Theoretical Computer Science (ENTCS)
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
DR: Divided Ring Leader Election Algorithm
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Group mutual exclusion algorithms based on ticket orders
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A 1-strong self-stabilizing transformer
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Future directions in distributed computing
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks
The Journal of Supercomputing
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Necessary and sufficient conditions for 1-adaptivity
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The complexity of robust atomic storage
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph
Proceedings of the 49th Annual Southeast Regional Conference
A non-topological proof for the impossibility of k-set agreement
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Labeling schemes for tree representation
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A bridge between the asynchronous message passing model and local computations in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Early-stopping k-set agreement in synchronous systems prone to any number of process crashes
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Two absolute bounds for distributed bit complexity
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On the impact of serializing contention management on STM performance
Journal of Parallel and Distributed Computing
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Deterministic Computations on a PRAM with Static Processor and Memory Faults
Fundamenta Informaticae
Sharing Variables in Distributed Memory
Fundamenta Informaticae
From unreliable objects to reliable objects: the case of atomic registers and consensus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Distributed local 2-connectivity test of graphs and applications
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
On byzantine broadcast in loosely connected networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
A non-topological proof for the impossibility of k-set agreement
Theoretical Computer Science
| Hi-index | 0.01 |