Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Computing on an anonymous ring
Journal of the ACM (JACM)
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Calling names in nameless networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Distributed algorithms for locating centers and medians in communication networks
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Tissue models, with programming problems from God's notebook.
ACM SIGBIO Newsletter - Special edition on biologically motivated computing
Tight lower bounds for probabilistic solitude verification on anonymous rings
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Compass permits leader election
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Computing on an anonymous ring
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Randomized initialization protocols for radio networks
Handbook of wireless networks and mobile computing
The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Unbounded speed variability in distributed communication systems
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed Computing on Regular Networks with Anonymous Nodes
IEEE Transactions on Computers
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Complexity of graph covering problems
Nordic Journal of Computing
An Effective Characterization of Computability in Anonymous Networks
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
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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
Generalized H-Coloring and H-Covering of Trees
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Universal dynamic synchronous self-stabilization
Distributed Computing
Distributed algorithms for synchronizing interprocess communication within real time
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Distributed multi-destination routing: The constraints of local information
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Real time resource allocation in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computing on anonymous networks with sense of direction
Theoretical Computer Science
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Analysis of a randomized rendezvous algorithm
Information and Computation
Tight Space Self-stabilizing Uniform l-Mutual Exclusion
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Generalized H-coloring and H-covering of trees
Nordic Journal of Computing
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Leader election in plane cellular automata, only with left-right global convention
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Self-stabilizing token circulation in uniform networks
Distributed Computing
Locally guided randomized elections in trees: the totally fair case
Information and Computation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Naming symmetric processes using shared variables
Distributed Computing
A complete complexity classification of the role assignment problem
Theoretical Computer Science - Graph colorings
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Broadcast in the rendezvous model
Information and Computation
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
Digital Products, Wedges, and Covering Spaces
Journal of Mathematical Imaging and Vision
Cantor-Bernstein type theorem for locally constrained graph homomorphisms
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Multilateral Ranking Negotiations
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Universal Semi-local Election Protocol Using Forward Links
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
Compositional Systems over Reducible Networks
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Local Properties of Triangular Graphs
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
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
Election and rendezvous with incomparable labels
Theoretical Computer Science
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
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Mobile Agents Implementing Local Computations in Graphs
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Rendezvous of Mobile Agents When Tokens Fail Anytime
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Computing on a partially eponymous ring
Theoretical Computer Science
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Tight Local Approximation Results for Max-Min Linear Programs
Algorithmic Aspects of Wireless Sensor Networks
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
A simple local 3-approximation algorithm for vertex cover
Information Processing Letters
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Proceedings of the 28th ACM symposium on Principles of distributed computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Electronic Notes in Theoretical Computer Science (ENTCS)
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-local Model of Computations on Graphs to Break the Local Symmetry
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
Uniform election in trees and polyominoids
Discrete Applied Mathematics
The computational complexity of the role assignment problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Deterministic leader election in anonymous sensor networks without common coordinated system
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Computing role assignments of chordal graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Distributed anonymous function computation in information fusion and multiagent systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Graph covers and quadratic minimization
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Comparing universal covers in polynomial time
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Local Computations on Triangular Graphs
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Computing role assignments of chordal graphs
Theoretical Computer Science
Rendezvous of mobile agents without agreement on local orientation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Algorithms and theory of computation handbook
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The universe of symmetry breaking tasks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The computational power of the W And GHZ States
Quantum Information & Computation
Cellular automata evolution of leader election
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Refinement-based verification of local synchronization algorithms
FM'11 Proceedings of the 17th international conference on Formal methods
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Improved distributed exploration of anonymous networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Election in the qualitative world
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Journal of Parallel and Distributed 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
Groupings and pairings in anonymous networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A knowledge-based analysis of global function computation
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
Matrix and graph orders derived from locally constrained graph homomorphisms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Exact quantum algorithms for the leader election problem
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Algorithms for comparability of matrices in partial orders imposed by graph homomorphisms
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Fair leader election by randomized voting
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
A simple randomized k-local election algorithm for local computations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Designing old and new distributed algorithms by replaying an incremental proof-based development
Rigorous Methods for Software Construction and Analysis
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Packing bipartite graphs with covers of complete bipartite graphs
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
Distributed maximal matching: greedy is optimal
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Lower bounds for local approximation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Compositional Systems over Reducible Networks
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Local Properties of Triangular Graphs
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
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
Universal Semi-local Election Protocol Using Forward Links
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Multilateral Ranking Negotiations
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Searching for pareto-optimal randomised algorithms
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Efficient distributed snapshots in an anonymous asynchronous message-passing system
Journal of Parallel and Distributed Computing
Lower bounds for local approximation
Journal of the ACM (JACM)
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science
Solving the parity problem in one-dimensional cellular automata
Natural Computing: an international journal
Amorphous computing: examples, mathematics and theory
Natural Computing: an international journal
Computing with infinitely many processes
Information and Computation
Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |
This paper attempts to get at some of the fundamental properties of distributed computing by means of the following question: “How much does each processor in a network of processors need to know about its own identity, the identities of other processors, and the underlying connection network in order for the network to be able to carry out useful functions?” The approach we take is to require that the processors be designed without any knowledge (or only very broad knowledge) of the networks they are to be used in, and furthermore, that all processors with the same number of communication ports be identical. Given a particular network function, e.g., setting up a spanning tree, we ask whether processors may be designed so that when they are embedded in any connected network and started in some initial configuration, they are guaranteed to accomplish the desired function.