Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (Q5176217): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1835698.1835798 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967345158 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Elastic Transactions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toward a theory of transactional contention managers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Software transactional memory / rank | |||
Normal rank | |||
Latest revision as of 18:17, 9 July 2024
scientific article; zbMATH DE number 6410445
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier |
scientific article; zbMATH DE number 6410445 |
Statements
Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (English)
0 references
2 March 2015
0 references
Byzantine agreement
0 references
consensus
0 references
distributed computing
0 references
Monte Carlo algorithms
0 references
peer-to-peer
0 references
samplers
0 references
secret-sharing
0 references
