A Theory of Bounded Fair Scheduling (Q5505612): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Propositional dynamic logic of looping and converse is elementarily decidable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Creol: A type-safe object-oriented model for distributed concurrent systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Impossibility of distributed consensus with one faulty process / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3680242 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3998976 / rank | |||
Normal rank | |||
Latest revision as of 00:52, 29 June 2024
scientific article; zbMATH DE number 5498399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Theory of Bounded Fair Scheduling |
scientific article; zbMATH DE number 5498399 |
Statements
A Theory of Bounded Fair Scheduling (English)
0 references
27 January 2009
0 references
