𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Practical Constructive Schemes for Deterministic Shared-Memory Access

✍ Scribed by A. Pietracaprina

Book ID
105915240
Publisher
Springer
Year
1997
Tongue
English
Weight
362 KB
Volume
30
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallelizing the construction of indire
Parallelizing the construction of indirect access arrays for shared-memory machines
✍ TuszyΕ„ski, Jaroslaw ;LΓΆhner, Rainald πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 123 KB

A way has been found to form indirect addressing lists in parallel on shared-memory parallel machines. The maximum possible speed-up for typical tetrahedral grids is approximately 1 : 23. The algorithm requires an additional scratch array to shift from the serial `elements surrounding points' to the

A parameterized shared-memory scheme for
A parameterized shared-memory scheme for
✍ Francisco Almeida; Domingo GimΓ©nez; Jose J. LΓ³pez-EspΓ­n πŸ“‚ Article πŸ“… 2011 πŸ› Springer US 🌐 English βš– 376 KB
Recursive constructions for perfect secr
Recursive constructions for perfect secret sharing schemes
✍ Hung-Min Sun; Shiuh-Pyng Shieh πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 595 KB

A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information regarding the se