| 000 | 02696nam a22004335i 4500 | ||
|---|---|---|---|
| 999 |
_c387309 _d387309 |
||
| 001 | 387309 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230312130329.0 | ||
| 006 | a||||fo|||| 00| 0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2014 sz | s |||| 0|eng d | ||
| 020 | _a9783031020100 | ||
| 024 | 7 |
_a10.1007/978-3-031-02010-0 _2doi |
|
| 040 |
_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC |
||
| 050 | 4 |
_aQA76.9.D5 _b2014 EB |
|
| 100 | 1 |
_aAttiya, Hagit _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687269 |
|
| 245 | 1 | 0 |
_aImpossibility Results for Distributed Computing _cby Hagit Attiya, Faith Ellen |
| 250 | _a1st edition 2014 | ||
| 264 | 1 |
_aCham _bSpringer International Publishing _c2014 |
|
| 300 | _a1 recurso en línea (XIII, 146 páginas) | ||
| 336 |
_atexto _btxt _2rdacontent |
||
| 337 |
_aelectrónico _bc _2rdamedia |
||
| 338 |
_arecurso electrónico _bcr _2rdacarrier |
||
| 347 |
_aarchivo de texto _bPDF |
||
| 490 | 0 |
_aSynthesis Lectures on Distributed Computing Theory _x2155-1634 |
|
| 505 | 0 | _aAcknowledgments -- Introduction -- Indistinguishability -- Shifting and Scaling -- Scenario Arguments -- Information Theory Arguments -- Covering Arguments -- Valency Arguments -- Combinatorial Arguments -- Reductions and Simulations -- Bibliography -- Authors' Biographies. | |
| 520 | _aTo understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared. | ||
| 988 | _aSynthesis Collection of Technology_2014 | ||
| 650 | 7 |
_2embne _9139136 _aLógica matemática |
|
| 650 | 7 |
_2embne _9165250 _aComplejidad computacional |
|
| 650 | 7 |
_2embne _9156434 _aProceso distribuido (Informática) |
|
| 700 | 1 |
_aEllen, Faith, _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687270 _d1956- |
|
| 776 | 0 | 8 |
_iPrinted edition: _z9783031008825 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031031380 |
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02010-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 942 |
_2lcc _cLE |
||
| 998 |
_b03/2023 _dz _esc _zSI |
||