|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-75142-7 |
| 003 |
DE-He213 |
| 005 |
20230406065811.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540751427
|9 978-3-540-75142-7
|
| 024 |
7 |
|
|a 10.1007/978-3-540-75142-7
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Distributed Computing
|h [electronic resource] :
|b 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings /
|c edited by Andrzej Pelc.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XVI, 512 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4731
|
| 505 |
0 |
|
|a Invited Talks -- Routing and Scheduling with Incomplete Information -- Time-Efficient Broadcasting in Radio Networks -- A Subjective Visit to Selected Topics in Distributed Computing -- Regular Papers -- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions -- A Simple Population Protocol for Fast Robust Approximate Majority -- A Denial-of-Service Resistant DHT -- Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks -- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station -- Scalable Load-Distance Balancing -- Time Optimal Asynchronous Self-stabilizing Spanning Tree -- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links -- Weakening Failure Detectors for k-Set Agreement Via the Partition Approach -- Amnesic Distributed Storage -- Distributed Approximations for Packing in Unit-Disk Graphs -- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors -- Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time -- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks -- Gossiping in a Multi-channel Radio Network -- The Space Complexity of Unbounded Timestamps -- Approximating Wardrop Equilibria with Finitely Many Agents -- Energy and Time Efficient Broadcasting in Known Topology Radio Networks -- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree -- On the Message Complexity of Indulgent Consensus -- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result -- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes -- On the Communication Surplus Incurred by Faulty Processors -- Output Stability Versus Time Till Output -- A Distributed Maximal Scheduler for Strong Fairness -- Cost-Aware Caching Algorithms for Distributed Storage Servers -- Push-to-Pull Peer-to-Peer Live Streaming -- Probabilistic Opaque Quorum Systems -- Detecting Temporal Logic Predicates on Distributed Computations -- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks -- Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms -- Automatic Classification of Eventual Failure Detectors -- Brief Announcements -- When 3f?+?1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus -- On the Complexity of Distributed Greedy Coloring -- Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks -- Transaction Safe Nonblocking Data Structures -- Long Live Continuous Consensus -- Fully Distributed Algorithms for Convex Optimization Problems -- On the Power of Impersonation Attacks -- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary -- A Formal Analysis of the Deferred Update Technique -- DISC 20th Anniversary -- DISC at Its 20th Anniversary (Stockholm, 2006) -- DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems -- DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982 -- DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Operating systems (Computers).
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Operating Systems.
|
| 700 |
1 |
|
|a Pelc, Andrzej.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540844082
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540751410
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4731
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-75142-7
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
