scientific article; zbMATH DE number 2006642

zbMATH Open1024.68508MaRDI QIDQ4436038FDOQ4436038

Authors: Paolo Boldi, Sebastiano Vigna 

Publication date: 23 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800033.htm

Title of this publication is not available (Why is that?)

Recommendations

• Computing functions on asynchronous anonymous networks
• Computing on a partially eponymous ring
• Local Terminations and Distributed Computability in Anonymous Networks
• Computing on an anonymous ring
• scientific article; zbMATH DE number 4026814

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Cited In (25)

• Byzantine agreement with homonyms in synchronous systems
• The computational power of simple protocols for self-awareness on graphs
• Weak models of distributed computing, with connections to modal logic
• Drawing maps with advice
• Map construction of unknown graphs by multiple agents
• Byzantine agreement with homonyms
• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Hundreds of impossibility results for distributed computing
• On mobile agent verifiable problems
• Computing Boolean functions on anonymous networks
• Leader election in plane cellular automata, only with left-right global convention
• Computability in anonymous networks: revocable vs. irrecovable outputs
• Labelled (Hyper)Graphs, Negotiations and the Naming Problem
• The complexity of the distributed constraint satisfaction problem
• The computational power of population protocols
• Assigning labels in unknown anonymous networks (extended abstract)
• Snap-stabilizing tasks in anonymous networks
• Local Terminations and Distributed Computability in Anonymous Networks
• On the round complexity of Byzantine agreement without initial set-up
• Mapping simple polygons: how robots benefit from looking back
• Computing on a partially eponymous ring
• Efficient algorithms for anonymous Byzantine agreement
• A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• Relationships between broadcast and shared memory in reliable anonymous distributed systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436038)