scientific article; zbMATH DE number 1559553
From MaRDI portal
Publication:4527005
zbMath0974.68011MaRDI QIDQ4527005
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Network protocols (68M12)
Related Items (4)
Two absolute bounds for distributed bit complexity ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Exact communication costs for consensus and leader in a tree
This page was built for publication:
