Home › Entities › academia › Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t<n/3$$ t < n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time

Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t<n/3$$ t < n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time

Research article (Acta Informatica, 2016) · cited 33× · AI/ML
academia openalex:W2343310721
Press Enter · cited answer in seconds

Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t<n/3$$ t < n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time

Summary

Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t<n/3$$ t < n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time is a scholarly article[1].

Key Facts

  • Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t<n/3$$ t < n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time's instance of is recorded as scholarly article[2].

Related Entities

Michel Raynal

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t&lt;n/3$$ t &lt; n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time. Retrieved May 24, 2026, from https://4ort.xyz/entity/signature-free-asynchronous-byzantine-systems-from-multivalued-to-binary-consensus-with-t-lt-n-3-t-lt-n-3-o-n-2-o-n-2-me
MLA “Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t&lt;n/3$$ t &lt; n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/signature-free-asynchronous-byzantine-systems-from-multivalued-to-binary-consensus-with-t-lt-n-3-t-lt-n-3-o-n-2-o-n-2-me.
BibTeX @misc{4ortxyz_signature-free-asynchronous-byzantine-systems-from-multivalued-to-binary-consensus-with-t-lt-n-3-t-lt-n-3-o-n-2-o-n-2-me_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t&lt;n/3$$ t &lt; n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time}}, year = {2026}, url = {https://4ort.xyz/entity/signature-free-asynchronous-byzantine-systems-from-multivalued-to-binary-consensus-with-t-lt-n-3-t-lt-n-3-o-n-2-o-n-2-me}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t&lt;n/3$$ t &lt; n / 3 , $$O(n^2)$$ O ( n 2 ) messages, and constant time — https://4ort.xyz/entity/signature-free-asynchronous-byzantine-systems-from-multivalued-to-binary-consensus-with-t-lt-n-3-t-lt-n-3-o-n-2-o-n-2-me (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/signature-free-asynchronous-byzantine-systems-from-multivalued-to-binary-consensus-with-t-lt-n-3-t-lt-n-3-o-n-2-o-n-2-me · Last refreshed: