edoc-Server
metadata only
CC BY 4.0
Topological characterization of simplex agreement
Mit dem Asynchronous Computability Theorem von Herlihy und Shavit wurden topologische Werkzeuge systematisch in der Theorie des verteilten Rechnens etabliert. Besonders häufig wurden sie zur Untersuchung von verteilten Aufgaben wie dem Approximate Agreement in asynchronen Systemen, die auf einem gem
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Consistency of System Changes and the Origins of Complexity#92746
- Consistency of System Changes and the Origins of Complexity#87574
- Consistency of System Changes and the Origins of Complexity#77326
- Experiments in network clock synchronization#502778
- Zwischen Staub und Code#691432
Record · ID 1399006
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive