The dynamic predicate stashing copy problem (Q4291476): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230230806 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049288353 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:43, 22 May 2024
scientific article; zbMATH DE number 566346
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The dynamic predicate stashing copy problem |
scientific article; zbMATH DE number 566346 |
Statements
The dynamic predicate stashing copy problem (English)
0 references
12 January 1995
0 references
distributed computer networks
0 references
dynamic predicate stashing copy problem
0 references
