DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Characterization of Families of Graphs in Which Election Is Possible
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Termination Detection of Distributed Algorithms by Graph Relabelling Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Analysis of a randomized rendezvous algorithm
Information and Computation
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
A self-stabilizing algorithm for maximal 2-packing
Nordic Journal of Computing
Locally guided randomized elections in trees: the totally fair case
Information and Computation
Artificial Intelligence - Special issue: Distributed constraint satisfaction
More efficient on-the-fly LTL verification with Tarjan's algorithm
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Broadcast in the rendezvous model
Information and Computation
Cost distribution of the Chang-Roberts leader election algorithm and related problems
Theoretical Computer Science
Network patterns in cfengine and scalable data aggregation
LISA'07 Proceedings of the 21st conference on Large Installation System Administration Conference
Passive Localization: Large Size Sensor Network Localization Based on Environmental Events
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
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
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Leader election algorithm using heap structure
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Developing topology discovery in Event-B
Science of Computer Programming
Gossiping for threshold detection
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Making Population Protocols Self-stabilizing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Algon: From Interchangeable Distributed Algorithms to Interchangeable Middleware
Electronic Notes in Theoretical Computer Science (ENTCS)
Locally guided randomized elections in trees: The totally fair case
Information and Computation
Broadcast in the rendezvous model
Information and Computation
Mobile agent systems and cellular automata
Autonomous Agents and Multi-Agent Systems
From self- to snap- stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A method for evaluating efficiency of protocols on the asynchronous shared-state model
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Snap-stabilizing waves in anonymous networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: asynchronous bounded expected delay networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Model-based engineering for dynamic reconfiguration in DRTES
Proceedings of the Fourth European Conference on Software Architecture: Companion Volume
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
Algorithms and theory of computation handbook
Theory of communication networks
Algorithms and theory of computation handbook
Leader election in anonymous radio networks: model checking energy consumption
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
DISC'10 Proceedings of the 24th international conference on Distributed computing
A high-level framework for distributed processing of large-scale graphs
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
An energy efficient framework for mobile target tracking in sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Benchmarking hybrid algorithms for distributed constraint optimisation games
Autonomous Agents and Multi-Agent Systems
HipG: parallel processing of large-scale graphs
ACM SIGOPS Operating Systems Review
Resource-aware junction trees for efficient multi-agent coordination
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
State/event-based LTL model checking under parametric generalized fairness
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Dynamic coalition adaptation for efficient agent-based virtual power plants
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
Computing time complexity of population protocols with cover times: the zebranet example
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing labeling and ranking in ordered trees
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Graph labelings derived from models in distributed computing
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A snap-stabilizing DFS with a lower space requirement
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Snap-Stabilizing detection of cutsets
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Local computations on closed unlabelled edges: the election problem and the naming problem
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
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
The Knowledge Engineering Review
Snap-stabilizing depth-first search on arbitrary networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A distributed algorithm to find hamiltonian cycles in g(np) random graphs
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Finding a path to model consistency
ECMDA-FA'06 Proceedings of the Second European conference on Model Driven Architecture: foundations and Applications
A new polynomial silent stabilizing spanning-tree construction algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The first fully polynomial stabilizing algorithm for BFS tree construction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Information Processing Letters
Pattern-Based Composition and Analysis of Virtually Synchronized Real-Time Distributed Systems
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Towards distributed verification of petri nets properties
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
A simple distributed algorithm for the maintenance of a spanning tree
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Derivation of distributed programs in the theory of owicki and gries: an example
IWFM'03 Proceedings of the 6th international conference on Formal Methods
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
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
From clarity to efficiency for distributed algorithms
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Distributed local 2-connectivity test of graphs and applications
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
New solutions for disjoint paths in P systems
Natural Computing: an international journal
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Fast distributed DFS solutions for edge-disjoint paths in digraphs
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Theoretical Computer Science
Synthesis of real-time applications for internet of things
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Brief announcement: techniques for programmatically troubleshooting distributed systems
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Self-stabilizing labeling and ranking in ordered trees
Theoretical Computer Science
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Theoretical Computer Science
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization
Journal of Parallel and Distributed Computing
Information and Computation
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
From the Publisher:The second edition of this textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers." "The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications and fault tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still developing topics.