scientific article; zbMATH DE number 2006642

zbMath1024.68508MaRDI QIDQ4436038

Sebastiano Vigna, Paolo Boldi

Publication date: 23 November 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (20)

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

This page was built for publication: