Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Time-space tradeoffs for implementations of snapshots
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
BTS: a Byzantine fault-tolerant tuple space
Proceedings of the 2006 ACM symposium on Applied computing
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
Tight bounds for asynchronous randomized consensus
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Efficient fork-linearizable access to untrusted shared memory
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Two absolute bounds for distributed bit complexity
Theoretical Computer Science
Time lower bounds for implementations of multi-writer snapshots
Journal of the ACM (JACM)
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Transforming general networks into feed-forward by using turn-prohibition
Computer Communications
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
OCD: obsessive consensus disorder (or repetitive consensus)
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
Space efficient and time optimal distributed BFS tree construction
Information Processing Letters
About the Termination Detection in the Asynchronous Message Passing Model
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Constant-Space Localized Byzantine Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The Synchronization Power of Coalesced Memory Accesses
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Limit to the Power of Multiple Nucleation in Self-assembly
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
From adaptive renaming to set agreement
Theoretical Computer Science
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Defining weakly consistent Byzantine fault-tolerant services
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
The complexity of obstruction-free implementations
Journal of the ACM (JACM)
Non-blocking programming on multi-core graphics processors: (extended asbtract)
ACM SIGARCH Computer Architecture News
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair Model Checking with Process Counter Abstraction
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Model Checking Linearizability via Refinement
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
PACISSO: P2P access control incorporating scalability and self-organization for storage systems
PACISSO: P2P access control incorporating scalability and self-organization for storage systems
On the Expressiveness of Probabilistic and Prioritized Data-retrieval in Linda
Electronic Notes in Theoretical Computer Science (ENTCS)
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
N-consensus is the second strongest object for N + 1 processes
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Highly-concurrent multi-word synchronization
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Multi-sided shared coins and randomized set-agreement
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: byzantine agreement with homonyms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Help when needed, but no more: efficient read/write partial snapshot
DISC'09 Proceedings of the 23rd international conference on Distributed computing
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Towards efficient designs for in-network computing with noisy wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
The inherent complexity of transactional memory and what to do about it
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Eventually linearizable shared objects
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed acceleration of mobile radio network optimisation algorithms
WTS'10 Proceedings of the 9th conference on Wireless telecommunications symposium
When consensus meets self-stabilization
Journal of Computer and System Sciences
The failure detector abstraction
ACM Computing Surveys (CSUR)
The x-wait-freedom progress condition
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Fast asynchronous consensus with optimal resilience
DISC'10 Proceedings of the 24th international conference on Distributed computing
A fault-resistant asynchronous clock function
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Low memory distributed protocols for 2-coloring
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On the automated implementation of time-based paxos using the IOA compiler
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Highly concurrent multi-word synchronization
Theoretical Computer Science
Invited paper: the inherent complexity of transactional memory and what to do about it
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Load balanced scalable Byzantine agreement through quorum building, with full information
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Distributed agreement in tile self-assembly
Natural Computing: an international journal
Scalable automatic linearizability checking
Proceedings of the 33rd International Conference on Software Engineering
Relational transducers for declarative networking
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Performance evaluation of distributed database on PC cluster computers
WSEAS Transactions on Computers
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On the performance of a retransmission-based synchronizer
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Randomized consensus in expected O(n2) total work using single-writer registers
DISC'11 Proceedings of the 25th international conference on Distributed computing
Structured derivation of semi-synchronous algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
The complexity of updating multi-writer snapshot objects
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Self-stabilizing leader election for single-hop wireless networks despite jamming
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Polylogarithmic concurrent data structures from monotone circuits
Journal of the ACM (JACM)
Netlog, a rule-based language for distributed programming
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Built-in coloring for highly-concurrent doubly-linked lists
DISC'06 Proceedings of the 20th international conference on Distributed Computing
The weakest failure detectors to boost obstruction-freedom
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Constructing shared objects that are both robust and high-throughput
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Computing with reads and writes in the absence of step contention
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Optimal clock synchronization under energy constraints in wireless ad-hoc networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On the implementation of concurrent objects
Dependable and Historic Computing
Triggering cascades on undirected connected graphs
Information Processing Letters
The renaming problem in shared memory systems: An introduction
Computer Science Review
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
From clarity to efficiency for distributed algorithms
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Oblivious assignment with m slots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Computability in distributed computing: a Tutorial
ACM SIGACT News
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
More anti-chain based refinement checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Journal of the ACM (JACM)
Relational transducers for declarative networking
Journal of the ACM (JACM)
Insertion and querying mechanism for a distributed XML database system
Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies
A distributed algorithm for gathering many fat mobile robots in the plane
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Multidimensional approximate agreement in Byzantine asynchronous systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Byzantine agreement in polynomial expected time: [extended abstract]
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the power of breakable objects
Theoretical Computer Science
Lightweight contention management for efficient compare-and-swap operations
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Proceedings of the 2013 ACM workshop on Domain-specific modeling
On the performance of a retransmission-based synchronizer
Theoretical Computer Science
Theoretical Computer Science
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
A simple Byzantine Generals protocol
Journal of Combinatorial Optimization
| Hi-index | 0.01 |